Branching Heuristics in Differential Collision Search with Applications to SHA-512

DOI10.1007/978-3-662-46706-0_24zbMath1382.94101OpenAlexW2184293115MaRDI QIDQ2946924

Florian Mendel, Martin Schläffer, Maria Eichlseder

Publication date: 18 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-46706-0_24

zbMATH Keywords

cryptanalysishash functionsbranching heuristiccollision attackguess-and-determine attacksha-512

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Quantum collision attacks on reduced SHA-256 and SHA-512 ⋮ Boomerang Attack on Step-Reduced SHA-512 ⋮ Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP ⋮ Speeding up MILP Aided Differential Characteristic Search with Matsui’s Strategy ⋮ Forgery Attacks on Round-Reduced ICEPOLE-128

This page was built for publication: Branching Heuristics in Differential Collision Search with Applications to SHA-512