SMASH - A cryptographic hash function

Lecture Notes in Computer Science

Volumn 3557, Issue , 2005, Pages 228-242

  Knudsen, Lars R ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; FUNCTIONS; STRATEGIC PLANNING;

DESIGN STRATEGIES; HASH FUNCTION DESIGN; MD-4 FAMILY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 26444604937     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11502760_15     Document Type: Conference Paper

References (21)

1. Martin Clausen. An implementation of SMASH-256. Private communications.
2. E. Biham, R. Chen. Near-Collisions of SHA-0. In Matt Franklin, editor, Advances in Cryptology: CRYPTO'2004, Lecture Notes in Computer Science 3152. Springer Verlag, 2004.
3. R.J. Anderson, E. Biham, and L.R. Knudsen. SERPENT - a 128-bit block cipher. A candidate for the Advanced Encryption Standard. Documentation available at http : //www. ramkilde. com/serpent.
4. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Neal Koblitz, editor, Advances in Cryptology: CRYPTO'96, Lecture Notes in Computer Science 1109, pages 1-15. Springer Verlag, 1996.
5. J. Daemen. A new approach to block cipher design. In R. Anderson, editor, Fast Software Encryption - Proc. Cambridge Security Workshop, Cambridge, U.K., Lecture Notes in Computer Science 809, pages 18-32. Springer Verlag, 1994.
6. I.B. Damgård. A design principle for hash functions. In G. Brassard, editor, Advances in Cryptology: CRYPTO'89, Lecture Notes in Computer Science 435, pages 416-427. Springer Verlag, 1990.
7. H. Dobbertin, A. Bosselaers, and B. Preneel. RIPEMD-160: A strenghened version of RIPEMD. In Gollmann D., editor, Fast Software Encryption, Third International Workshop, Cambridge, UK, February 1996, Lecture Notes in Computer Science 1039, pages 71-82. Springer Verlag, 1996.
8. Brian Gladman. Available at http : //fp. gladman. plus. com/cryptography_technology/sha/index. htm
9. X. Lai. On the design and security of block ciphers. In J.L. Massey, editor, ETH Series in Information Processing, volume 1. Hartung-Gorre Verlag, Konstanz, 1992.
10. X. Lai and J.L. Massey. Hash functions based on block ciphers. In Advances in Cryptology - EUROCRYPT'92, Lecture Notes in Computer Science 658, pages 55-70. Springer Verlag, 1993.
11. R. Merkle. One way hash functions and DES. In G. Brassard, editor, Advances in Cryptology - CRYPTO'89, Lecture Notes in Computer Science 435, pages 428-446. Springer Verlag, 1990.
12. D.A. Osvik. Speeding Up Serpent, Third Advanced Encryption Standard Candidate Conference, April 13-14, 2000, New York, USA, pp. 317-329, NIST, 2000.
13. NIST. Secure hash standard. FIPS 180-1, US Department of Commerce, Washington D.C., April 1995.
14. NIST. Secure hash standard. FIPS 180-2, US Department of Commerce, Washington D.C., August 2002.
15. N. Pramstaller, C. Rechberger, and V. Rijmen. Smashing SMASH. The IACR Eprint Archive, 2005/081.
16. B. Preneel. Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven, January 1993.
17. B. Preneel, R. Govaerts, and J. Vandewalle. On the power of memory in the design of collision resistant hash functions. In J. Seberry and Y. Zheng, editors, Advances in Cryptology: AusCrypt 92, Lecture Notes in Computer Science 718, pages 105-121. Springer Verlag, 1993.
18. V. Rijmen. Update on SHA-1. Accepted for presentation at CT-RSA'2005.
19. R.L. Rivest. The MD4 message digest algorithm. In S. Vanstone, editor, Advances in Cryptology - CRYPTO'90, Lecture Notes in Computer Science 537, pages 303-311. Springer Verlag, 1991.
20. R.L. Rivest. The MD5 message-digest algorithm. Request for Comments (RFC) 1321, Internet Activities Board, Internet Privacy Task Force, April 1992.
21. X. Wang, D. Feng, X. Lai, H. Yu. Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report 2004/199. Available at eprint.iacr.org/2004/199.