Quantum circuit implementations of AES with fewer qubits

DOI10.1007/978-3-030-64834-3_24OpenAlexW3164160130MaRDI QIDQ2692402

Zihao Wei, Siwei Sun, Wenling Wu, Jian Zou, Ximeng Liu

Publication date: 21 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64834-3_24

zbMATH Keywords

circuit complexityquantum circuitS-boxAES\(\mathrm{S}\)-\(\mathrm{box}^{-1}\)

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (13)

Quantum security analysis of Rocca ⋮ Optimized quantum implementation of AES ⋮ Implementing Grover oracle for lightweight block ciphers under depth constraints ⋮ Optimizing the depth of quantum implementations of linear layers ⋮ Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits ⋮ Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations ⋮ Quantum resource estimation for FSR based symmetric ciphers and related Grover's attacks ⋮ Improved quantum analysis of SPECK and LowMC ⋮ Quantum circuit implementations of SM4 block cipher based on different gate sets ⋮ Further insights on constructing quantum circuits for Camellia block cipher ⋮ Quantum implementation and resource estimates for rectangle and knot ⋮ Some efficient quantum circuit implementations of Camellia ⋮ New quantum circuit implementations of SM4 and SM3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Quantum reversible circuit of AES-128
• Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
• Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
• Implementing Grover oracles for quantum key search on AES and LowMC
• Quantum collision attacks on AES-like hashing with low quantum random access memories
• Applying Grover’s Algorithm to AES: Quantum Resource Estimates
• A Very Compact S-Box for AES
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
• Topics in Cryptology – CT-RSA 2005

This page was built for publication: Quantum circuit implementations of AES with fewer qubits