SPEEDY Quantum Circuit for Grover’s Algorithm

• Published in: Applied sciences Vol. 12; no. 14; p. 6870
• Main Authors: Song, Gyeongju, Jang, Kyoungbae, Kim, Hyunjun, Eum, Siwoo, Sim, Minjoo, Kim, Hyunji, Lee, Waikong, Seo, Hwajeong
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01-07-2022
• Subjects: Algorithms; Circuits; Computers; Cryptography; Grover’s algorithm; post-quantum; Quantum computers; Quantum computing; Security; SPEEDY block cipher
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app12146870

In this paper, we propose a quantum circuit for the SPEEDY block cipher for the first time and estimate its security strength based on the post-quantum security strength presented by NIST. The strength of post-quantum security for symmetric key cryptography is estimated at the cost of the Grover key retrieval algorithm. Grover’s algorithm in quantum computers reduces the n-bit security of block ciphers to n2 bits. The implementation of a quantum circuit is required to estimate the Grover’s algorithm cost for the target cipher. We estimate the quantum resource required for Grover’s algorithm by implementing a quantum circuit for SPEEDY in an optimized way and show that SPEEDY provides either 128-bit security (i.e., NIST security level 1) or 192-bit security (i.e., NIST security level 3) depending on the number of rounds. Based on our estimated cost, increasing the number of rounds is insufficient to satisfy the security against quantum attacks on quantum computers.