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

Globecom

On quantum authentication protocols

Yoshito Kanamori, Seong-Moo Yoo, Don A. Gregory, Frederick T. Sheldon

Published Jan 1, 2005• 23 citations
Publisher

Abstract

When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.

DOI
10.1109/glocom.2005.1577930

Related papers

Authentication Protocol Using Quantum Superposition States

Yoshito Kanamori, Seong-Moo Yoo, Don A. Gregory +1 more

When it became known that quantum computers could break the RSA (named for its creators – Rivest, Shamir, and Adleman) encryption algorithm within a polynomialtime, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.

International journal of network security•Jan 1, 2009•24 citations

Quantum encryption and authentication protocols

Seong-Moo Yoo, Yoshito Kanamori

The demands for secure communication systems have been growing rapidly as technologies in computer networks advance. However, classical cryptography employed in network systems is only secure when malicious users do not have enough computational power to break the security in a practical amount of time. Quantum cryptography provides theoretically unbreakable security since its security relies on quantum mechanical properties. This dissertation resolves the weakness of classical cryptography in computer networks by developing novel cryptographic schemes. First, a new encryption scheme, quantum commutative encryption (QCE), has been developed by utilizing quantum superposition states. The analysis of possible attacks to the developed encryption scheme, the advantages of the developed scheme, and the requirements to utilize the developed scheme in a communication system are presented. Also, an example of realization with current technologies is shown. Considering all the characteristics of the developed encryption scheme, a key distribution protocol, two authentication protocols, secret sharing scheme, and the possible practical application of the secret sharing scheme are designed by making use of the developed encryption scheme. This dissertation also discusses the security analysis for each developed scheme. All developed quantum cryptographic schemes are theoretically unbreakable and can be realized with current technologies. The main contributions of this dissertation are not only the proposal of novel schemes, but also a demonstration of how quantum mechanical properties can be utilized in computer engineering/science.

•Jan 1, 2006•3 citations

An Exploration to the Quantum Cryptography Technology

Harshita Jasoliya, Kaushal Arvindbhai Shah

The security of our data is the prime priority as it is said “Data is the new Oil”. Nowadays, most of our communications are either recorded or forged. There are algorithms used under classical encryption, such as Rivest-Shamir-Adleman (RSA), digital signature, elliptic-curve cryptography (ECC), and more, to protect our communication and data. However, these algorithms are breakable with the help of Quantum Cryptography. In addition, this technology provides the most secure form of communication between entities under the fundamental law of Physics. Here, we are abiding to discuss the term “Quantum Cryptography.” The aim of this paper is to explore the knowledge related to the Quantum Cryptography, Quantum Key Distribution; and their elements, implementation, and the latest research. Moreover, exploration of the loopholes and the security of Internet of Things (IoT) infrastructure and current used classical cryptographic algorithms are described in the paper.

International Conference on Computing for Sustainable Global Development•Mar 23, 2022•15 citations

Unconditionally Secure Quantum Signatures

Ryan Amiri, Erika Andersson

Signature schemes, proposed in 1976 by Diffie and Hellman, have become ubiquitous across modern communications. They allow for the exchange of messages from one sender to multiple recipients, with the guarantees that messages cannot be forged or tampered with and that messages also can be forwarded from one recipient to another without compromising their validity. Signatures are different from, but no less important than encryption, which ensures the privacy of a message. Commonly used signature protocols—signatures based on the Rivest–Adleman–Shamir (RSA) algorithm, the digital signature algorithm (DSA), and the elliptic curve digital signature algorithm (ECDSA)—are only computationally secure, similar to public key encryption methods. In fact, since these rely on the difficulty of finding discrete logarithms or factoring large primes, it is known that they will become completely insecure with the emergence of quantum computers. We may therefore see a shift towards signature protocols that will remain secure even in a post-quantum world. Ideally, such schemes would provide unconditional or information-theoretic security. In this paper, we aim to provide an accessible and comprehensive review of existing unconditionally securesecure signature schemes for signing classical messages, with a focus on unconditionally secure quantum signature schemes.

arXiv:1508.01893•Entropy•Aug 4, 2015•51 citations

Quantum Cryptography: A Novel Approach to Secure Communications

Dr. Emily Chen

