Analysis of the hash function design strategy called SMASH

IEEE Transactions on Information Theory

Volumn 54, Issue 8, 2008, Pages 3647-3655

  Lamberger, Mario ^a   Pramstaller, Norbert ^a   Rechberger, Christian ^a   Rijmen, Vincent ^a,b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

(second) preimages; Algorithm design and analysis; Collisions; Complexity theory; Computational modeling; Construction; Cryptanalysis; Cryptography; Equations; Filling; Finite element methods; Galois fields; Hash functions; Image coding; Joining processes; Object recognition; Polynomials; Prediction algorithms; Resistance; Sections; Security; Standards; Vectors

Indexed keywords

COMPUTER CRIME; FUNCTIONS;

(SECOND) PREIMAGES; ALGORITHM DESIGN AND ANALYSIS; COLLISIONS; COMPLEXITY THEORY; COMPUTATIONAL MODELING; CONSTRUCTION; CRYPTANALYSIS; CRYPTOGRAPHY; EQUATIONS; FILLING; FINITE ELEMENT METHODS; GALOIS FIELDS; HASH FUNCTION DESIGN; HASH FUNCTIONS; IMAGE CODING; JOINING PROCESSES; MATHEMATICAL STRUCTURES; OBJECT RECOGNITION; POLYNOMIALS; PREDICTION ALGORITHMS; RESISTANCE; SECTIONS; SECURITY; STANDARDS; VECTORS;

FUNCTION EVALUATION;

EID: 48849093183     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.926420     Document Type: Article

References (17)

1. E. Biham and R. Chen, "Near-collisions of SHA-0," in Advances in Cryptology - CRYPTO 2004, Lecture Notes in Computer Science, M. K. Franklin, Ed. Berlin, Germany: Springer-Verlag, 2004, vol. 3152, pp. 290-305.
2. F. Chabaud and A. Joux, "Differential collisions in SHA-0," in Advances in Cryptology - CRYPTO'98, Lecture Notes in Compute Science, H. Krawczyk, Ed. Berlin, Germany: Springer-Verlag, 1998, vol. 1462, pp. 56-71.
3. C. De Cannière and C. Rechberger, "Finding SHA-1 characteristics: General results and applications," in Advances in Cryptology - ASIACRYPT 2006, Lecture Notes in Computer Science, X. Lai and K. Chen, Eds. : Springer-Verlag, 2006, vol. 4248, pp. 1-20.
4. H. Dobbertin, "Cryptanalysis of MD4," in Fast Software Encryption 1996. Lecture Notes in Computer Science, B. Preneel, Ed. Berlin, Germany: Springer-Verlag, 1996, vol. 1039, pp. 53-69.
5. X. Wang, X. Lai, D. Feng, H. Chen, and X. Yu, "Cryptanalysis of the Hash functions MD4 and RIPEMD," in Advances in Cryptology - EUROCRYPT 2005, Lecture Notes in Computer Science, R. Cramer, Ed. Berlin, Germany: Springer-Verlag, 2005, vol. 3494, pp. 1-18.
6. X. Wang and H. Yu, "How to Break MD5 and Other Hash Functions," in Advances in Cryptology - EUROCRYPT 2005, Lecture Notes in Computer Science, R. Cramer, Ed. Berlin, Germany: Springer-Verlag, 2005, vol. 3494, pp. 19-35.
7. X. Wang, Y. L. Yin, and H. Yu, "Finding collisions in the full SHA-1," in Advances in Cryptology - CRYPTO 2005, Lecture Notes in Computer Science, V. Shoup, Ed. Berlin, Germany: Springer, 2005, vol. 3621, pp. 17-36.
8. L. R. Knudsen, "SMASH - A cryptographic hash function," in Fast Software Encryption 2005, Lecture Notes in Computer Science, H. Gilbert and H. Handschuh, Eds. Berlin, Germany: Springer-Verlag, 2005, vol. 3557, pp. 228-242.
9. Secure Hash Standard, FIPS-180-2, National Institute of Standards and Technology (NIST), Aug. 2002 [Online]. Available: http:// www.itl.nist.gov/fipspubs/
10. N. Pramstaller, C. Rechberger, and V. Rijmen, "Breaking a new Hash function design strategy called SMASH," in Selected Areas in Cryptography, SAC, Lecture Notes in Computer Science, B. Preneel and S. E. Tavares, Eds. Berlin, Germany: Springer-Verlag, 2006, vol. 3897, pp. 233-244.
11. M. Lamberger, N. Pramstaller, C. Rechberger, and V. Rijmen, "Second preimages for SMASH," in Topics in Cryptology - CT-RSA 2007, Lecture Notes in Computer Science, M. Abe, Ed. Berlin, Germany: Springer-Verlag, 2007, vol. 4377, pp. 101-111.
12. S. Even and Y. Mansour, "A construction of a cipher from a single pseudorandom permutation," in Advances in Cryptology - ASIACRYPT'91, Lecture Notes in Computer Science, H. Imai, R. L. Rivest, and T. Matsumoto, Eds. Berlin, Germany: Springer-Verlag, 1991, vol. 739, pp. 210-224.
13. J. Black, M. Cochran, and T. Shrimpton, "On the impossibility of highly-efficient block-cipher-based hash functions," in Advances in Cryptology - EUROCRYPT 2005, Lecture Notes in Computer Science, R. Cramer, Ed. Berlin, Germany: Springer-Verlag, 2005, vol. 3494, pp. 526-541.
14. J. Black, P. Rogaway, and T. Shrimpton, "Black-box analysis of the block-cipher-based Hash-function constructions from PGV," in Advances in Cryptology - CRYPTO 2002, Lecture Notes in Computer Science M. Yung, Ed. Berlin, Germany: Springer-Verlag, 2002, vol. 3494, pp. 320-335.
15. B. Preneel, R. Govaerts, and J. Vandewalle, "Hash functions based on block ciphers: A synthetic approach," in Advances in Cryptology - CRYPTO'93, Lecture Notes in Computer Science, D. R. Stinson, Ed. Berlin, Germany: Springer-Verlag, 1994, vol. 773, pp. 368-378.
16. B. S. Kaliski, "The MD2 message-digest algorithm," Apr. 1992 [Online]. Available: http://www.faqs.org/rfcs/rfc1319.html, Request for Comments (RFC) 1319, Internet Activities Board, Internet Privacy Task Force.
17. D. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd ed. Boston, MA: Addison-Wesley, 1997.