On the Minimum Number of Multiplications Necessary for Universal Hash Functions-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the Minimum Number of Multiplications Necessary for Universal Hash Functions

Published:2015 Issue: Volume: Page:489-508
ISSN:0302-9743
Container-title:Fast Software Encryption
language:
Short-container-title:

Author:

Nandi Mridul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46706-0_25

Reference49 articles.

1. Belaga, G.E.: Some problems in the computation of polynomials. Doklady Akademii Nauk SSSR 123, 775–777 (1958). ISSN 00023264. Citations in this document: §6

2. Lecture Notes in Computer Science;M Bellare,2006

3. Lecture Notes in Computer Science;J Bierbrauer,1994

4. Lecture Notes in Computer Science;J Black,1999

5. Blaum, M., Bruck, J., Vardy, A.: MDS array codes with independent parity symbols. IEEE Trans. Inf. Theor. 42(2), 529–542 (1996). Citations in this document: §4.1

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Implicit Key-Stretching Security of Encryption Schemes;Lecture Notes in Computer Science;2023

2. HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite Fields;Lecture Notes in Computer Science;2021

3. On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers;Cryptography and Communications;2018-01-06

4. Bernstein Bound on WCS is Tight;Lecture Notes in Computer Science;2018

5. TriviA and uTriviA: two fast and secure authenticated encryption schemes;Journal of Cryptographic Engineering;2016-09-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP