Cryptography and Coding

DOI10.1007/11586821MaRDI QIDQ5897515zbMATH OpenOpenAlexFDO

Authors Norbert Pramstaller, Christian Rechberger, Vincent Rijmen

Publication date 1 November 2006

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

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

zbMATH Keywords

collisioncryptanalysishash functionLinear codelow-weight vectorSHA-1

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient Collision Search Attacks on SHA-0
• New collision attacks on SHA-1 based on optimal joint local-collision analysis
• Practical collision attacks against round-reduced SHA-3
• The Impact of Carries on the Complexity of Collision Attacks on SHA-1
• Classification and generation of disturbance vectors for collision attacks against SHA-1
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Collision attacks on round-reduced SHA-3 using conditional internal differentials
• Practical free-start collision attacks on 76-step SHA-1
• Multicollision attacks and generalized iterated hash functions
• Matrix representation of conditions for the collision attack of SHA-1 and its application to the message modification

Cited in

(18)

• Practical collisions for EnRUPT
• Classification and generation of disturbance vectors for collision attacks against SHA-1
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Optimal covering codes for finding near-collisions
• Cryptanalysis of the Tiger Hash Function
• Attacking Reduced Round SHA-256
• Bit-Free Collision: Application to APOP Attack
• scientific article; zbMATH DE number 1543036 (Why is no real title available?)
• Classification of disturbance vectors for collision attack in SHA-1
• Advances in Cryptology – CRYPTO 2004
• Collisions of SHA-0 and Reduced SHA-1
• Provably Good Codes for Hash Function Design
• Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
• New Collision Attacks against Up to 24-Step SHA-2
• Coding and Cryptography
• Exploring SAT for cryptanalysis: (quantum) collision attacks against 6-round SHA-3
• Memoryless near-collisions via coding theory
• Collision attack on \({\mathtt Grindahl}\)

This page was built for publication: Cryptography and Coding

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