National Radio Science Conference

A Symmetric Key Dynamic Gates Encryption Algorithm Based on Quantum Computing

Karim H. Moussa, Mohamed Abd-Elbaset, Yasmine Abouelseoud, Hassan M. Elkamchochi

Published Jul 27, 2021• 3 citations

Abstract

Quantum cryptography utilizes the quantum properties of photons to construct an unbreakable crypto-algorithm in real-time. In this paper, based on quantum and classical computation principles, a new quantum encryption algorithm using the symmetric key is presented. It is a block-cipher algorithm which means that each message contains blocks in which 4 bits for each. Firstly, keyed rotations and permutation of the message bits are used. Secondly, the encrypted message is converted to qubits then several dynamic quantum gates are applied to them key dependently to make the ciphertext state reach the state of non-orthogonality. In consequence of the principles of quantum mechanics, the eaves cannot distinguish the non-orthogonal states of the encrypted message. The proposed algorithm is proofed to increase the message space, the various algorithm analysis proofed that our proposed algorithm has an improved strength against various attacks, including the brute force attack.

DOI: 10.1109/nrsc52299.2021.9509818

Related papers

A New 16 Bit Symmetric Key Quantum Encryption Algorithm Based On Dynamic Pauli Gates

Karim H. Moussa, Mohamed Abd-Elbaset, Yasmine Abouelseoud +1 more

Quantum cryptography appropriates the features of photons to create a secured algorithm in real-time. In this study, a new algorithm is illustrated using the symmetric key based on the basics of quantum and classical computation. In this algorithm, the message contains blocks, the space of each block is 16 bits. First, the classical encryption process depends on the key that makes rotation and permutation in the bits of block message. Second, the bits of encrypted block messages are converted to qubits. Third, Pauli gates are used, and applies the output of the second stage to them depends on a key to achieving the non-orthogonality of ciphertext states. Because of the basis of quantum computing, the eavesdroppers cannot detect the encrypted message states that changed to non-orthogonal states. The proposed algorithm is proven to increase the message space, the various algorithm analysis proofed that our proposed algorithm has an improved strength against various attacks, including the brute force attack.

International Telecommunications Conference (ITC-Egypt)Jul 13, 20216 citations

A 32-bit Quantum Encryption Algorithm Using Dynamic Pauli Gates

Mohamed A Elbaset, Mohamed A. Soliman, Shady A Deraz +1 more

By utilizing quantum cryptography, a real-time secure algorithm is created that makes use of the quantum properties of photons. An algorithm utilizing symmetric key is presented, taking into account the fundamental principles of both classical and quantum computing. Messages in this algorithm consist of blocks, each of which consists of 32 bits of space. To begin with, the process of classical encryption is divided into two processes, rotation process and permutation process, all controlled by the key that determines the order in which the bits of the block message are rotated. Secondly, encrypting block messages in bits is converted to qubits. In the third step, the quantum bits are applied to a certain quantum gate, such as Not(x), Control Not (CNot) and Toffoli (T), to change the value of that quantum bits. Fourth, in order to create non-orthogonal ciphertext states, Pauli gates are utilized and controlled by a key in the second stage. Eavesdroppers cannot detect the encryption of messages that have changed from orthogonal states to non-orthogonal states because quantum computing is based on quantum mechanical principles. It has been demonstrated that the proposed algorithm increases message space. In addition, various algorithm analyses have proven the improved strength of our proposed algorithm against various attacks, including brute force attacks.

International Telecommunications Conference (ITC-Egypt)Jul 18, 20231 citation

A New Symmetric Key Quantum Cryptographic Algorithm

Hassan M. Elkamchochi, Refaat El-Attar, Amr H. Abd-Elhamied

