한국정보통신학회논문지 (Journal of the Korea Institute of Information and Communication Engineering)

  • 제24권8호
  • /
  • Pages.1044-1051
  • /
  • 2020
  • /
  • 2234-4772(pISSN)
  • /
  • 2288-4165(eISSN)
한국정보통신학회 (The Korea Institute of Information and Commucation Engineering)
권호 표지
DOI QR코드

DOI QR Code

부호 기반 양자 내성 암호의 이진 필드 상에서 곱셈 연산 양자 게이트 구현

Implementation of Quantum Gates for Binary Field Multiplication of Code based Post Quantum Cryptography

  • Choi, Seung-Joo (Department of IT Fusion Engineering, Hansung University) ;
  • Jang, Kyong-Bae (Department of IT Fusion Engineering, Hansung University) ;
  • Kwon, Hyuk-Dong (Department of IT Fusion Engineering, Hansung University) ;
  • Seo, Hwa-Jeong (Department of IT Fusion Engineering, Hansung University)
  • 투고 : 2020.04.02
  • 심사 : 2020.05.20
  • 발행 : 2020.08.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

양자 컴퓨터의 시대가 점점 현실로 다가오고 있다. 이에 대비해 미국 국립 표준 기술 연구소에서는 양자 알고리즘으로부터 내성이 있는 양자 내성 암호의 표준을 정하기 위해 후보군을 모집했다. 제출된 암호들은 양자 알고리즘으로부터 안전할 것으로 예상이 되지만 알고리즘이 실제 양자 컴퓨터상에서 작동이 되었을 때에도 양자 알고리즘의 공격으로부터 안전한지 검증을 할 필요가 있다. 이에 본 논문에서는 부호 기반 양자 내성 암호의 이진 필드 상에서의 곱셈 연산을 양자 컴퓨터에서 작동될 수 있게 양자 회로로 구현하였고 해당 회로를 최적화 하는 방안에 대하여 설명한다. 구현은 대표적인 부호 기반 암호인 Classic McEliece에서 제시하는 2개의 필드 다항식과 ROLLO에서 제시하는 3개의 필드 다항식에 대하여 일반 곱셈 알고리즘과 카라추바 곱셈 알고리즘으로 구현하였다.

The age of quantum computers is coming soon. In order to prepare for the upcoming future, the National Institute of Standards and Technology has recruited candidates to set standards for post quantum cryptography to establish a future cryptography standard. The submitted ciphers are expected to be safe from quantum algorithm attacks, but it is necessary to verify that the submitted algorithm is safe from quantum attacks using quantum algorithm even when it is actually operated on a quantum computer. Therefore, in this paper, we investigate an efficient quantum gate implementation for binary field multiplication of code based post quantum cryptography to work on quantum computers. We implemented the binary field multiplication for two field polynomials presented by Classic McEliece and three field polynomials presented by ROLLO in generic algorithm and Karatsuba algorithm.

키워드

참고문헌

  1. R. Feynman, "Simulating Physics with Computers," International Journal of Theoretical Physics, 21, 467, 1982. https://doi.org/10.1007/BF02650179
  2. Join Extra Crunch. IBM unveils its first commercial quantum computer [Internet]. Available: https://techcrunch.com/2019/01/08/ibm-unveils-its-first-commercial-quantum-computer/.
  3. A. G. Aruna, K. H. Vani, C. Sathya, and R. Sowndarya Meena, "A Study on Reversible Logic Gates of Quantum Computing," International Journal of Computer Science and Information Technologies, vol. 7, no. 1, pp. 427-432. 2016.
  4. D. Cheung, D. Maslov, J. Mathew, and D. K. Pradhan, "On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography," In Workshop on Quantum Computation, Communication, and Cryptography, pp. 96-104, 2008.
  5. S. Kepley, and R. Steinwandt, "Quantum circuits for multiplication with subquadratic gate count," Quantum Information Processing, vol. 14, no. 7, pp. 2373-2386, 2015. https://doi.org/10.1007/s11128-015-0993-1
  6. D. S. Steiger, T. Haner, and M. Troyer, "ProjectQ: An Open Source Software Framework for Quantum Computing. Quantum," ResearchGate, 2. 10.22331/q-2018-01-31-49, 2016.
  7. D. J. Bernstein, T. Chou, T. Lange, I. V. Maurich, R. Misoczki, R. Niederhagen, and J. Szefer, "Classic McEliece: conservative code-based cryptography," NIST submissions, 2017.
  8. C. A. Melchor, N. Aragon, and M. Bardet, "ROLLO: Rank-Ouroboros, Lake & Locker," NIST submissions, 2019.
  9. I. V. Hoof, "Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count," arXiv preprint arXiv:1910.02849, 2019.
  10. V. Shende, and I. L. Markov, "On the CNOT-cost of TOFFOLI gates," Quantum Information and Computation, 2008.