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

Advances in High Energy Physics

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

Rifaat Z. Khalaf, Alharith A. Abdullah

Published Jan 1, 2014• 6 citations
Publisher

Abstract

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.

DOI
10.1155/2014/104325

Related papers

A Realizable Quantum Three-Pass Protocol Authentication Based on Hill-Cipher Algorithm

Alharith A. Abdullah, Rifaat Z. Khalaf, Mustafa Riza

A realizable quantum three-pass protocol authentication based on Hill-cipher algorithm is presented by encoded and decoded plaintext using classical Hill-cipher algorithm. It is shown that the encoded message transferred to the particles called quantum state where we assumed that a photon is used as a qubit and after the encoded message is transferred into photons, the polarization of each photon is rotated by an angle θj , which is chosen randomly for each qubit. The sender and receiver agree over a Hill-cipher key, the encryption occurs by utilization of the quantum three-pass protocol (QTPP), the decryption will be illustrated, and an example shows how the algorithm will work. Finally, the security of this algorithm is analyzed in detail.

Mathematical Problems in Engineering•Jan 1, 2015•18 citations

A quantum authenticated encryption scheme

Xin Lü, Zhi Ma, Dengguo Feng

Privacy and authenticity are two main tasks for secure communication. In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string y as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme.

International Conference on Signal Processing•Jun 28, 2005•3 citations

Multiparty Quantum Cryptography with Block Cipher RC6 (B- MQKD)

Iqtidar Zohair, Salah Abdulhadi Albermany

The proposed B-MQKD method uses a quantum key distribution to generate a key and provide an authentication amongst many parties. It uses concepts of block cipher by using RC6 algorithm for encryption. The mix concept in B-MQKD (quantum and block cipher) gives the algorithm more authentication, randomness, and security which make it difficult to find the original message by attackers. In this paper using BB84 among three parties make it possiple to give the key to many users in a secret way.

Journal of Kufa for Mathematics and Computer•Sep 12, 2019•0 citations

A TYPE OF POST–QUANTUM CRYPTOGRAPHIC ALGORITHM

Hong Dung Luu

The article proposes a type of post–quantum cryptographic algorithm based on hash function and One–Time Pad cipher. Due to inheriting a property called “perfect secrecy” of the One-Time Pad cipher, the algorithms constructed according to the method proposed here can resist various types of attacks with the help of quantum computers. In addition to high security, algorithms of this type also have the ability to authenticate the origin and integrity of the encrypted messages. On the other hand, the one-time key for encryption/decryption is established for each individual message while the management and distribution of the shared secret key between the sender/encryptor and receiver/decryptor is performed similar to symmetric – key cryptosystems being applied in practice.

Journal of Science and Technique•Jun 28, 2024•2 citations

A Novel and Hybrid Post Quantum Cryptographic algorithm for Enhanced Security in Wireless Networks

Mutya Sirisha Adapa, Dr.P.Venkateswara Rao

Cryptography enables modern-day secure communication. The advancement of quantum algorithms has made classical cryptosystems ineffective. Important data has been encrypted and verified using digital signatures and cryptography. Classical cryptography systems were on the edge of collapse when quantum algorithms were introduced, since quantum computers can solve complex problems in less time. It is important to be prepared for future threats, even if standard cryptosystems are presumably safe for the moment being because quantum computing is not yet developed. One use of quantum cryptography is quantum key distribution (QKD), which is a way to safely share encryption keys between communication parties by utilizing quantum physics. Hybrid classical-quantum methods offer protection from both classical & quantum attackers, which can help smooth the way for the change. We introduce a new way to build hybrid encryption schemes from preexisting ones. First, the paper examines classical cryptosystems vulnerability to quantum computers. Then, it investigate into different families of post-quantum cryptosystems, checks in on the NIST's post-quantum cryptography consistency process, and finally, compares the performance of algorithms using post-quantum cryptography on various platforms. Along with discussing and evaluating current methods, this paper also discusses a novel hybrid quantum cryptographic system that employs message authentication codes with enhanced lattice based cryptography.

Utilitas Mathematica•Jun 27, 2025•0 citations

Quantum-Resistant Diffie-Hellman Key Exchange Protocol

A. K. M. Fakhrul Hossain

