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

arXiv:1501.04896 · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

The classification of quantum symmetric-key encryption protocols

Chong Xiang, Li Yang, Yong Jun Peng, Dongqing Chen

Published Nov 18, 2014• 1 citation
arXivHTMLPDF

Abstract

The classification of quantum symmetric-key encryption protocol is presented. According to five elements of a quantum symmetric-key encryption protocol: plaintext, ciphertext, key, encryption algorithm and decryption algorithm, there are 32 different kinds of them. Among them, 5 kinds of protocols have already been constructed and studied, and 21 kinds of them are proved to be impossible to construct, the last 6 kinds of them are not yet presented effectively. That means the research on quantum symmetric-key encryption protocol only needs to consider with 5 kinds of them nowadays.

DOI
10.1117/12.2071441

Related papers

A complete classification of quantum public-key encryption protocols

Chenmiao Wu, Li Yang

We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the property of each element which is either quantum or classical, the quantum public-key encryption protocols can be divided into 64 kinds. Among 64 kinds of protocols, 8 kinds have already been constructed, 52 kinds can be proved to be impossible to construct and the remaining 4 kinds have not been presented effectively yet. This indicates that the research on quantum public-key encryption protocol should be focus on the existed kinds and the unproposed kinds.

arXiv:1507.03765•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 13, 2015•7 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

Classification of quantum authentication protocols and calculation of their complexity

Aymen Ghilen, Hafedh Belmabrouk, Ridha Bouallègue

In this paper, we aim at presenting a detailed classification of the most known authentication protocols using quantum means with calculation of quantum communication complexity. The Quantum Key Distribution protocols were basically proposed to establish secret keys that will be used later for encrypting and decrypting messages. Practically, QKD protocols are vulnerable against the men-in-middle attack. Thereby, in order to prevent masquerading any legitimate user and tampering with the communication, QKD schemes need authentication prior to communication. Many quantum authentication protocols have been proposed in the literature. Each one has a particular approach to authenticate the communicators. We attempt in the present work to introduce the various ways of quantum authentication and to classify them according to some specific criteria with a calculation of the quantum communication complexity.

International Conference on Sciences and Techniques of Automatic Control and Computer Engineering•Dec 1, 2014•8 citations

Asymmetrical quantum encryption protocol based on quantum search algorithm

Wenjun Luo, Guanli Liu

Quantum cryptography and quantum search algorithm are considered as two important research topics in quantum information science. An asymmetrical quantum encryption protocol based on the properties of quantum one-way function and quantum search algorithm is proposed. Depending on the no-cloning theorem and trapdoor one-way functions of the public-key, the eavesdropper cannot extract any private-information from the public-keys and the ciphertext. Introducing key-generation randomized logarithm to improve security of our proposed protocol, i.e., one private-key corresponds to an exponential number of public-keys. Using unitary operations and the single photon measurement, secret messages can be directly sent from the sender to the receiver. The security of the proposed protocol is proved that it is information-theoretically secure. Furthermore, compared the symmetrical Quantum key distribution, the proposed protocol is not only efficient to reduce additional communication, but also easier to carry out in practice, because no entangled photons and complex operations are required.

China Communications•Sep 1, 2014•8 citations

QUANTUM CRYPTOGRAPHY METHODS AND INSTRUMENTS

Secure data exchange over the network is ensured by the requirements of confidentiality, integrity and availability of information. To meet these requirements, sent data is encrypted on the sending side, and the received information is decrypted on the receiving side. Transmitted message is encrypted according to rules determined by the algorithm and key. Crypto security of encrypted information depends on the key length. Among the encryption algorithms, there are algorithms with a symmetric (private) key and with an asymmetric (public) key. Despite all the advantages of a private key, asymmetric keys are used to deliver it from one user to another (key distribution). However, high-performance quantum computers are capable to decrypt intercepted data. Therefore, modern cryptographic systems use quantum key distribution method. The idea of using quantum bits was proposed in 1970 by S. Wiesner. In 1984, Ch. Bennett and G. Brassard proposed the BB84 protocol. The use of «entangled » quanta for systems with quantum key distribution was offerred in 1991 by A. Eckert. All modern quantum cryptography systems are based on these above-mentioned protocols.

Infokommunikacionnye tehnologii•Dec 1, 2023•0 citations

Towards Quantum Enigma Cipher II-A protocol based on quantum illumination-

Osamu Hirota

This research note II introduces a way to understand a basic concept of the quantum enigma cipher. The conventional cipher is designed by a mathematical algorithm and its security is evaluated by the complexity of the algorithm in security analysis and ability of computers. This kind of cipher can be decrypted with probability one in principle by the Brute force attack in which an eavesdropper tries all the possible keys based on the correct ciphertext and some known plaintext. A cipher with quantum effects in physical layer may protect the system from the Brute force attack by means of the quantum no cloning theorem and randomizations based on quantum noise effect. The randomizations for the ciphertext which is the output from the mathematical encryption box is crucial to realize a quantum enigma cipher. Especially, by randomizations, it is necessary to make a substantial difference in accuracy of ciphertext in eavesdropper's observation and legitimate user's observation. The quantum illumination protocol can make a difference in error performance of the legitimate's receiver and the eavesdropper's receiver. This difference is due to differences in ability of the legitimate's receiver with entanglement and the eavesdropper's receiver without entanglement. It is shown in this note that the quantum illumination can be employed as an element of the most simple quantum enigma cipher.

arXiv:1511.02338•Nov 7, 2015•2 citations
The classification of quantum symmetric-key encryption protocol is presented. According to five elements of a quantum symmetric-key encryption protocol: plaintext, ciphertext, key, encryption algorithm and decryption algorithm, there are 32 different kinds of them. Among them, 5 kinds of protocols have already been constructed and studied, and 21 kinds of them are proved to be impossible to construct, the last 6 kinds of them are not yet presented effectively. That means the research on quantum symmetric-key encryption protocol only needs to consider with 5 kinds of them nowadays.
We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the property of each element which is either quantum or classical, the quantum public-key encryption protocols can be divided into 64 kinds. Among 64 kinds of protocols, 8 kinds have already been constructed, 52 kinds can be proved to be impossible to construct and the remaining 4 kinds have not been presented effectively yet. This indicates that the research on quantum public-key encryption protocol should be focus on the existed kinds and the unproposed kinds.
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.
In this paper, we aim at presenting a detailed classification of the most known authentication protocols using quantum means with calculation of quantum communication complexity. The Quantum Key Distribution protocols were basically proposed to establish secret keys that will be used later for encrypting and decrypting messages. Practically, QKD protocols are vulnerable against the men-in-middle attack. Thereby, in order to prevent masquerading any legitimate user and tampering with the communication, QKD schemes need authentication prior to communication. Many quantum authentication protocols have been proposed in the literature. Each one has a particular approach to authenticate the communicators. We attempt in the present work to introduce the various ways of quantum authentication and to classify them according to some specific criteria with a calculation of the quantum communication complexity.
Quantum cryptography and quantum search algorithm are considered as two important research topics in quantum information science. An asymmetrical quantum encryption protocol based on the properties of quantum one-way function and quantum search algorithm is proposed. Depending on the no-cloning theorem and trapdoor one-way functions of the public-key, the eavesdropper cannot extract any private-information from the public-keys and the ciphertext. Introducing key-generation randomized logarithm to improve security of our proposed protocol, i.e., one private-key corresponds to an exponential number of public-keys. Using unitary operations and the single photon measurement, secret messages can be directly sent from the sender to the receiver. The security of the proposed protocol is proved that it is information-theoretically secure. Furthermore, compared the symmetrical Quantum key distribution, the proposed protocol is not only efficient to reduce additional communication, but also easier to carry out in practice, because no entangled photons and complex operations are required.
Secure data exchange over the network is ensured by the requirements of confidentiality, integrity and availability of information. To meet these requirements, sent data is encrypted on the sending side, and the received information is decrypted on the receiving side. Transmitted message is encrypted according to rules determined by the algorithm and key. Crypto security of encrypted information depends on the key length. Among the encryption algorithms, there are algorithms with a symmetric (private) key and with an asymmetric (public) key. Despite all the advantages of a private key, asymmetric keys are used to deliver it from one user to another (key distribution). However, high-performance quantum computers are capable to decrypt intercepted data. Therefore, modern cryptographic systems use quantum key distribution method. The idea of using quantum bits was proposed in 1970 by S. Wiesner. In 1984, Ch. Bennett and G. Brassard proposed the BB84 protocol. The use of «entangled » quanta for systems with quantum key distribution was offerred in 1991 by A. Eckert. All modern quantum cryptography systems are based on these above-mentioned protocols.
This research note II introduces a way to understand a basic concept of the quantum enigma cipher. The conventional cipher is designed by a mathematical algorithm and its security is evaluated by the complexity of the algorithm in security analysis and ability of computers. This kind of cipher can be decrypted with probability one in principle by the Brute force attack in which an eavesdropper tries all the possible keys based on the correct ciphertext and some known plaintext. A cipher with quantum effects in physical layer may protect the system from the Brute force attack by means of the quantum no cloning theorem and randomizations based on quantum noise effect. The randomizations for the ciphertext which is the output from the mathematical encryption box is crucial to realize a quantum enigma cipher. Especially, by randomizations, it is necessary to make a substantial difference in accuracy of ciphertext in eavesdropper's observation and legitimate user's observation. The quantum illumination protocol can make a difference in error performance of the legitimate's receiver and the eavesdropper's receiver. This difference is due to differences in ability of the legitimate's receiver with entanglement and the eavesdropper's receiver without entanglement. It is shown in this note that the quantum illumination can be employed as an element of the most simple quantum enigma cipher.