Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
From MaRDI portal
Publication:6157493
DOI10.1007/978-3-030-92062-3_9zbMath1514.94076OpenAlexW3201982261MaRDI QIDQ6157493
Zhi-Yu Zhang, Siwei Sun, Xiaoyun Wang, Xiaoyang Dong, Lei Hu, Congming Wei
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92062-3_9
quantum computationcollision attacksMILP\texttt{SKINNY}rebound attacks\texttt{Saturnin}\texttt{whirlpool}
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (3)
Improved graph-based model for recovering superpoly on Trivium ⋮ Triangulating rebound attack on AES-like hashing ⋮ Nostradamus goes quantum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel collision search with cryptanalytic applications
- Quantum algorithms for the \(k\)-XOR problem
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Cryptanalysis results on spook. Bringing full-round shadow-512 to the light
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Quantum collision attacks on reduced SHA-256 and SHA-512
- Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Structural Evaluation of AES and Chosen-Key Distinguisher of 9-Round AES-128
- Improved Analysis of ECHO-256
- Collision Attack on 5 Rounds of Grøstl
- Multiple Limited-Birthday Distinguishers and Applications
- Meet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool
- Non-full-active Super-Sbox Analysis: Applications to ECHO and Grøstl
- Quantum Random Access Memory
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
- Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others
- Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
- Rebound Distinguishers: Results on the Full Whirlpool Compression Function
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- Improved Rebound Attack on the Finalist Grøstl
- Investigating Fundamental Security Requirements on Whirlpool: Improved Preimage and Collision Attacks
- Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting
- How to Improve Rebound Attacks
- Quantum cryptanalysis of hash and claw-free functions
- One Way Hash Functions and DES
This page was built for publication: Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
