Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Cryptanalysis of AES

Xavier Bonnetain, María Naya‐Plasencia, André Schrottenloher

Published Oct 8, 2018• 0 citations
OpenAlex

Related papers

AES and Quantum Cryptography

Thomas G. Robertazzi

Springer eBooks•Jan 1, 2017•0 citations

Quantum cryptanalysis of SPN ciphers with known plaintext

Uroosa Kiran, Aneela Safdar, Saif Ullah Khalid +2 more

Key recovery attack on SPN ciphers such as AES is NP hard in complexity. Previous studies have estimated the quantum resources required for implementing Grover’s key search for AES, but these are largely theoretical in nature. The key challenges to implement Grover’s algorithm on current quantum hardware include the number of available qubits, noise, and decoherence. However, the rapid advancement of hardware has brought us closer to practical realization for the cryptanalysis of light-weight SPN ciphers. This study presents an efficient quantum circuit implementation of Mini-AES, a 16-bit variant of AES, employing standard CNOT and Toffoli gates. To the best of our knowledge, our work provides the first complete quantum implementations of all core Mini-AES components for the quantum oracle. The effects of noise are emulated for each module of the quantum oracle and quantified. Furthermore, Grover’s algorithm is applied to Mini-AES to perform successful key recovery through a known-plaintext attack, demonstrating significant amplitude amplification while using near-optimal Grover’s iterations, thereby reducing the total quantum volume. The optimal Grover’s iterations have been obtained empirically as well as validated with finite-shot analysis. Notably, the application of Grover’s algorithm reveals key clustering behavior in Mini-AES, which has been corroborated through classical simulation.

npj Quantum Information•Apr 1, 2026•0 citations

Quantum cryptanalysis of the full AES-256-based Davies–Meyer, Hirose and MJH hash functions

Seungjun Baek, Sehee Cho, Jongsung Kim

Quantum Information Processing•Apr 27, 2022•6 citations

Quantum Analysis of AES

Anubhab Baksi, Kyungbae Jang

Computer architecture and design methodologies•Jan 1, 2024•3 citations

A Unified Quantum Circuit Framework for Grover Search and Quantum Walks in NISQ Cryptanalysis

Leonardo Lavagna, Giacomo Vittori, Antonello Rosato +1 more

This paper explores the use of quantum search in symmetric cryptanalysis within the Noisy Intermediate-Scale Quantum (NISQ) regime, introducing a unified quantum circuit framework that expresses Grover’s algorithm as a coined quantum walk. This enables a direct comparison of the two approaches, previously treated separately, under a common model of circuital resources and noise. The framework is implemented and tested on cyclic permutations and AES-like primitives. Experiments show that, in the ideal case, the walk exhibits the familiar Grover amplification curve although, under realistic depolarizing and readout noise, the peaks are damped and the optimal number of steps falls below the theoretical value. In the AES examples, the probability of recovering the key remains negligible. Taken together, these results extend earlier analyses and suggest that symmetric encryption maintains classical-level security in the NISQ era of quantum circuits, while also providing a reproducible testbed for future studies.

IEEE International Symposium on Circuits and Systems proceedings•May 24, 2026•0 citations

Quantum cryptanalysis

Delaram Kahrobaei, Flores, Ramón, Marialaura Noce +2 more

Mathematical surveys and monographs•Jan 1, 2024•0 citations
Key recovery attack on SPN ciphers such as AES is NP hard in complexity. Previous studies have estimated the quantum resources required for implementing Grover’s key search for AES, but these are largely theoretical in nature. The key challenges to implement Grover’s algorithm on current quantum hardware include the number of available qubits, noise, and decoherence. However, the rapid advancement of hardware has brought us closer to practical realization for the cryptanalysis of light-weight SPN ciphers. This study presents an efficient quantum circuit implementation of Mini-AES, a 16-bit variant of AES, employing standard CNOT and Toffoli gates. To the best of our knowledge, our work provides the first complete quantum implementations of all core Mini-AES components for the quantum oracle. The effects of noise are emulated for each module of the quantum oracle and quantified. Furthermore, Grover’s algorithm is applied to Mini-AES to perform successful key recovery through a known-plaintext attack, demonstrating significant amplitude amplification while using near-optimal Grover’s iterations, thereby reducing the total quantum volume. The optimal Grover’s iterations have been obtained empirically as well as validated with finite-shot analysis. Notably, the application of Grover’s algorithm reveals key clustering behavior in Mini-AES, which has been corroborated through classical simulation.
This paper explores the use of quantum search in symmetric cryptanalysis within the Noisy Intermediate-Scale Quantum (NISQ) regime, introducing a unified quantum circuit framework that expresses Grover’s algorithm as a coined quantum walk. This enables a direct comparison of the two approaches, previously treated separately, under a common model of circuital resources and noise. The framework is implemented and tested on cyclic permutations and AES-like primitives. Experiments show that, in the ideal case, the walk exhibits the familiar Grover amplification curve although, under realistic depolarizing and readout noise, the peaks are damped and the optimal number of steps falls below the theoretical value. In the AES examples, the probability of recovering the key remains negligible. Taken together, these results extend earlier analyses and suggest that symmetric encryption maintains classical-level security in the NISQ era of quantum circuits, while also providing a reproducible testbed for future studies.