Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
From MaRDI portal
Publication:6135451
DOI10.1007/978-3-031-22969-5_21zbMath1530.81035OpenAlexW4320082852MaRDI QIDQ6135451
Publication date: 25 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22969-5_21
Signal detection and filtering (aspects of stochastic processes) (60G35) Spectrum, resolvent (47A10) Applications of operator theory in systems, signals, circuits, and control theory (47N70) Other nonclassical models of computation (68Q09) Quantum gates (81P65) Quantum channels, fidelity (81P47)
Related Items (5)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On quantum slide attacks
- Quantum reversible circuit of AES-128
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- SAT-based {CNOT, \(T\)} quantum circuit synthesis
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- 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
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
- Quantum circuit implementations of AES with fewer qubits
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- Quantum linearization attacks
This page was built for publication: Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
