Efficient Implementation of PRESENT and GIFT on Quantum Computers

Grover search algorithm is the most representative quantum attack method that threatens the security of symmetric key cryptography. If the Grover search algorithm is applied to symmetric key cryptography, the security level of target symmetric key cryptography can be lowered from n-bit to n2-bit. When applying Grover’s search algorithm to the block cipher that is the target of potential quantum attacks, the target block cipher must be implemented as quantum circuits. Starting with the AES block cipher, a number of works have been conducted to optimize and implement target block ciphers into quantum circuits. Recently, many studies have been published to implement lightweight block ciphers as quantum circuits. In this paper, we present optimal quantum circuit designs of symmetric key cryptography, including PRESENT and GIFT block ciphers. The proposed method optimized PRESENT and GIFT block ciphers by minimizing qubits, quantum gates, and circuit depth. We compare proposed PRESENT and GIFT quantum circuits with other results of lightweight block cipher implementations in quantum circuits. Finally, quantum resources of PRESENT and GIFT block ciphers required for the oracle of the Grover search algorithm were estimated.

Download Full-text

Grover on Korean Block Ciphers

Applied Sciences ◽

10.3390/app10186407 ◽

2020 ◽

Vol 10 (18) ◽

pp. 6407

Author(s):

Kyoungbae Jang ◽

Seungju Choi ◽

Hyeokdong Kwon ◽

Hyunji Kim ◽

Jaehoon Park ◽

...

Keyword(s):

Search Algorithm ◽

Quantum Circuit ◽

Block Ciphers ◽

Research Area ◽

Quantum Circuits ◽

Security Level ◽

Toffoli Gate ◽

Grover Search ◽

Target Block ◽

Grover Search Algorithm

