Shivanshu Siyanwal

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 Quantum cryptography / Grover / Qiskit

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

  1. 01

    Problem

    Understanding how symmetric ciphers degrade under quantum attack requires explicit, runnable circuit constructions, not just asymptotic arguments.

  2. 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.

  3. 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.

  4. 04

    Status

    Manuscript in preparation.

Schematic

How it works

key register |k⟩|0⟩|0⟩|0⟩Hrepeat ~√N timesoracleEnc_k(P) = C ?diffusionamplifykeyinside the oracleencrypt P with kGalois-field S-boxcompare with Cphase flip if equaluncomputeencryptionuniform startafter amplification
Schematic. Grover key search on the scaled-down cipher: the key register starts in uniform superposition (H); the oracle encrypts the known plaintext P under each candidate key k with the cipher circuit (including its Galois-field S-box), marks the key whose output equals the known ciphertext C, and uncomputes; diffusion amplifies the marked key, and after about √N rounds a measurement returns it. The bars are illustrative, not data.

Contribution

My role

Research intern — circuit design and attack demonstration.

  1. Mini-AES circuitsMe (my part)
  2. Galois-field S-box arithmeticMe (my part)
  3. Runs on IBM QuantumMe (my part)
  4. Grover key searchMe (my part)
My partCollaborators

More threads