Based on the principles of both classical and quantum computation primitives, a new symmetric key quantum cryptographic algorithm is proposed. This algorithm can be used to encrypt classical binary messages as well as quantum information. Encryption and decryption are implemented by the aid of classical and quantum computation which can be realized by suitable technology. Because each encryption process is under the control of the key which is dynamically and recursively changed through each round in both encryption and decryption and the final ciphertext states are non-orthogonal, the eavesdropper can not acquire fixed ciphertext without the keys so the eavesdropping attack is invalid, which is guaranteed with the no-cloning theory in quantum mechanics. Similarly, the non-orthogonality of the ciphertext renders the Trojan horse attack strategy impossible. Also the algorithm applies a pseudo random process from stage to stage. This pseudo randomness hinders the ability of Eve to attack such a cryptographic scheme.

National Radio Science ConferenceMar 1, 20072 citations

Quantum exhaustive key search with simplified-DES as a case study

Mishal Almazrooie, Azman Samsudin, Rosni Abdullah +1 more

To evaluate the security of a symmetric cryptosystem against any quantum attack, the symmetric algorithm must be first implemented on a quantum platform. In this study, a quantum implementation of a classical block cipher is presented. A quantum circuit for a classical block cipher of a polynomial size of quantum gates is proposed. The entire work has been tested on a quantum mechanics simulator called libquantum. First, the functionality of the proposed quantum cipher is verified and the experimental results are compared with those of the original classical version. Then, quantum attacks are conducted by using Grover's algorithm to recover the secret key. The proposed quantum cipher is used as a black box for the quantum search. The quantum oracle is then queried over the produced ciphertext to mark the quantum state, which consists of plaintext and key qubits. The experimental results show that for a key of n-bit size and key space of N such that [Formula: see text], the key can be recovered in [Formula: see text] computational steps.

SpringerPlusSep 6, 201610 citations

A Study of Post Quantum Cryptographic Security Model Using Symmetric Key Algorithm

Sonali Sharma, Shilpi Sharma, Tanupriya Choudhury

The advancement in the field of technology and science has rendered the classical algorithms used for securing data vulnerable to attacks by quantum computers. Post quantum cryptography aims at establishing quantum safe algorithms so that data can be secured. Advanced Encryption Standard (AES) is a symmetric key block cipher which provides security against known quantum attacks. The Shor’s and Grover’s algorithms are the quantum algorithms which have proved to break encryption provided by security mechanisms like RSA and even have the potential to break AES-128 in future. However, if key size of symmetric key security mechanisms is increased then security provided by them cannot be broken by both classical and quantum computers in near future. Quantum computers are becoming more and more prevalent, but there is still some concern about their security. In this paper, we will show that the current quantum computers in use cannot break AES-256 encryption with Grover’s algorithm. We have implemented AES-256 for encryption of files in our system and proposed a proof that the qubits used by quantum computers are not enough to break AES-256 with Grover’s algorithm. We believe that this provides strong evidence that current quantum computers are not a threat to encrypted data using AES-256. We hope this will ease concerns about using quantum computing for secure applications and encourage further development of these powerful machines.

International Journal of Intelligent Systems and Applications in EngineeringApr 16, 20230 citations

Novel Quantum Encryption Algorithm Based on Multiqubit Quantum Shift Register and Hill Cipher

Rifaat Z. Khalaf, Alharith A. Abdullah

Based on a quantum shift register, a novel quantum block cryptographic algorithm that can be used to encrypt classical messages is proposed. The message is encoded and decoded by using a code generated by the quantum shift register. The security of this algorithm is analysed in detail. It is shown that, in the quantum block cryptographic algorithm, two keys can be used. One of them is the classical key that is used in the Hill cipher algorithm where Alice and Bob use the authenticated Diffie Hellman key exchange algorithm using the concept of digital signature for the authentication of the two communicating parties and so eliminate the man-in-the-middle attack. The other key is generated by the quantum shift register and used for the coding of the encryption message, where Alice and Bob share the key by using theBB84 protocol. The novel algorithm can prevent a quantum attack strategy as well as a classical attack strategy. The problem of key management is discussed and circuits for the encryption and the decryption are suggested.

Advances in High Energy PhysicsJan 1, 20146 citations