The first collision for full SHA-1
From MaRDI portal
Publication:1675745
DOI10.1007/978-3-319-63688-7_19zbMath1407.94153OpenAlexW2604745103MaRDI QIDQ1675745
Ange Albertini, Marc Stevens, Pierre Karpman, Yarik Markov, Elie Bursztein
Publication date: 3 November 2017
Full work available at URL: https://ir.cwi.nl/pub/26763
Related Items (19)
Quantum collision attacks on reduced SHA-256 and SHA-512 ⋮ On the cost of ASIC hardware crackers: a SHA-1 case study ⋮ Collapseability of Tree Hashes ⋮ Efficient implementation of SHA-3 hash function on 8-bit AVR-based sensor nodes ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160 ⋮ Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ Triangulating rebound attack on AES-like hashing ⋮ Practical-time related-key attack on GOST with secret S-boxes ⋮ Unnamed Item ⋮ The phantom of differential characteristics ⋮ Truth Assignments as Conditional Autarkies ⋮ Hash function based on quantum walks ⋮ New records of pre-image search of reduced SHA-1 using SAT solvers ⋮ Quantifying the security cost of migrating protocols to practice ⋮ Automatic verification of differential characteristics: application to reduced Gimli ⋮ Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
This page was built for publication: The first collision for full SHA-1
