1. Grover on Korean Block Ciphers.
- Author
-
Jang, Kyoungbae, Choi, Seungju, Kwon, Hyeokdong, Kim, Hyunji, Park, Jaehoon, and Seo, Hwajeong
- Subjects
BLOCK ciphers ,QUANTUM computers ,SEARCH algorithms - Abstract
The Grover search algorithm reduces the security level of symmetric key cryptography with n-bit security level to O (2 n / 2) . In order to evaluate the Grover search algorithm, the target block cipher should be efficiently implemented in quantum circuits. Recently, many research works evaluated required quantum resources of AES block ciphers by optimizing the expensive substitute layer. However, few works were devoted to the lightweight block ciphers, even though it is an active research area, nowadays. In this paper, we present optimized implementations of every Korean made lightweight block ciphers for quantum computers, which include HIGHT, CHAM, and LEA, and NSA made lightweight block ciphers, namely SPECK. Primitive operations for block ciphers, including addition, rotation, and exclusive-or, are finely optimized to achieve the optimal quantum circuit, in terms of qubits, Toffoli gate, CNOT gate, and X gate. To the best of our knowledge, this is the first implementation of ARX-based Korean lightweight block ciphers in quantum circuits. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF