Browse > Article
http://dx.doi.org/10.13089/JKIISC.2021.31.3.323

Resource Eestimation of Grover Algorithm through Hash Function LSH Quantum Circuit Optimization  

Song, Gyeong-ju (Hansung University)
Jang, Kyung-bae (Hansung University)
Seo, Hwa-jeong (Hansung University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.31, no.3, 2021 , pp. 323-330 More about this Journal
Abstract
Recently, the advantages of high-speed arithmetic in quantum computers have been known, and interest in quantum circuits utilizing qubits has increased. The Grover algorithm is a quantum algorithm that can reduce n-bit security level symmetric key cryptography and hash functions to n/2-bit security level. Since the Grover algorithm work on quantum computers, the symmetric cryptographic technique and hash function to be applied must be implemented in a quantum circuit. This is the motivation for these studies, and recently, research on implementing symmetric cryptographic technique and hash functions in quantum circuits has been actively conducted. However, at present, in a situation where the number of qubits is limited, we are interested in implementing with the minimum number of qubits and aim for efficient implementation. In this paper, the domestic hash function LSH is efficiently implemented using qubits recycling and pre-computation. Also, major operations such as Mix and Final were efficiently implemented as quantum circuits using ProjectQ, a quantum programming tool provided by IBM, and the quantum resources required for this were evaluated.
Keywords
Grover algorithm; quantum cryptography; LSH hash function; quantum; quantum circuit;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Anand, Ravi, Arpita Maitra, and Sourav Mukhopadhyay. "Grover on $$\, SIMON\, $$ SIMON." Quantum Information Processing 19.9: 1-17, Seb. 2020.   DOI
2 Amy, Matthew, et al. "Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3." International Conference on Selected Areas in Cryptography. Springer, Cham, Aug. 2016.
3 Jaques. S, Naehrig. M, Roetteler. M, and Virdia. F, "Implementing Grover oracles for quantum key search on AES and LowMC." Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Cham, pp. 280-310, 2020.
4 Langenberg, Brandon, Hai Pham, and Rainer Steinwandt. "Reducing the cost of implementing the advanced encryption standard as a quantum circuit." IEEE Transactions on Quantum Engineering 1: 1-12, Feb. 2020
5 Diao, Zijian, Zubairy, M. Suhail and Chen, Goong. "A Quantum Circuit Design for Grover's Algorithm" Zeitschrift fur Naturforschung A, vol. 57, no. 8, 2002, pp. 701-708.   DOI
6 Maslov, Dmitri, et al. "Quantum circuit simplification and level compaction." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27.3 (2008): 436-444   DOI
7 Chen, Zhao-Yun, et al. "64-qubit quantum circuit simulation." Science Bulletin 63.15 (2018): 964-971.   DOI
8 Grover, L.K, "A fast quantum mechanical algorithm for database search." Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 212 219, July. 1996.
9 Grassl. M, Langenberg. B, Roetteler. M, and Steinwandt. R, "Applying Grover's algorithm to AES: quantum resource estimates. Post-Quantum Cryptography." Springer, pp. 29-43, Feb. 2016.
10 Korea Cryptography Forum, "High Speed Hash Function LSH", 2015 LSH Implementation Contest, Korea Cryptography Forum, 2015
11 K.B. Jang, S.J. Choi, H.D. Kwon, and H.J. Seo, "Grover on SPECK : Quantum Resource Estimates." ePrint Archive, Report 640(2020), 2020.
12 K.B. Jang, S.J. Choi, H.D. Kwon, H.J. Seo, H.J. Kim, J.H. Park, and H.J. Seo, "Grover on Korean Block Ciphers", Appl. Sci. 10.18: 6407. 2020.   DOI
13 Cuccaro, Steven A., et al. "A new quantum ripple-carry addition circuit." arXiv preprint quant-ph/0410184 (2004).
14 Kim DC., Hong D., Lee JK., Kim WH., and Kwon D. (2015) LSH: A New Fast Secure Hash Function Family. In: Lee J., Kim J. (eds) Information Security and Cryptology - ICISC 2014. ICISC 2014.