Synthesizing quantum circuits of AES with lower T-depth and less qubits
From MaRDI portal
Publication:6135451
Recommendations
- Optimized quantum implementation of AES
- Quantum circuit implementations of AES with fewer qubits
- Optimizing the depth of quantum implementations of linear layers
- Applying Grover's algorithm to AES: quantum resource estimates
- Improvements to quantum search techniques for block-ciphers, with applications to AES
Cites work
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Applying Grover's algorithm to AES: quantum resource estimates
- Breaking symmetric cryptosystems using quantum period finding
- Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Implementing Grover oracles for quantum key search on AES and LowMC
- On quantum slide attacks
- Optimal merging in quantum k-xor and k-sum algorithms
- Optimal synthesis of linear reversible circuits
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Quantum circuit implementations of AES with fewer qubits
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Quantum linearization attacks
- Quantum reversible circuit of AES-128
- SAT-based {CNOT, \(T\)} quantum circuit synthesis
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT
Cited in
(17)- Quantum reversible circuit of AES-128
- \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction
- Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
- Optimized quantum implementation of AES
- Optimizing the depth of quantum implementations of linear layers
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- 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
- Depth-measurement trade-off for quantum search on block ciphers
- Toffoli-depth reduction method preserving in-place quantum circuits and its application to SHA3-256
- Improved quantum circuits for AES: reducing the depth and the number of qubits
- On the construction of quantum circuits for S-boxes with different criteria based on the SAT solver
- Constructing quantum implementations with the minimal T-depth or minimal width and their applications
- New quantum attacks on some Feistel variants
- Quantum circuits of AES with a low-depth linear layer and a new structure
- Quantum IND-CPA security notions for AEAD
This page was built for publication: Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135451)
