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:quant-ph/0202021

Asymmetrical Quantum Cryptographic Algorithm

Guihua Zeng, C. Saavedra, Christoph H. Keitel

Published Feb 4, 2002• 3 citations
arXivHTMLPDF

Abstract

A cryptographic algorithm is proposed based on fully quantum mechanical keys and ciphers. Encryption and decryption are carried out via an appropriate measurement process on entangled states as governed by a quantum mechanical, asymmetrical and dynamical public key distribution. The use of public keys leads to a high availability of our scheme, while their quantum nature is shown to ensure unconditional security of the proposed algorithm.

DOI
10.48550/arxiv.quant-ph/0202021

Related papers

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

Quantum public key encryption scheme with four states key

Zhixin Liu, Qiaoling Xie, Yongfu Zha +1 more

Abstract Asymmetric encryption has some important applications in the field of communication. In classical computers, most public key encryption schemes are designed based on computational assumption. In other words, they can ensure computational security. When the computing power is large enough, it will pose a threat to these encryption schemes. We propose a quantum public key encryption scheme which based on properties of quantum physics. Our scheme realizes encryption and decryption with few resources and does not rely on any computational assumption. The key in our scheme consists of classical bits and qubits. Where the private key are classical bit and public key are qubits. The public key are generated through private key. We analyze the performance and security of the scheme. Our scheme ensures the information-theoretic secure and can be implemented easily.

Physica Scripta•Feb 22, 2022•5 citations

Quantum asymmetric key crypto scheme using Grover iteration

Chun Seok Yoon, Changho Hong, Min Sung Kang +2 more

Here, we propose a quantum asymmetric key cryptography scheme using Grover's quantum search algorithm. In the proposed scheme, Alice generates a pair of public and private keys, keeps the private keys safe, and only discloses public keys to the outside. Bob uses Alice's public key to send a secret message to Alice and Alice uses her private key to decrypt the secret message. Furthermore, we discuss the safety of quantum asymmetric key encryption techniques based on quantum mechanical properties.

Scientific Reports•Mar 7, 2023•22 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•9 citations

Quantum walk public-key cryptographic system

Chrysoula Vlachou, J. Rodrigues, Paulo Mateus +2 more

Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for quantum information processing. In this paper, we present a quantum public-key cryptographic system based on quantum walks. In particular, in the proposed protocol the public-key is given by a quantum state generated by performing a quantum walk. We show that the protocol is secure and analyze the complexity of public key generation and encryption/decryption procedures.

arXiv:1602.01404•International Journal of Quantum Information•Oct 1, 2015•47 citations

Anonymous-Key Quantum Cryptography and Unconditionally Secure Quantum Bit Commitment

Horace P. Yuen

A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocolthat does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.

arXiv:quant-ph/0009113•Kluwer Academic Publishers eBooks•Feb 24, 2006•8 citations
A cryptographic algorithm is proposed based on fully quantum mechanical keys and ciphers. Encryption and decryption are carried out via an appropriate measurement process on entangled states as governed by a quantum mechanical, asymmetrical and dynamical public key distribution. The use of public keys leads to a high availability of our scheme, while their quantum nature is shown to ensure unconditional security of the proposed algorithm.
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.
Abstract Asymmetric encryption has some important applications in the field of communication. In classical computers, most public key encryption schemes are designed based on computational assumption. In other words, they can ensure computational security. When the computing power is large enough, it will pose a threat to these encryption schemes. We propose a quantum public key encryption scheme which based on properties of quantum physics. Our scheme realizes encryption and decryption with few resources and does not rely on any computational assumption. The key in our scheme consists of classical bits and qubits. Where the private key are classical bit and public key are qubits. The public key are generated through private key. We analyze the performance and security of the scheme. Our scheme ensures the information-theoretic secure and can be implemented easily.
Here, we propose a quantum asymmetric key cryptography scheme using Grover's quantum search algorithm. In the proposed scheme, Alice generates a pair of public and private keys, keeps the private keys safe, and only discloses public keys to the outside. Bob uses Alice's public key to send a secret message to Alice and Alice uses her private key to decrypt the secret message. Furthermore, we discuss the safety of quantum asymmetric key encryption techniques based on quantum mechanical properties.
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.
Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for quantum information processing. In this paper, we present a quantum public-key cryptographic system based on quantum walks. In particular, in the proposed protocol the public-key is given by a quantum state generated by performing a quantum walk. We show that the protocol is secure and analyze the complexity of public key generation and encryption/decryption procedures.
A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocolthat does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.