Quantum cryptography
Quantum Circuits for Block Ciphers
Mini-AES / S-AES circuits with a Grover-based plaintext–ciphertext attack demonstration.
Manuscript in preparation · Aug 2023 – Mar 2024
Interactive abstract
Play with the idea
This interactive diagram needs JavaScript. The schematic and write-up below explain the same idea.
Layman view
In plain words
Draft — to be verified. Written in plain language from the paper and project notes on this site.
Ciphers such as AES scramble data with a secret key. Grover's quantum search could find that key in roughly the square root of the number of guesses a classical brute-force search needs, which is why key lengths matter for a quantum future.
To make this concrete, this project built the full quantum circuit for a miniature 8-bit version of AES, including the finite-field arithmetic inside its S-box, and ran it with Qiskit and on IBM Quantum hardware.
It then used Grover search to recover the key from a known plaintext and ciphertext pair on the scaled-down cipher: a hands-on demonstration of the square-root speed-up.
Expert view
The work, step by step
-
01
Problem
Understanding how symmetric ciphers degrade under quantum attack requires explicit, runnable circuit constructions, not just asymptotic arguments.
-
02
Approach
I built quantum circuits for an 8-bit AES (Mini-AES / S-AES), including the Galois-field arithmetic the S-box depends on, and ran them on Qiskit and IBM Quantum hardware.
-
03
Attack
I implemented a plaintext–ciphertext attack with Grover search and amplitude amplification, demonstrating Grover key search on a scaled-down cipher, which needs O(√N) oracle queries versus O(N) classically.
-
04
Status
Manuscript in preparation.
Schematic
How it works
Contribution
My role
Research intern — circuit design and attack demonstration.
- Mini-AES circuitsMe (my part)
- Galois-field S-box arithmeticMe (my part)
- Runs on IBM QuantumMe (my part)
- Grover key searchMe (my part)
Publication