From collisions to chosen-prefix collisions application to full SHA-1

DOI10.1007/978-3-030-17659-4_18MaRDI QIDQ2292706zbMATH OpenOpenAlexFDO

Authors Gaëtan Leurent, Thomas Peyrin

Publication date 4 February 2020

Full work available at URL https://hal.inria.fr/hal-02424900/file/SHA1_EC19.pdf

zbMATH Keywords

chosen-prefix collisioncryptanalysishash functionMD5SHA-1

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Chosen-prefix collisions for MD5 and applications
• New collision attacks on SHA-1 based on optimal joint local-collision analysis
• A survey of chosen-prefix collision attacks
• The first collision for full SHA-1
• Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities

Cited in

(13)

• The first collision for full SHA-1
• Chosen-prefix collisions for MD5 and applications
• New records of pre-image search of reduced SHA-1 using SAT solvers
• Reverse-engineering of the cryptanalytic attack used in the flame super-malware
• Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
• New collision attacks on SHA-1 based on optimal joint local-collision analysis
• A survey of chosen-prefix collision attacks
• Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
• New records in collision attacks on SHA-2
• Improved semi-free-start collision attacks on RIPEMD-160
• Collision attacks on SHA-256 up to 37 steps with improved trail search
• New records in collision attacks on SHA-2
• On the cost of ASIC hardware crackers: a SHA-1 case study

This page was built for publication: From collisions to chosen-prefix collisions application to full SHA-1

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