The necessity of a secure key exchange protocol arises from the critical need to establish encrypted communication over an untrusted network. Over time, a multitude of key exchange mechanisms have been developed to counteract adversarial threats. The Diffie-Hellman key exchange protocol (DHKE) is one of the most widely used protocols for symmetric key sharing. However, this protocol exhibits certain inherent limitations that attackers may exploit. It lacks authentication mechanism and is susceptible to Man-in-the-Middle (MITM) attacks and quantum attacks. To mitigate these vulnerabilities, we have designed a hybrid key exchange protocol combining DHKE with Learning With Errors (LWE), a lattice-based post-quantum primitive. This proposed protocol provides authentication via a Public Key Infrastructure (PKI) together with CRYSTALS-Dilithium digital signature, resilience against MITM attacks, and robustness against classical and quantum threats. We have done a security analysis using the Dolev-Yao threat model, extended to quantum-equipped attackers, and showed that the protocol achieves mutual authentication, session key secrecy, and forward secrecy under the hardness of LWE and DHKE. Lastly, we provided detailed parameter recommendations based on NIST standards and shed light on side-channel attacks.

SUST Journal of Science and Technology (SUST JST)•Aug 17, 2026•0 citations
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.
A realizable quantum three-pass protocol authentication based on Hill-cipher algorithm is presented by encoded and decoded plaintext using classical Hill-cipher algorithm. It is shown that the encoded message transferred to the particles called quantum state where we assumed that a photon is used as a qubit and after the encoded message is transferred into photons, the polarization of each photon is rotated by an angle θj , which is chosen randomly for each qubit. The sender and receiver agree over a Hill-cipher key, the encryption occurs by utilization of the quantum three-pass protocol (QTPP), the decryption will be illustrated, and an example shows how the algorithm will work. Finally, the security of this algorithm is analyzed in detail.
Privacy and authenticity are two main tasks for secure communication. In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string y as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme.
The article proposes a type of post–quantum cryptographic algorithm based on hash function and One–Time Pad cipher. Due to inheriting a property called “perfect secrecy” of the One-Time Pad cipher, the algorithms constructed according to the method proposed here can resist various types of attacks with the help of quantum computers. In addition to high security, algorithms of this type also have the ability to authenticate the origin and integrity of the encrypted messages. On the other hand, the one-time key for encryption/decryption is established for each individual message while the management and distribution of the shared secret key between the sender/encryptor and receiver/decryptor is performed similar to symmetric – key cryptosystems being applied in practice.
Cryptography enables modern-day secure communication. The advancement of quantum algorithms has made classical cryptosystems ineffective. Important data has been encrypted and verified using digital signatures and cryptography. Classical cryptography systems were on the edge of collapse when quantum algorithms were introduced, since quantum computers can solve complex problems in less time. It is important to be prepared for future threats, even if standard cryptosystems are presumably safe for the moment being because quantum computing is not yet developed. One use of quantum cryptography is quantum key distribution (QKD), which is a way to safely share encryption keys between communication parties by utilizing quantum physics. Hybrid classical-quantum methods offer protection from both classical & quantum attackers, which can help smooth the way for the change. We introduce a new way to build hybrid encryption schemes from preexisting ones. First, the paper examines classical cryptosystems vulnerability to quantum computers. Then, it investigate into different families of post-quantum cryptosystems, checks in on the NIST's post-quantum cryptography consistency process, and finally, compares the performance of algorithms using post-quantum cryptography on various platforms. Along with discussing and evaluating current methods, this paper also discusses a novel hybrid quantum cryptographic system that employs message authentication codes with enhanced lattice based cryptography.
The necessity of a secure key exchange protocol arises from the critical need to establish encrypted communication over an untrusted network. Over time, a multitude of key exchange mechanisms have been developed to counteract adversarial threats. The Diffie-Hellman key exchange protocol (DHKE) is one of the most widely used protocols for symmetric key sharing. However, this protocol exhibits certain inherent limitations that attackers may exploit. It lacks authentication mechanism and is susceptible to Man-in-the-Middle (MITM) attacks and quantum attacks. To mitigate these vulnerabilities, we have designed a hybrid key exchange protocol combining DHKE with Learning With Errors (LWE), a lattice-based post-quantum primitive. This proposed protocol provides authentication via a Public Key Infrastructure (PKI) together with CRYSTALS-Dilithium digital signature, resilience against MITM attacks, and robustness against classical and quantum threats. We have done a security analysis using the Dolev-Yao threat model, extended to quantum-equipped attackers, and showed that the protocol achieves mutual authentication, session key secrecy, and forward secrecy under the hardness of LWE and DHKE. Lastly, we provided detailed parameter recommendations based on NIST standards and shed light on side-channel attacks.