Update on SHA-1

DOI10.1007/978-3-540-30574-3_6MaRDI QIDQ5710850zbMATH OpenOpenAlexFDO

Authors Vincent Rijmen, Elisabeth Oswald

Publication date 8 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

cryptanalysishash functions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Collisions of SHA-0 and Reduced SHA-1
• Finding Collisions in the Full SHA-1
• Cryptanalysis of SHA-0 and reduced SHA-1
• Algebraic Cryptanalysis of 58-Round SHA-1
• Finding SHA-1 Characteristics: General Results and Applications

Cited in

(18)

• Cryptanalysis of SHA-0 and reduced SHA-1
• Practical collisions for EnRUPT
• Classification and generation of disturbance vectors for collision attacks against SHA-1
• Analysis of SHA-1 in encryption mode
• Malicious hashing: Eve's variant of SHA-1
• Analysis of SHA-1 with reducing width for modular differential attack
• Matrix representation of conditions for the collision attack of SHA-1 and its application to the message modification
• Boomerang Distinguisher for the SIMD-512 Compression Function
• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• Attacking Reduced Round SHA-256
• Herding Hash Functions and the Nostradamus Attack
• The Impact of Carries on the Complexity of Collision Attacks on SHA-1
• Classification of disturbance vectors for collision attack in SHA-1
• Collisions of SHA-0 and Reduced SHA-1
• Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
• Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256
• Rotational rebound attacks on reduced Skein
• Efficient implementation of SHA-3 hash function on 8-bit AVR-based sensor nodes

This page was built for publication: Update on SHA-1

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