T-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction
From MaRDI portal
Publication:2104462
DOI10.1007/978-3-031-08896-4_20OpenAlexW4286758981MaRDI QIDQ2104462FDOQ2104462
Authors: Jongheon Lee, Sokjoon Lee, You-Seok Lee, Dooho Choi 
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08896-4_20
Recommendations
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
- Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
- Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
- Efficient circuits for exact-universal computation with qudits
- A quantum circuit for Shor's factoring algorithm using \(2n+2\) qubits
- On quantum \((\delta,\varepsilon)\)-resistant hashing
- Fundamentals of Computation Theory
- Shor's \(r\)-algorithms: theory and practice
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)
Cites Work
- Title not available (Why is that?)
- Templates for positive and negative control Toffoli networks
- A logarithmic-depth quantum carry-lookahead adder
- Upper bounds for reversible circuits based on Young subgroups
- Implementing Grover oracles for quantum key search on AES and LowMC
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Title not available (Why is that?)
- Hardware implementation analysis of SHA-256 and SHA-512 algorithms on FPGAs
Cited In (1)
This page was built for publication: \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104462)
