Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions

DOI10.1007/978-3-642-25385-0_16zbMath1227.94056OpenAlexW1800808134MaRDI QIDQ3102193

Tomislav Nad, Martin Schläffer, Florian Mendel

Publication date: 2 December 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_16

zbMATH Keywords

hash functionsSHA-2collision attackdifferential characteristicgeneralized conditions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Quantum collision attacks on reduced SHA-256 and SHA-512 ⋮ Boomerang Attack on Step-Reduced SHA-512 ⋮ A structure-based chaotic hashing scheme ⋮ Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160 ⋮ Improved Top-Down Techniques in Differential Cryptanalysis ⋮ Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP ⋮ Second order collision for the 42-step reduced DHA-256 hash function ⋮ MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck ⋮ Proposing an MILP-based method for the experimental verification of difference-based trails: application to SPECK, SIMECK ⋮ Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA ⋮ Forgery Attacks on Round-Reduced ICEPOLE-128 ⋮ Rotational rebound attacks on reduced Skein ⋮ Automatic verification of differential characteristics: application to reduced Gimli ⋮ New Collision Attacks on Round-Reduced Keccak

This page was built for publication: Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions