Affiliation:
1. Division of IT Convergence Engineering, Hansung University, Seoul 02876, Republic of Korea
2. School of Computer Science and Engineering, Nanyang Technological University, Singapore 639798, Singapore
Abstract
A quantum computer capable of running the Grover search algorithm, which reduces the complexity of brute-force attacks by a square root, has the potential to undermine the security strength of symmetric-key cryptography and hash functions. Recently, studies on quantum approaches have proposed analyzing potential quantum attacks using the Grover search algorithm in conjunction with optimized quantum circuit implementations for symmetric-key cryptography and hash functions. Analyzing quantum attacks on a cipher (i.e., quantum cryptanalysis) and estimating the necessary quantum resources are related to evaluating post-quantum security for the target cryptography algorithms. In this paper, we revisit quantum implementations of CHAM block cipher, an ultra lightweight cipher, with a focus on optimizing the linear operations in its key schedule. We optimized the linear equations of CHAM as matrices by applying novel optimized decomposition techniques. Using the improved CHAM quantum circuits, we estimate the cost of Grover’s key search and evaluate the post-quantum security strength with further reduced costs.
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference35 articles.
1. Quantum supremacy using a programmable superconducting processor;Arute;Nature,2019
2. (2023). Suppressing quantum errors by scaling a surface code logical qubit. Nature, 614, 676–681.
3. Quantum computational advantage via 60-qubit 24-cycle random circuit sampling;Zhu;Sci. Bull.,2022
4. Quantum computational advantage with a programmable photonic processor;Madsen;Nature,2022
5. 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, Philadelphia, PA, USA.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献