Improved Collision Search for SHA-0

DOI10.1007/11935230_2zbMATH Open1172.94591OpenAlexW2145706556MaRDI QIDQ5459067FDOQ5459067

Authors: Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Jun Yajima, Noboru Kunihiro, Kazuo Ohta 

Publication date: 24 April 2008

Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11935230_2

Recommendations

• Efficient Collision Search Attacks on SHA-0
• Collisions of SHA-0 and Reduced SHA-1
• scientific article; zbMATH DE number 1302838
• Collisions on SHA-0 in One Hour
• Advances in Cryptology – CRYPTO 2004

zbMATH Keywords

sufficient conditionmessage modificationcollision attackSHA-0

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (6)

• Advances in Cryptology – CRYPTO 2004
• Rotational rebound attacks on reduced Skein
• Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
• How to construct sufficient conditions for hash functions
• Matrix representation of conditions for the collision attack of SHA-1 and its application to the message modification
• Classification and generation of disturbance vectors for collision attacks against SHA-1

This page was built for publication: Improved Collision Search for SHA-0

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459067)