Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound

DOI10.1007/978-3-030-45724-2_9zbMath1492.81040OpenAlexW3013100524MaRDI QIDQ2119014

Akinori Hosoyamada, Yu Sasaki

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_9

zbMATH Keywords

cryptanalysiscollisionhash functionrebound attacksymmetric key cryptographyquantum attackAES-MMOwhirlpool

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum coding (general) (81P70) Quantum control (81Q93) Quantum cryptography (quantum-theoretic aspects) (81P94) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Related Items (25)

Quantum collision attacks on reduced SHA-256 and SHA-512 ⋮ Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ A note on quantum collision resistance of double-block-length compression functions ⋮ New results on quantum boomerang attacks ⋮ Improved attacks against reduced-round Whirlwind ⋮ Superposition meet-in-the-middle attacks: updates on fundamental security of AES-like hashing ⋮ Triangulating rebound attack on AES-like hashing ⋮ Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting ⋮ Nostradamus goes quantum ⋮ Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits ⋮ Exploring SAT for cryptanalysis: (quantum) collision attacks against 6-round SHA-3 ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Simplified MITM modeling for permutations: new (quantum) attacks ⋮ Quantum linear key-recovery attacks using the QFT ⋮ Quantum search for scaled hash function preimages ⋮ New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions ⋮ Quantum circuit implementations of AES with fewer qubits ⋮ Quantum collision attacks on AES-like hashing with low quantum random access memories ⋮ Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli} ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing ⋮ A new post-quantum voting protocol based on physical laws ⋮ Quantum zero correlation linear cryptanalysis ⋮ Some efficient quantum circuit implementations of Camellia ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions ⋮ Attacks on beyond-birthday-bound MACs in the quantum setting

Uses Software

• Whirlpool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On quantum slide attacks
• An efficient quantum collision search algorithm and implications on symmetric cryptography
• Low-communication parallel quantum multi-target preimage search
• Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
• Quantum attacks without superposition queries: the offline Simon's algorithm
• The rebound attack and subspace distinguishers: application to Whirlpool
• Breaking Symmetric Cryptosystems Using Quantum Period Finding
• Meet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool
• Quantum Computation and Quantum Information
• Random Oracles in a Quantum World
• The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
• Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
• Rebound Distinguishers: Results on the Full Whirlpool Compression Function
• On the Power of Quantum Computation
• Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
• Improved Rebound Attack on the Finalist Grøstl
• (Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others
• Investigating Fundamental Security Requirements on Whirlpool: Improved Preimage and Collision Attacks
• How to Break MD5 and Other Hash Functions
• Finding Collisions in the Full SHA-1
• Quantum cryptanalysis of hash and claw-free functions

This page was built for publication: Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound