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 Journal of Quantum Information

IMPROVEMENT OF ONE QUANTUM ENCRYPTION SCHEME

Zhengjun Cao, Lihua Liu

Published Oct 1, 2012• 6 citations
Publisher

Abstract

Zhou et al. proposed a quantum encryption scheme based on quantum computation in 2006 [N. Zhou et al., Physica A362 (2006) 305]. Each qubit of the ciphertext is constrained to two pairs of conjugate states. So, its implementation is feasible with the existing technology. But it is inefficient since it entails six key bits to encrypt one message bit, and the resulting ciphertext for one message bit consists of three qubits. In addition, its security cannot be directly reduced to the well-known BB84 protocol. In this paper, we improve it using the technique developed in BB84 protocol. The new scheme entails only two key bits to encrypt one message bit. The resulting ciphertext is just composed of two qubits. It saves about a half cost without the loss of security. Moreover, the new scheme is probabilistic instead of deterministic.

DOI
10.1142/s0219749912500761

Related papers

Improvement of one quantum encryption scheme

Zhengjun Cao, Lihua Liu

Based on quantum computation, Zhou et al proposed a quantum encryption scheme in 2006. Each qubit of the ciphertext is constrained to two pairs of conjugate states. So its implementation is feasible with the existing technology. But it is inefficient since it entails six key bits to encrypt one message bit, and the resulting ciphertext for one message bit consists of three qubits. In addition, its security can not be directly reduced to the well-known BB84 protocol. In this paper, we revisit it using the technique developed in BB84 protocol. The new scheme entails only two key bits to encrypt one message bit. The resulting ciphertext is just composed of two qubits. It saves about a half cost without the loss of security. Moreover, the encryption scheme is probabilistic other than deterministic.

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)•Oct 1, 2010•7 citations

Improvement of One Quantum Encryption Scheme.

Zhengjun Cao

Abstract Zhou et al proposed a quantum encryption scheme based on quantum computation in 2006. Each qubit of the ciphertext is constrained to two pairs of conjugate states. So its implementation is feasible with the existing technology. But it is inefficient since it entails six key bits to encrypt one message bit, and the resulting ciphertext for one message bit consists of three qubits. In addition, its security can not be directly reduced to the well-known BB84 protocol. In this paper, we revisit it using the technique developed in BB84 protocol. The new scheme entails only two key bits to encrypt one message bit. The resulting ciphertext is just composed of two qubits. It saves about a half cost without the loss of security. Moreover, the encryption scheme is probabilistic rather than deterministic. 1

•Jan 1, 2009•0 citations

QUANTUM KEY DISTRIBUTION SCHEME: AN IMPROVEMENT BASED ON BB84 PROTOCOL

Kausik Saha

Cryptography is being introduced to secure data. Through Classical Cryptographic technique, we can encrypt our data and secure secret key also. But classical cryptography is based on mathematical techniques where reversing one-way function is possible with sufficient computing power and time. So, Quantum Cryptography is introduced to overcome those drawbacks of traditional classical cryptography. It is based on the values of quantum mechanics and photon. Scientists and researchers have brought up a new key distribution protocol based on Quantum Cryptography is called Quantum Key Distribution (QKD) Protocol. The first QKD protocol BB84 was introduced by Charles Bennett and Gilles Brassard in 1984. After that several QKD protocols have been created. In this paper we have improved BB84 Protocol by removing the drawbacks of the existing algorithm towards Eavesdropping which may not be detected or disclosing large portion of secret key. Steps of the existing BB84 algorithm along with the modified one is described in detail with example and pseudo code. Limitations of BB84 and comparative study of both the existing and the improved one based on their security has been made and described in this current work.

International Journal of Advanced Research in Computer Science•Apr 20, 2018•1 citation

Eight-State BB84: A C# Simulation

Liliana Zisu

The first and best known quantum protocol BB84, whose security is unconditional allows the transmission of a key with a length equal to that of the message. This key used with an encryption algorithm leads to an unbreakable cryptographic scheme. Despite advantages the protocol still can be improved in at least two aspects: its efficiency which is of about 50%, only half of the photons transmitted are used to create the encryption key and the second aspect refers to the communication that takes place on the classic channel, as it must be reduced or even eliminated. The paper presents a method that improves the two aspects of the BB84 protocol by using quantum memory and eight states of polarization. The implementation of both the proposed method and the BB84 protocol was done through a C# application.

World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering•Mar 3, 2019•0 citations

Quantum Public-Key Encryption Schemes Based on Conjugate Coding

Li Yang, Biyao Yang, Chong Xiang

We present several quantum public-key encryption (QPKE) protocols designed with conjugate coding single-photon string, thus may be realized in laboratory with nowadays techniques. Two of these schemes are orienting one-bit message, and are extended to two kinds of QPKE schemes orienting multi-bits. The novel structure of these protocols ensures they are information-theoretically secure with, probably, a bound greater than any given polynomial of $n$. Finally, we describe a way to conceal the classical part of the public key with quantum state, this idea is expected to enhance a scheme to be information-theoretically secure.

arXiv:1112.0421•Dec 2, 2011•7 citations

A method to improve the BB84 protocol

Liliana Zisu

Quantum cryptography, the principles of which are based on classical mechanics laws, solves exceptionally the issue of key distribution in classical cryptography. BB84, the first quantum key distribution created by Charles Bennett and Gilles Brassard in 1984 offers unconditional security and allows the transmission of a key with the length equal to the length of the message. According to Vernom, using the key with the above feature once together with an encryption algorithm leads to the formation of a most secure cryptographic system. The paper presents a method for improving the BB84 quantum protocol, using ten states of polarization, quantum memory and direct communication in both directions. The implementation of both the proposed method and the BB84 protocol was done through a C# application.

Scientific Bulletin of Naval Academy•Jul 15, 2019•1 citation
Zhou et al. proposed a quantum encryption scheme based on quantum computation in 2006 [N. Zhou et al., Physica A362 (2006) 305]. Each qubit of the ciphertext is constrained to two pairs of conjugate states. So, its implementation is feasible with the existing technology. But it is inefficient since it entails six key bits to encrypt one message bit, and the resulting ciphertext for one message bit consists of three qubits. In addition, its security cannot be directly reduced to the well-known BB84 protocol. In this paper, we improve it using the technique developed in BB84 protocol. The new scheme entails only two key bits to encrypt one message bit. The resulting ciphertext is just composed of two qubits. It saves about a half cost without the loss of security. Moreover, the new scheme is probabilistic instead of deterministic.
Based on quantum computation, Zhou et al proposed a quantum encryption scheme in 2006. Each qubit of the ciphertext is constrained to two pairs of conjugate states. So its implementation is feasible with the existing technology. But it is inefficient since it entails six key bits to encrypt one message bit, and the resulting ciphertext for one message bit consists of three qubits. In addition, its security can not be directly reduced to the well-known BB84 protocol. In this paper, we revisit it using the technique developed in BB84 protocol. The new scheme entails only two key bits to encrypt one message bit. The resulting ciphertext is just composed of two qubits. It saves about a half cost without the loss of security. Moreover, the encryption scheme is probabilistic other than deterministic.
Abstract Zhou et al proposed a quantum encryption scheme based on quantum computation in 2006. Each qubit of the ciphertext is constrained to two pairs of conjugate states. So its implementation is feasible with the existing technology. But it is inefficient since it entails six key bits to encrypt one message bit, and the resulting ciphertext for one message bit consists of three qubits. In addition, its security can not be directly reduced to the well-known BB84 protocol. In this paper, we revisit it using the technique developed in BB84 protocol. The new scheme entails only two key bits to encrypt one message bit. The resulting ciphertext is just composed of two qubits. It saves about a half cost without the loss of security. Moreover, the encryption scheme is probabilistic rather than deterministic. 1
Cryptography is being introduced to secure data. Through Classical Cryptographic technique, we can encrypt our data and secure secret key also. But classical cryptography is based on mathematical techniques where reversing one-way function is possible with sufficient computing power and time. So, Quantum Cryptography is introduced to overcome those drawbacks of traditional classical cryptography. It is based on the values of quantum mechanics and photon. Scientists and researchers have brought up a new key distribution protocol based on Quantum Cryptography is called Quantum Key Distribution (QKD) Protocol. The first QKD protocol BB84 was introduced by Charles Bennett and Gilles Brassard in 1984. After that several QKD protocols have been created. In this paper we have improved BB84 Protocol by removing the drawbacks of the existing algorithm towards Eavesdropping which may not be detected or disclosing large portion of secret key. Steps of the existing BB84 algorithm along with the modified one is described in detail with example and pseudo code. Limitations of BB84 and comparative study of both the existing and the improved one based on their security has been made and described in this current work.
The first and best known quantum protocol BB84, whose security is unconditional allows the transmission of a key with a length equal to that of the message. This key used with an encryption algorithm leads to an unbreakable cryptographic scheme. Despite advantages the protocol still can be improved in at least two aspects: its efficiency which is of about 50%, only half of the photons transmitted are used to create the encryption key and the second aspect refers to the communication that takes place on the classic channel, as it must be reduced or even eliminated. The paper presents a method that improves the two aspects of the BB84 protocol by using quantum memory and eight states of polarization. The implementation of both the proposed method and the BB84 protocol was done through a C# application.
We present several quantum public-key encryption (QPKE) protocols designed with conjugate coding single-photon string, thus may be realized in laboratory with nowadays techniques. Two of these schemes are orienting one-bit message, and are extended to two kinds of QPKE schemes orienting multi-bits. The novel structure of these protocols ensures they are information-theoretically secure with, probably, a bound greater than any given polynomial of nnn. Finally, we describe a way to conceal the classical part of the public key with quantum state, this idea is expected to enhance a scheme to be information-theoretically secure.
Quantum cryptography, the principles of which are based on classical mechanics laws, solves exceptionally the issue of key distribution in classical cryptography. BB84, the first quantum key distribution created by Charles Bennett and Gilles Brassard in 1984 offers unconditional security and allows the transmission of a key with the length equal to the length of the message. According to Vernom, using the key with the above feature once together with an encryption algorithm leads to the formation of a most secure cryptographic system. The paper presents a method for improving the BB84 quantum protocol, using ten states of polarization, quantum memory and direct communication in both directions. The implementation of both the proposed method and the BB84 protocol was done through a C# application.