journal article·2023-03-10Open access

Improved Low-Depth SHA3 Quantum Circuit for Fault-Tolerant Quantum Computers

Gyeongju Song, Kyungbae Jang, Hwajeong Seo

Applied Sciences· Volume 13· Issue 6

Abstract

To build a secure cryptography system in the post-quantum era, one must find the minimum security parameters against quantum attacks by estimating the quantum resources of a fault-tolerant quantum computer. In a fault-tolerant quantum computer, errors must reach an acceptable level for practical uses according to error detection and error correction processes. However, these processes utilize additional quantum resources. As the depth of the quantum circuit increases, the computation time per qubit increases together with the processing errors. Therefore, in terms of errors in quantum circuits, it is a fundamental requirement to reduce the depth by trading off the number of qubits. This paper proposes novel low-depth SHA3 quantum circuit implementations for fault-tolerant quantum computers to reduce errors. The proposed SHA3 quantum circuit was implemented with the aim of optimizing the quantum circuit depth through a trade-off between the number of qubits, the quantum gate, and the quantum depth in each function. Compared to other state-of-art techniques, the proposed method achieved T-depth and full-depth reductions of 30.3% and 80.05%, respectively. We believe that this work will contribute to the establishment of minimum security parameters for SHA3 in the quantum era.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Quantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Division of IT Convergence Engineering, Hansung University, Seoul 02876, Republic of Korea

Funding

Hansung University

References (34)

Show source-provided references
1. Grover, L.K. (1996, January 22–24). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, New York, NY, USA.10.1145/237814.237866 ↗
2. Shor, P.W. (1994, January 20–22). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA.
3. Aharonov, D., and Ben-Or, M. (1997, January 4–6). Fault-tolerant quantum computation with constant error. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, TX, USA.10.1145/258533.258579 ↗
4. Shor, P.W. (1996, January 14–16). Fault-tolerant quantum computation. Proceedings of the 37th Conference on Foundations of Computer Science, Burlington, VT, USA.
5. Efficient fault-tolerant quantum computing10.1038/20127 ↗
6. Extending the lifetime of a quantum bit with error correction in superconducting circuits10.1038/nature18949 ↗
7. Quantum computing in the NISQ era and beyond10.22331/q-2018-08-06-79 ↗
8. Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., and Schanck, J. (2016, January 10–12). Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. Proceedings of the Selected Areas in Cryptography–SAC 2016: 23rd International Conference, St. John’s, NL, Canada. Revised Selected Papers.10.1007/978-3-319-69453-5_18 ↗
9. Applying Grover’s Algorithm to Hash Functions: A Software Perspective10.1109/TQE.2022.3233526 ↗
10. Quantum computing: An introduction10.1049/cce:19990303 ↗
11. Grassl, M., Langenberg, B., Roetteler, M., and Steinwandt, R. (2016, January 24–26). Applying Grover’s algorithm to AES: Quantum resource estimates. Proceedings of the Post-Quantum Cryptography: 7th International Workshop, PQCrypto 2016, Fukuoka, Japan.10.1007/978-3-319-29360-8_3 ↗
12. Huang, Z., and Sun, S. (2022, January 5–9). Synthesizing Quantum Circuits of AES with Lower T-depth and Less Qubits. Proceedings of the Advances in Cryptology—ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan. Proceedings, Part III.10.1007/978-3-031-22969-5_21 ↗
13. Jang, K., Baksi, A., Kim, H., Song, G., Seo, H., and Chattopadhyay, A. (2022). Quantum analysis of AES. Cryptol. Eprint Arch., 2022/683.
14. Song, G., Jang, K., Kim, H., and Seo, H. (2022). A Parallel Quantum Circuit Implementations of LSH Hash Function for Use with Grover’s Algorithm. Appl. Sci., 12.10.3390/app122110891 ↗
15. Song, G., Jang, K., Kim, H., Lee, W.K., Hu, Z., and Seo, H. (2021, January 1–3). Grover on SM3. Proceedings of the Information Security and Cryptology—ICISC 2021: 24th International Conference, Seoul, Republic of Korea. Revised Selected Papers.10.1007/978-3-031-08896-4_22 ↗
16. New quantum circuit implementations of SM4 and SM310.1007/s11128-022-03518-5 ↗
17. Song, G., Jang, K., Kim, H., Eum, S., Sim, M., Kim, H., Lee, W.K., and Seo, H. (2022). SPEEDY Quantum Circuit for Grover’s Algorithm. Appl. Sci., 12.10.3390/app12146870 ↗
18. Jang, K., Choi, S., Kwon, H., and Seo, H. (2020). Grover on SPECK: Quantum resource estimates. Cryptol. Eprint Arch., 2020/640.
19. Quantum reversible circuit of AES-12810.1007/s11128-018-1864-3 ↗
20. Jang, K., Song, G., Kim, H., Kwon, H., Kim, H., and Seo, H. (2021). Efficient implementation of PRESENT and GIFT on quantum computers. Appl. Sci., 11.10.3390/app11114776 ↗
21. Quantum implementation and resource estimates for rectangle and knot10.1007/s11128-021-03307-6 ↗
23. Jang, K., Baksi, A., Breier, J., Seo, H., and Chattopadhyay, A. (2022). Quantum implementation and analysis of Default. Cryptol. Eprint Arch., 2022/647.
24. Chauhan, A.K., and Sanadhya, S.K. (2020, January 17–21). Quantum resource estimates of grover’s key search on aria. Proceedings of the Security, Privacy, and Applied Cryptography Engineering: 10th International Conference, SPACE 2020, Kolkata, India.10.1007/978-3-030-66626-2_13 ↗
25. Jang, K., Song, G., Kwon, H., Uhm, S., Kim, H., Lee, W.K., and Seo, H. (2021). Grover on PIPO. Electronics, 10.10.3390/electronics10101194 ↗
26. Grover on KATAN: Quantum resource estimation10.1109/TQE.2022.3140376 ↗
27. Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning10.1109/TCAD.2014.2341953 ↗
28. Requirements for fault-tolerant factoring on an atom-optics quantum computer10.1038/ncomms3524 ↗
29. Dworkin, M.J. (2015). SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions, National Institute of Standards and Technology.10.6028/NIST.FIPS.202 ↗
30. Dang, Q.H. (2015). Secure Hash Standard, National Institute of Standards and Technology.10.6028/NIST.FIPS.180-4 ↗
31. Penard, W., and van Werkhoven, T. (2008). On the secure hash algorithm family. Cryptogr. Context, 1–18.
32. Jang, K., Choi, S., Kwon, H., Kim, H., Park, J., and Seo, H. (2020). Grover on Korean block ciphers. Appl. Sci., 10.10.3390/app10186407 ↗
33. Parallel quantum addition for Korean block ciphers10.1007/s11128-022-03714-3 ↗
34. Resource Eestimation of Grover Algorithm through Hash Function LSH Quantum Circuit Optimization