Implementing Grover oracles for quantum key search on AES and LowMC
From MaRDI portal
Publication:2119015
DOI10.1007/978-3-030-45724-2_10zbMath1492.81042arXiv1910.01700OpenAlexW3032199016MaRDI QIDQ2119015
Martin Roetteler, Michael Naehrig, Samuel Jaques, Fernando Virdia
Publication date: 23 March 2022
Full work available at URL: https://arxiv.org/abs/1910.01700
Searching and sorting (68P10) Cryptography (94A60) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Other applications of nonstandard models (economics, physics, etc.) (03H10)
Related Items (37)
SoK: how (not) to design and implement post-quantum cryptography ⋮ The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3 ⋮ Low-gate quantum golden collision finding ⋮ Improvements to quantum search techniques for block-ciphers, with applications to AES ⋮ On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer ⋮ A note on quantum collision resistance of double-block-length compression functions ⋮ Evaluation of quantum cryptanalysis on SPECK ⋮ Quantum security analysis of Rocca ⋮ Improving the implementation of quantum blockchain based on hypergraphs ⋮ Quantum circuit implementation and resource analysis of LBlock and LiCi ⋮ Optimized quantum implementation of AES ⋮ Grover on \(SIMON\) ⋮ Implementing Grover oracle for lightweight block ciphers under depth constraints ⋮ Hybrid decoding -- classical-quantum trade-offs for information set decoding ⋮ Quantum algorithms for the Goldreich-Levin learning problem ⋮ Optimizing the depth of quantum implementations of linear layers ⋮ Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits ⋮ 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 search for scaled hash function preimages ⋮ Implementation of efficient quantum search algorithms on NISQ computers ⋮ New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions ⋮ Quantum circuit implementations of AES with fewer qubits ⋮ Quantum collision attacks on AES-like hashing with low quantum random access memories ⋮ Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli} ⋮ Evaluation of Grover's algorithm toward quantum cryptanalysis on ChaCha ⋮ Quantum implementation and resource estimates for rectangle and knot ⋮ A new post-quantum voting protocol based on physical laws ⋮ Quantum zero correlation linear cryptanalysis ⋮ Parallel quantum addition for Korean block ciphers ⋮ \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction ⋮ Grover on SM3 ⋮ Some efficient quantum circuit implementations of Camellia ⋮ Quantum partial search algorithm with smaller oracles for multiple target items ⋮ New quantum circuit implementations of SM4 and SM3
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of Rijndael. The Advanced Encryption Standard (AES)
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Quantum reversible circuit of AES-128
- Highly efficient \(\mathrm{GF}(2^8)\) inversion circuit based on redundant GF arithmetic and its application to AES design
- Low-communication parallel quantum multi-target preimage search
- Small low-depth circuits for cryptographic applications
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
- Linear equivalence of block ciphers with partial non-linear layers: application to LowMC
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Ciphers for MPC and FHE
- Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Bit-Sliding: A Generic Technique for Bit-Serial Implementations of SPN-based Primitives
- New Low-Area Designs for the AES Forward, Inverse and Combined S-Boxes
- Efficient distributed quantum computing
This page was built for publication: Implementing Grover oracles for quantum key search on AES and LowMC