The Grover search algorithm reduces the security level of symmetric key cryptography with n-bit security level to O(2n/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.

Download Full-text

Grover on PIPO

Electronics ◽

10.3390/electronics10101194 ◽

2021 ◽

Vol 10 (10) ◽

pp. 1194

Author(s):

Kyungbae Jang ◽

Gyeongju Song ◽

Hyeokdong Kwon ◽

Siwoo Uhm ◽

Hyunji Kim ◽

...

Keyword(s):

Block Cipher ◽

Search Algorithm ◽

Quantum Algorithms ◽

Optimization Techniques ◽

Quantum Circuits ◽

Brute Force ◽

Grover Search ◽

Quantum Simulator ◽

Compact Design ◽

Grover Search Algorithm

The emergence of quantum computers is threatening the security of cryptography through various quantum algorithms. Among them, the Grover search algorithm is known to be efficient in accelerating brute force attacks on block cipher algorithms. To utilize the Grover’s algorithm for brute force attacks, block ciphers must be implemented in quantum circuits. In this paper, we present optimized quantum circuits of the SPN (Substitution Permutation Network) structured lightweight block cipher, namely the PIPO block cipher. In particular, the compact design of quantum circuits for the 8-bit Sbox is investigated. These optimization techniques are used to implement other cryptographic operations as quantum circuits. Finally, we evaluate quantum resources of Grover search algorithm for the PIPO block cipher in ProejctQ, a quantum simulator provided by IBM.

Download Full-text

Entanglement in the Grover search algorithm

Physics Letters A ◽

10.1016/j.physleta.2005.07.017 ◽

2005 ◽

Vol 345 (4-6) ◽

pp. 265-272 ◽

Cited By ~ 16

Author(s):

Yiyuan Fang ◽

Dagomir Kaszlikowski ◽

Chunming Chin ◽

Ken Tay ◽

L.C. Kwek ◽

...

Keyword(s):

Search Algorithm ◽

Grover Search ◽

Grover Search Algorithm

Download Full-text

Symmetric-Key Cryptography: Block Ciphers

Understanding and Applying Cryptography and Data Security ◽

10.1201/9781420061611-11 ◽

2009 ◽

pp. 111-222

Keyword(s):

Block Ciphers ◽

Symmetric Key ◽

Symmetric Key Cryptography

Download Full-text

Comparison of a Chaotic Cryptosystem with Other Cryptography Systems

Engineering, Technology & Applied Science Research ◽

10.48084/etasr.3745 ◽

2020 ◽

Vol 10 (5) ◽

pp. 6187-6190

Author(s):

A. S. Alshammari

Keyword(s):

Stream Cipher ◽

Security Level ◽

Brute Force ◽

Randomness Test ◽

Symmetric Key ◽

The One ◽

Symmetric Key Cryptography ◽

High Degree

The keyspace of a cryptography system must be long enough in order to protect it from brute force attacks. The One-Time Pad (OTP) encryption is unconditionally secure because of its truly random keystream that is used only once. This paper proposes a new chaotic symmetric cryptosystem approach, comparable to OTP. The proposed system utilizes two Lorenz generators, a main and an auxiliary, where the aim of the second one is to make one of the main Lorenz generator’s parameters to vary continually with time in a chaotic manner. This technique was built on digitizing two Lorenz chaotic models to increase the security level. The scrambling scheme was developed and the Lorenz stream cipher binary stream successfully passed the NIST randomness test. The cryptosystem showed a high degree of security, as it had a keyspace of 2576, and it was compared with existing symmetric key cryptography systems, such as DES, 3DES, AES, Blowfish, and OTP.

Download Full-text

Provably Quantum-Secure Tweakable Block Ciphers

IACR Transactions on Symmetric Cryptology ◽

10.46586/tosc.v2021.i1.337-377 ◽

2021 ◽

pp. 337-377

Author(s):

Akinori Hosoyamada ◽

Tetsu Iwata

Keyword(s):

Polynomial Time ◽

Provable Security ◽

Block Cipher ◽

Block Ciphers ◽

Quantum Superposition ◽

Quantum Cryptanalysis ◽

Classical Setting ◽

Time Quantum ◽

Symmetric Key ◽

Arbitrary Quantum

Recent results on quantum cryptanalysis show that some symmetric key schemes can be broken in polynomial time even if they are proven to be secure in the classical setting. Liskov, Rivest, and Wagner showed that secure tweakable block ciphers can be constructed from secure block ciphers in the classical setting. However, Kaplan et al. showed that their scheme can be broken by polynomial time quantum superposition attacks, even if underlying block ciphers are quantum-secure. Since then, it remains open if there exists a mode of block ciphers to build quantum-secure tweakable block ciphers. This paper settles the problem in the reduction-based provable security paradigm. We show the first design of quantum-secure tweakable block ciphers based on quantum-secure block ciphers, and present a provable security bound. Our construction is simple, and when instantiated with a quantum-secure n-bit block cipher, it is secure against attacks that query arbitrary quantum superpositions of plaintexts and tweaks up to O(2n/6) quantum queries. Our security proofs use the compressed oracle technique introduced by Zhandry. More precisely, we use an alternative formalization of the technique introduced by Hosoyamada and Iwata.

Download Full-text

Color Image Encryption using AES and RSA

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.e9648.069520 ◽

2020 ◽

Vol 9 (5) ◽

pp. 547-550

Keyword(s):

Data Security ◽

Block Cipher ◽

Color Image ◽

Signal To Noise Ratio ◽

Security Level ◽

Change Rate ◽

The Public ◽

Key Block ◽

Symmetric Key ◽

Encryption Algorithms

Information security is an important task on multimedia and communication world. During storing and sharing maintaining a strategic distance from the outsider access of information is the difficult one. There are many encryption algorithms that can provide data security. In this paper two of the encryption algorithms namely AES and RSA are implemented for color images. AES (Advanced Encryption Standard) is a symmetric key block cipher published in December 2001 by NSIT (National Institute of Standards and Technology). RSA (Rivest-Shamir-Adleman) is an asymmetric key block cipher. It uses two separate keys, one for encryption called the public key and other for decryption called the private key. Both the implementation and analysis are done in Matlab. The quality and security level of both the algorithms is analysed based on various criteria such as Histogram analysis, Correlation analysis, Entropy analysis, NPCR (Number of Pixel Change Rate), UACI (Unified Average Changing Intensity), PSNR (Peak Signal-to-Noise Ratio).

Download Full-text