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

Scientific Reports

Quantum asymmetric key crypto scheme using Grover iteration

Chun Seok Yoon, Changho Hong, Min Sung Kang, Ji-Woong Choi, Hyung-Jin Yang

Published Mar 7, 2023• 19 citations
Publisher

Abstract

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.

DOI
10.1038/s41598-023-30860-0

Related papers

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

A novel quantum asymmetric key encryption scheme based on exact quantum search algorithm

Shi-Jin Zhong, Jin-Huan Li, Ying-Nan Zhao +2 more

Abstract The quantum asymmetric key encryption (QAKE) is a prominent research frontier in quantum information. In this paper, we propose a quantum asymmetric key encryption scheme based on the exact quantum search algorithm (QAKE-EQSA). Leveraging EQSA’s deterministic amplitude amplification and a unique three-oracle structure, comprising an auxiliary oracle, its inverse, and a message-dependent oracle, the proposed QAKE-EQSA scheme guarantees a 100% decryption success rate. Within the scheme, the public key is generated by applying the auxiliary oracle to a specific quantum superposition state and subsequently shared via a public key center; the private key is constructed using a phase-matching diffusion operator; and the message is encoded into a unique target state within the search space, ensuring that only the legitimate receiver can recover it exactly. Furthermore, we demonstrate a 4-qubit instantiation of the QAKE-EQSA scheme on the MindQuantum platform and conduct a comprehensive analysis encompassing its security, qubit efficiency, and practical performance. Our analysis demonstrates that, in comparison to several existing QPKE schemes, the proposed QAKE-EQSA scheme achieves exact decryption, optimal qubit efficiency, and enhanced resistance against quantum attacks.

Chinese Physics B•May 11, 2026•0 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

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•4 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

Quantum Digital Signatures

Daniel Gottesman, Isaac L. Chuang

We present a quantum digital signature scheme whose security is based on fundamental principles of quantum physics. It allows a sender (Alice) to sign a message in such a way that the signature can be validated by a number of different people, and all will agree either that the message came from Alice or that it has been tampered with. To accomplish this task, each recipient of the message must have a copy of Alice's "public key," which is a set of quantum states whose exact identity is known only to Alice. Quantum public keys are more difficult to deal with than classical public keys: for instance, only a limited number of copies can be in circulation, or the scheme becomes insecure. However, in exchange for this price, we achieve unconditionally secure digital signatures. Sending an m-bit message uses up O(m) quantum bits for each recipient of the public key. We briefly discuss how to securely distribute quantum public keys, and show the signature scheme is absolutely secure using one method of key distribution. The protocol provides a model for importing the ideas of classical public key cryptography into the quantum world.

arXiv:quant-ph/0105032•May 8, 2001•175 citations
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.
Abstract The quantum asymmetric key encryption (QAKE) is a prominent research frontier in quantum information. In this paper, we propose a quantum asymmetric key encryption scheme based on the exact quantum search algorithm (QAKE-EQSA). Leveraging EQSA’s deterministic amplitude amplification and a unique three-oracle structure, comprising an auxiliary oracle, its inverse, and a message-dependent oracle, the proposed QAKE-EQSA scheme guarantees a 100% decryption success rate. Within the scheme, the public key is generated by applying the auxiliary oracle to a specific quantum superposition state and subsequently shared via a public key center; the private key is constructed using a phase-matching diffusion operator; and the message is encoded into a unique target state within the search space, ensuring that only the legitimate receiver can recover it exactly. Furthermore, we demonstrate a 4-qubit instantiation of the QAKE-EQSA scheme on the MindQuantum platform and conduct a comprehensive analysis encompassing its security, qubit efficiency, and practical performance. Our analysis demonstrates that, in comparison to several existing QPKE schemes, the proposed QAKE-EQSA scheme achieves exact decryption, optimal qubit efficiency, and enhanced resistance against quantum attacks.
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.
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.
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.
We present a quantum digital signature scheme whose security is based on fundamental principles of quantum physics. It allows a sender (Alice) to sign a message in such a way that the signature can be validated by a number of different people, and all will agree either that the message came from Alice or that it has been tampered with. To accomplish this task, each recipient of the message must have a copy of Alice's "public key," which is a set of quantum states whose exact identity is known only to Alice. Quantum public keys are more difficult to deal with than classical public keys: for instance, only a limited number of copies can be in circulation, or the scheme becomes insecure. However, in exchange for this price, we achieve unconditionally secure digital signatures. Sending an m-bit message uses up O(m) quantum bits for each recipient of the public key. We briefly discuss how to securely distribute quantum public keys, and show the signature scheme is absolutely secure using one method of key distribution. The protocol provides a model for importing the ideas of classical public key cryptography into the quantum world.