Width 효율적 ASCON 양자 회로를 이용한 Grover 기반 양자 보안비도 분석
Grover-Based Quantum Security Analysis Using width Efficient Quantum Circuit of ASCON
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
양자컴퓨팅의 발전에 따른 기존 암호화 시스템의 양자컴퓨터 상에서의 보안성 분석, 즉 양자보안성 분석의 필요성이 증가하고 있다. 본 논문에서는 Grover 키 탐색 알고리즘을 기반으로 NIST 경량 암호 ASCON의 보안비도 분석을 진행한다. 특히, Clifford+T 게이트 조합으로 ASCON-128의 양자 회로를 구현하는 동시에 보조 큐비트 값 초기화 문제를 해결하는 새로운 양자 회로 구현물을 제시한다. Grover 키 탐색 알고리즘 기반 보안비도 분석에 적합하도록 ASCON의 암호화 구조를 간략화하고 자원량을 측정한 결과 보조 큐비트 초기화 회로를 추가하였음에도 불구하고, 시-공간 복잡도와 관련된 비용인 과 에서 각각 , 감소를 보였다.
Abstract
This paper discusses the need to reevaluate the security of existing cryptographic systems due to the advancement of quantum computing, and analyzes the security level of the NIST lightweight cipher ASCON based on the Grover key search algorithm. In particular, we present a novel quantum circuit implementation of ASCON-128 with a consist of clifford+T gates, which solves the problem of initializing the auxiliary qubit value. We simplified ASCON's cryptographic structure and measured the resource consumption to analyze the security level based on Grover's key discovery algorithm, and found that the cost associated with the space-time complexity, Td-M and Fd-M, was reduced by 85.65% and 83.73%, respectively, despite solving the secondary qubit initialization problem.
참고문헌 (16)
- M. Njorbuenwu, "A survey on the impacts of quantum computers on information security", 2019 2nd International conference on data intelligence and security (ICDIS), pp.212~218 (2019), IEEE
- L.K. Grover, "A fast quantum mechanical algorithm for database search", Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp.212~219 (1996)
- Y. Zheng, "Quantum circuit implementations of lightweight authenticated encryption ASCON", The Journal of Supercomputing, pp.1~16 (2024)
- Yujin Oh, "Depth-Optimized Quantum Circuits for ASCON: AEAD and HASH", Mathematics, 12(9), pp.1337~ (2024)
- Kyungbae Jang, "Quantum analysis of AES", Cryptology ePrint 2022-683, ~ (2022)
- V. Vedral, "Basics of quantum computation", Progress in quantum electronics, 22(1), pp.1~39 (1998)
- W.K. Wootters, "A single quantum cannot be cloned", Nature, 299(5886), pp.802~803 (1982)
- V. Bužek, "Quantum copying: Beyond the no-cloning theorem", Physical Review A, 54(3), pp.1844~ (1996)
- C. Dobraunig, "Ascon v1. 2: Lightweight authenticated encryption and hashing", Journal of Cryptology, 34, pp.1~42 (2021)
- R. Ankele, "Software benchmarking of the 2nd round caesar candidates", IACR ePrint 2016-740, ~ (2016)
- D.M Michael, "A transformation based algorithm for reversible logic synthesis", Proceedings of the 40th annual Design Automation Conference, pp.318~323 (2003)
- N. Abdessaied, "Reducing the depth of quantum circuits using additional circuit lines", Reversible Computation: 5th International Conference, pp.221~233 (2013), Springer Berlin Heidelberg
- M. Amy, "A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(6), pp.818~830 (2013)
- Jongheon Lee, "MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits", Quantum Information Processing, 22(10), pp.381~ (2023)
- S. Roy, "Quantum implementation of ascon linear layer", Cryptology ePrint 2023-617, ~ (2023)
- "Submission requirements and evaluation criteria for the post-quantum cryptography standardization process", NIST, CFP, ~ (2016)