\(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction

DOI10.1007/978-3-031-08896-4_20OpenAlexW4286758981MaRDI QIDQ2104462

Sokjoon Lee, You-Seok Lee, Dooho Choi, Jongheon Lee

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08896-4_20

zbMATH Keywords

quantum circuit\(T\)-depth\textit{SHA}-256\textit{Toffoli-gate}

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

Related Items (1)

MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Implementing Grover oracles for quantum key search on AES and LowMC
• Upper bounds for reversible circuits based on Young subgroups
• Hardware implementation analysis of SHA-256 and SHA-512 algorithms on FPGAs
• Templates for Positive and Negative Control Toffoli Networks

This page was built for publication: \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction