Quantum circuit implementation and resource analysis of LBlock and LiCi
From MaRDI portal
Publication:6072528
Abstract: Due to Grover's algorithm, any exhaustive search attack of block ciphers can achieve a quadratic speed-up. To implement Grover,s exhaustive search and accurately estimate the required resources, one needs to implement the target ciphers as quantum circuits. Recently, there has been increasing interest in quantum circuits implementing lightweight ciphers. In this paper we present the quantum implementations and resource estimates of the lightweight ciphers LBlock and LiCi. We optimize the quantum circuit implementations in the number of gates, required qubits and the circuit depth, and simulate the quantum circuits on ProjectQ. Furthermore, based on the quantum implementations, we analyze the resources required for exhaustive key search attacks of LBlock and LiCi with Grover's algorithm. Finally, we compare the resources for implementing LBlock and LiCi with those of other lightweight ciphers.
Recommendations
- Implementing Grover oracle for lightweight block ciphers under depth constraints
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum resource estimation for FSR based symmetric ciphers and related Grover's attacks
- Quantum implementation and resource estimates for rectangle and knot
Cites work
- A note on quantum related-key attacks
- Applying Grover's algorithm to AES: quantum resource estimates
- Breaking symmetric cryptosystems using quantum period finding
- Evaluation of quantum cryptanalysis on SPECK
- Grover meets Simon -- quantumly attacking the FX-construction
- Grover on \(SIMON\)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Implementing Grover oracles for quantum key search on AES and LowMC
- LBlock: a lightweight block cipher
- Meet-in-the-middle attacks on 10-round AES-256
- On quantum related-key attacks on iterated Even-Mansour ciphers
- On the Power of Quantum Computation
- Quantum attacks against iterated block ciphers
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
- Quantum linearization attacks
- Quantum Walk Algorithm for Element Distinctness
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Using Bernstein-Vazirani algorithm to attack block ciphers
Cited in
(5)- Implementing Grover oracle for lightweight block ciphers under depth constraints
- Optimizing the depth of quantum implementations of linear layers
- 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
This page was built for publication: Quantum circuit implementation and resource analysis of LBlock and LiCi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072528)