English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Applying Grover's Algorithm to AES: Quantum Resource Estimates

MPS-Authors
/persons/resource/persons201075

Grassl,  Markus
Quantumness, Tomography, Entanglement, and Codes, Leuchs Division, Max Planck Institute for the Science of Light, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R. (2016). Applying Grover's Algorithm to AES: Quantum Resource Estimates. In POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2016 (pp. 29-43). GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND: SPRINGER INT PUBLISHING AG.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002D-632A-D
Abstract
We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack. We consider the overall circuit size, the number of qubits, and the circuit depth as measures for the cost of the presented quantum algorithms. Throughout, we focus on Clifford+T gates as the underlying fault-tolerant logical quantum gate set. In particular, for all three variants of AES (key size 128, 192, and 256 bit) that are standardized in FIPS-PUB 197, we establish precise bounds for the number of qubits and the number of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.