Quantum cryptography represents a revolutionary paradigm shift in secure communication by leveraging the principles of quantum mechanics to guarantee unbreakable encryption. Unlike classical cryptographic methods dependent on computational hardness, quantum cryptography exploits quantum phenomena such as superposition and entanglement to provide provable security against eavesdropping. This paper explores fundamental quantum cryptographic protocols, their operational principles, and recent advances that enable practical deployment. We further discuss challenges, implementation issues, and the future scope of quantum key distribution (QKD) technologies in securing global communication infrastructures

American Journal Of Cryptography And Network Security•Jun 30, 2024•0 citations

Quantum authentication protocol

Guihua Zeng, Guang-Can Guo

In this letter, we proposed a quantum authentication protocol. The authentication process is implemented by the symmetric cryptographic scheme with quantum effects.

arXiv:quant-ph/0001046•Jan 13, 2000•10 citations
When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.
When it became known that quantum computers could break the RSA (named for its creators – Rivest, Shamir, and Adleman) encryption algorithm within a polynomialtime, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.
The demands for secure communication systems have been growing rapidly as technologies in computer networks advance. However, classical cryptography employed in network systems is only secure when malicious users do not have enough computational power to break the security in a practical amount of time. Quantum cryptography provides theoretically unbreakable security since its security relies on quantum mechanical properties. This dissertation resolves the weakness of classical cryptography in computer networks by developing novel cryptographic schemes. First, a new encryption scheme, quantum commutative encryption (QCE), has been developed by utilizing quantum superposition states. The analysis of possible attacks to the developed encryption scheme, the advantages of the developed scheme, and the requirements to utilize the developed scheme in a communication system are presented. Also, an example of realization with current technologies is shown. Considering all the characteristics of the developed encryption scheme, a key distribution protocol, two authentication protocols, secret sharing scheme, and the possible practical application of the secret sharing scheme are designed by making use of the developed encryption scheme. This dissertation also discusses the security analysis for each developed scheme. All developed quantum cryptographic schemes are theoretically unbreakable and can be realized with current technologies. The main contributions of this dissertation are not only the proposal of novel schemes, but also a demonstration of how quantum mechanical properties can be utilized in computer engineering/science.
The security of our data is the prime priority as it is said “Data is the new Oil”. Nowadays, most of our communications are either recorded or forged. There are algorithms used under classical encryption, such as Rivest-Shamir-Adleman (RSA), digital signature, elliptic-curve cryptography (ECC), and more, to protect our communication and data. However, these algorithms are breakable with the help of Quantum Cryptography. In addition, this technology provides the most secure form of communication between entities under the fundamental law of Physics. Here, we are abiding to discuss the term “Quantum Cryptography.” The aim of this paper is to explore the knowledge related to the Quantum Cryptography, Quantum Key Distribution; and their elements, implementation, and the latest research. Moreover, exploration of the loopholes and the security of Internet of Things (IoT) infrastructure and current used classical cryptographic algorithms are described in the paper.
Signature schemes, proposed in 1976 by Diffie and Hellman, have become ubiquitous across modern communications. They allow for the exchange of messages from one sender to multiple recipients, with the guarantees that messages cannot be forged or tampered with and that messages also can be forwarded from one recipient to another without compromising their validity. Signatures are different from, but no less important than encryption, which ensures the privacy of a message. Commonly used signature protocols—signatures based on the Rivest–Adleman–Shamir (RSA) algorithm, the digital signature algorithm (DSA), and the elliptic curve digital signature algorithm (ECDSA)—are only computationally secure, similar to public key encryption methods. In fact, since these rely on the difficulty of finding discrete logarithms or factoring large primes, it is known that they will become completely insecure with the emergence of quantum computers. We may therefore see a shift towards signature protocols that will remain secure even in a post-quantum world. Ideally, such schemes would provide unconditional or information-theoretic security. In this paper, we aim to provide an accessible and comprehensive review of existing unconditionally securesecure signature schemes for signing classical messages, with a focus on unconditionally secure quantum signature schemes.
Quantum cryptography represents a revolutionary paradigm shift in secure communication by leveraging the principles of quantum mechanics to guarantee unbreakable encryption. Unlike classical cryptographic methods dependent on computational hardness, quantum cryptography exploits quantum phenomena such as superposition and entanglement to provide provable security against eavesdropping. This paper explores fundamental quantum cryptographic protocols, their operational principles, and recent advances that enable practical deployment. We further discuss challenges, implementation issues, and the future scope of quantum key distribution (QKD) technologies in securing global communication infrastructures