Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Telecommunications Conference (ITC-Egypt)

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

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

Published Jul 13, 2021• 6 citations
Publisher

Abstract

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.

DOI
10.1109/itc-egypt52936.2021.9513913

Related papers

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, 2023•1 citation

A Symmetric Key Dynamic Gates Encryption Algorithm Based on Quantum Computing

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

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.

National Radio Science Conference•Jul 27, 2021•3 citations

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 Conference•Mar 1, 2007•2 citations

A new hardware quantum-based encryption algorithm

Zakariya Qawaqneh, Khaled M. Elleithy, Bandar Alotaibi +1 more

Cryptography is entering a new age since the first steps that have been made towards quantum computing, which also poses a threat to the classical cryptosystem in general. In this paper, we introduce a new novel encryption technique and algorithm to improve quantum cryptography. The aim of the suggested scheme is to generate a digital signature in quantum computing. An arbitrated digital signature is introduced instead of the directed digital signature to avoid the denial of sending the message from the sender and pretending that the sender's private key was stolen or lost and the signature has been forged. The onetime pad operation that most quantum cryptography algorithms that have been proposed in the past is avoided to decrease the possibility of the channel eavesdropping. The presented algorithm in this paper uses quantum gates to do the encryption and decryption processes. In addition, new quantum gates are introduced, analyzed, and investigated in the encryption and decryption processes. The authors believe the gates that are used in the proposed algorithm improve the security for both classical and quantum computing. (Against)The proposed gates in the paper have plausible properties that position them as suitable candidates for encryption and decryption processes in quantum cryptography. To demonstrate the security features of the algorithm, it was simulated using MATLAB simulator, in particular through the Quack Quantum Library.

IEEE Long Island Systems, Applications and Technology Conference (LISAT)•May 1, 2014•4 citations

Maintaining Secure Level on Symmetric Encryption under Quantum Attack

Hung-Jr Shiu, Chao‐Tung Yang, Yun-Ru Tsai +2 more

Quantum computing is currently being researched in many countries, and if implemented in the near future, it may pose a threat to existing encryption standards. In the quantum computer environment, asymmetric encryption can be solved by Shor’s Algorithm in polynomial time, and the difficulty of breaking symmetric encryption using brute force is reduced from N times to square root N times by Grover’s Algorithm. We take the Advanced Encryption Standard as the theme and increase the key length from the original standard 192 bits and 256 bits to 384 bits and 512 bits, respectively, in order to maintain the security level of AES 192/256 under the environment of quantum computing, so we propose the key schedule of AES 384/512, and write the software in C++ on FPGA. The experimental results show that our scheme can achieve Level III and Level V security levels in a quantum computer attack environment. In addition to increasing the length of the key, we use the LUT method in the process of writing SubBytes to replace the array and speed up the computation to optimize the execution speed. In addition, the proposed scheme is still based on 128-bit computing blocks, rather than computing blocks in larger blocks.

Applied Sciences•May 31, 2023•6 citations

Quantum cryptography for secure messaging

JANGAM BHARGAVI, YERLA ASHRITHA, MULAGALA SRI HARSHITHA +1 more

The project “Quantum Cryptography for Secure Messaging” aims to create a highly secure communication system using the BB84 protocol, a key method in quantum key distribution. As traditional encryption systems face growing threats from cyberattacks and future quantum computers, this project provides a future-proof solution for message encryption. It uses simulated quantum bits (qubits) to generate secret keys based on quantum mechanics, ensuring that any eavesdropping attempts can be detected instantly. The process involves encoding binary data into quantum states, securely exchanging keys, and applying them for symmetric encryption of messages. Key features include real-time key generation, automatic encryption and decryption, and intrusion detection. The expected outcome is a working prototype of a secure messaging system that can resist both current and emerging security challenges, highlighting the potential of quantum cryptography as a foundation for the next generation of digital security.

World Journal of Advanced Research and Reviews•Mar 25, 2026•0 citations
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.
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.
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.
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.
Cryptography is entering a new age since the first steps that have been made towards quantum computing, which also poses a threat to the classical cryptosystem in general. In this paper, we introduce a new novel encryption technique and algorithm to improve quantum cryptography. The aim of the suggested scheme is to generate a digital signature in quantum computing. An arbitrated digital signature is introduced instead of the directed digital signature to avoid the denial of sending the message from the sender and pretending that the sender's private key was stolen or lost and the signature has been forged. The onetime pad operation that most quantum cryptography algorithms that have been proposed in the past is avoided to decrease the possibility of the channel eavesdropping. The presented algorithm in this paper uses quantum gates to do the encryption and decryption processes. In addition, new quantum gates are introduced, analyzed, and investigated in the encryption and decryption processes. The authors believe the gates that are used in the proposed algorithm improve the security for both classical and quantum computing. (Against)The proposed gates in the paper have plausible properties that position them as suitable candidates for encryption and decryption processes in quantum cryptography. To demonstrate the security features of the algorithm, it was simulated using MATLAB simulator, in particular through the Quack Quantum Library.
Quantum computing is currently being researched in many countries, and if implemented in the near future, it may pose a threat to existing encryption standards. In the quantum computer environment, asymmetric encryption can be solved by Shor’s Algorithm in polynomial time, and the difficulty of breaking symmetric encryption using brute force is reduced from N times to square root N times by Grover’s Algorithm. We take the Advanced Encryption Standard as the theme and increase the key length from the original standard 192 bits and 256 bits to 384 bits and 512 bits, respectively, in order to maintain the security level of AES 192/256 under the environment of quantum computing, so we propose the key schedule of AES 384/512, and write the software in C++ on FPGA. The experimental results show that our scheme can achieve Level III and Level V security levels in a quantum computer attack environment. In addition to increasing the length of the key, we use the LUT method in the process of writing SubBytes to replace the array and speed up the computation to optimize the execution speed. In addition, the proposed scheme is still based on 128-bit computing blocks, rather than computing blocks in larger blocks.
The project “Quantum Cryptography for Secure Messaging” aims to create a highly secure communication system using the BB84 protocol, a key method in quantum key distribution. As traditional encryption systems face growing threats from cyberattacks and future quantum computers, this project provides a future-proof solution for message encryption. It uses simulated quantum bits (qubits) to generate secret keys based on quantum mechanics, ensuring that any eavesdropping attempts can be detected instantly. The process involves encoding binary data into quantum states, securely exchanging keys, and applying them for symmetric encryption of messages. Key features include real-time key generation, automatic encryption and decryption, and intrusion detection. The expected outcome is a working prototype of a secure messaging system that can resist both current and emerging security challenges, highlighting the potential of quantum cryptography as a foundation for the next generation of digital security.