Security reductions of the second round SHA-3 candidates
From MaRDI portal
Publication:3073779
DOI10.1007/978-3-642-18178-8_5zbMATH Open1371.94619OpenAlexW2058940365MaRDI QIDQ3073779FDOQ3073779
Authors: E. A. Andreeva, Bart Mennink, Bart Preneel
Publication date: 11 February 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18178-8_5
Recommendations
- Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
- The State of Hash Functions and the NIST SHA-3 Competition
- The first 30 years of cryptographic hash functions and the NIST SHA-3 competition
- The NIST SHA-3 Competition: A Perspective on the Final Year
- Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512
Cited In (12)
- The NIST SHA-3 Competition: A Perspective on the Final Year
- Improved indifferentiability security bound for the JH mode
- Extracts from the SHA-3 Competition
- The State of Hash Functions and the NIST SHA-3 Competition
- Replacing SHA-2 with SHA-3 Enhances Generic Security of $$\mathtt {HMAC}$$
- The first 30 years of cryptographic hash functions and the NIST SHA-3 competition
- Security analysis of the mode of JH hash function
- StriBob: аутентифицированное шифрование с помощью подстановки LPS из ГОСТ Р 34.11-2012
- Compactness of hashing modes and efficiency beyond Merkle tree
- Open problems in hash function security
- Tight preimage resistance of the sponge construction
- Provable Security of BLAKE with Non-ideal Compression Function
This page was built for publication: Security reductions of the second round SHA-3 candidates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073779)