Algebraic Cryptanalysis of 58-Round SHA-1

DOI10.1007/978-3-540-74619-5_22zbMATH Open1186.94472OpenAlexW1598156343MaRDI QIDQ3524902FDOQ3524902

Hideki Imai, Ludovic Perret, Makoto Sugita, Mitsuru Kawazoe

Publication date: 16 September 2008

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74619-5_22

Recommendations

• Algebraic cryptanalysis of one-round s-AES
• Algebraic analysis of SHA-3 algorithm security
• Algebraic Cryptanalysis of CTRU Cryptosystem
• Some Elementary Cryptanalysis of Algebraic Cryptography
• Cryptanalysis of SHA-0 and reduced SHA-1
• Algebraic Cryptanalysis of the Data Encryption Standard
• Algebraic Cryptanalysis of Simplified AES∗
• Algebraic Cryptanalysis
• A Five-Round Algebraic Property of the Advanced Encryption Standard
• Algebraic Attacks on Round-Reduced Keccak

zbMATH Keywords

differential attackSHA-1Gröbner basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Cited In (9)

• Boolean ring cryptographic equation solving
• Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques
• Topics in Cryptology – CT-RSA 2005
• Collisions of SHA-0 and Reduced SHA-1
• Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
• Classification of disturbance vectors for collision attack in SHA-1
• Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks
• Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512
• Classification and generation of disturbance vectors for collision attacks against SHA-1

This page was built for publication: Algebraic Cryptanalysis of 58-Round SHA-1

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