Security Reductions of the Second Round SHA-3 Candidates-Reference-Cited by-同舟云学术

Security Reductions of the Second Round SHA-3 Candidates

Published:2011 Issue: Volume: Page:39-53
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Andreeva Elena,Mennink Bart,Preneel Bart

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18178-8_5

Reference46 articles.

1. Lecture Notes in Computer Science;E. Andreeva,2010

2. Andreeva, E., Mennink, B., Preneel, B.: Security reductions of the second round SHA-3 candidates. Full version of this paper. Cryptology ePrint Archive, Report 2010/381 (2010)

3. Lecture Notes in Computer Science;E. Andreeva,2007

4. Aumasson, J.P., Henzen, L., Meier, W., Phan, R.: SHA-3 proposal BLAKE (2009)

5. Bellare, M., Kohno, T., Lucks, S., Ferguson, N., Schneier, B., Whiting, D., Callas, J., Walker, J.: Provable security support for the skein hash family (2009)

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

1. Tight Preimage Resistance of the Sponge Construction;Advances in Cryptology – CRYPTO 2022;2022

2. Compactness of Hashing Modes and Efficiency Beyond Merkle Tree;Lecture Notes in Computer Science;2021

3. Efficient parallelizable hashing using small non-compressing primitives;International Journal of Information Security;2015-04-29

4. Sufficient conditions for sound tree and sequential hashing modes;International Journal of Information Security;2013-11-23

5. FPGA-based implementation alternatives for the inner loop of the Secure Hash Algorithm SHA-256;Microprocessors and Microsystems;2013-08