Cryptology ePrint Archive: Report 2020/640

Grover on SPECK: Quantum Resource Estimates

Kyungbae Jang and Seungjoo Choi and Hyeokdong Kwon and Hwajeong Seo

Abstract: Grover search algorithm reduces the security level of symmetric key cryptography with $n$-bit secret key to $O(2^{n/2})$. In order to evaluate the Grover search algorithm, the target block cipher should be implemented in quantum circuits. Recently, many research works evaluated required quantum resources of AES block ciphers by optimizing the expensive substitute layer. However, only few works devoted to ARX-based lightweight block ciphers, which are active research area. In this paper, we present optimized implementations of SPECK 32/64 and SPECK 64/128 block ciphers for quantum computers. To the best of our knowledge, this is the first implementation of SPECK in quantum circuits. Primitive operations, including addition, rotation, and exclusive-or, for SPECK block cipher are finely optimized to achieve the optimal quantum circuit, in terms of qubits, Toffoli gate, CNOT gate, and X gate. The proposed method can be applied to other ARX-based lightweight block ciphers, such as LEA, HIGHT and CHAM block ciphers.

Category / Keywords: implementation / Quantum Gates, Grover's Algorithm, SPECK, Lightweight Block Cipher

Date: received 28 May 2020, last revised 28 May 2020

Contact author: hwajeong84 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20200603:094711 (All versions of this report)

Short URL: ia.cr/2020/640


[ Cryptology ePrint archive ]