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.
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.
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.
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.
Quantum key distribution (QKD) is an innovative solution in the cryptography world to prevent the information leakage that can sometimes be deliberate. Several QKD protocols were recently presented for building a secure shared key, of which the BB84 protocol is one of those interesting protocols. The authentication between the communicating parties is one of the issues that cause a huge argument. Furthermore, the current well-known QKD protocols are not yet ready to realize the personality of either the sender or the receiver, although the QKD protocol is already protected by the rules of physics and quantum mechanics to detect any interruption. This paper introduces a new QKD protocol that utilizes two quantum channels to provide authenticated communications for legitimate parties. Moreover, the proposed QKD protocol uses two type of physical behaviors, entanglement and superposition states. The entangled states are utilized to confirm the authentication between the end users, while the superposition states carry the secret key that will be shared between the users.
Post-quantum cryptography studies the security of classical, i.e. non-quantum cryptographic protocols against quantum attacks. Until recently, the considered adversaries were assumed to use quantum computers and behave like classical adversaries otherwise. A more conservative approach is to assume that also the communication between the honest parties and the adversary is (partly) quantum. We discuss several options to define secure encryption and authentication against these stronger adversaries who can carry out 'superposition attacks'. We re-prove a recent result of Boneh and Zhandry, stating that a uniformly random function (and hence also a quantum-secure pseudorandom function) can serve as a message-authentication code which is secure, even if the adversary can evaluate this function in superposition.
Cryptographic world has faced multiple challenges that are included in encoding and decoding transmitting information into a secure communication channel. Quantum cryptography may be another generation of the cryptography world, which is based on the law of physics. After decades of using the classical cryptography, there is an essential need to move a step forward through the most trusted systems, especially enormous amount of data flows through billions of communicating channels (e.g. The internet), and keeping this transmitting information away from eavesdropping is obligatory. Moreover, quantum cryptography has proved its standing against many weaknesses in the classical cryptography. One of these weaknesses is the ability to copy any type of information using a passive attack without an interruption, which is impossible in the quantum system. Theoretically, several quantum observables are utilized to diagnose an action of one particle. These observables are included in measuring mass, movement, speed, etc. The polarization of one photon occurs normally and randomly in the space. Any interruption that happens during sending of a light will cause a deconstruction of the light polarization. Therefore, particles’ movement in a three-dimensional space is supported by Non-Cloning theory that makes eavesdroppers unable to interrupt a communication system. In case an eavesdropper tried to interrupt a photon, the photon will be destroyed after passing the photon into a quantum detector or any measurement device. In the last decades, many Quantum Key Distribution (QKD) protocols have been created to initiate a secret key during encoding and decoding transmitted data operations. Some of these protocols were proven un-secure based on the quantum attacks that were released early. Even though the power of physics is still active and the Non-Cloning theory is unbroken, some QKD protocols failed during the security measurements. The main reason of the failure is based on the inability to provide the authentication between the end users during the quantum and classical channels. The proposed QKD protocol was designed to utilize some advantages of quantum physics as well as solid functions that are used in the classical cryptography. The authentication is a requirement during different communication channels, where both legitimate parties must confirm their identities before starting to submit data (plain-text). Moreover, the protocol uses most needed scenarios to finish the communication without leaking important data. These scenarios have been approved in existing QKD protocols either by classical or quantum systems. The matrix techniques also are used as a part of the preparation of the authentication key, where the end users communicate by an EPR (related to Einstein, Podolsky, and Rosen theory in 1935) channel. The EPR channel will be supported by an entanglement of particles. If the EPR communication succeeded, transferring the converted plain-text is required. Finally, both end users will have an authenticated secret key, and the submission will be done without any interruption.
A novel approach to secure data transmission, quantum communication draws on fundamental principles of quantum physics. It ensures that the transmitted information is private and accurate. To provide security, quantum networks implement physical constraints such as the no-cloning rule and quantum entanglement. In contrast, computational complexity is employed by classical networks. However, with the proliferation of multiuser quantum networks, identity verification has become more challenging. People with malicious intentions might easily disrupt services in long-distance quantum networks by impersonating legitimate nodes and sharing entangled resources and quantum channels. This highlights the absolute necessity of secure authentication systems tailored to quantum environments. Enhancements to recent quantum authentication systems have been made utilizing techniques that are resistant to quantum computing. Researchers are looking into quantum digital signatures, entanglement-assisted protocols, and quantum key distribution (QKD) authentication to make multi-party communications more secure. In order to prevent attacks where a user establishes a fraudulent identity or account, these strategies can be applied to quantum networks. This study takes a look at current quantum authentication systems and gives them the once-over, focusing on how well they could handle multiple users. The article delves into the evolution of authentication systems to accommodate the distributed model, where nodes can function as senders, receivers, or relays. We aim to strike a compromise between practicality and security in our lightweight, low-latency protocols. Additionally, the paper discusses quantum-specific issues, such as side-channel attacks and device malfunctions, and how authentication techniques can help prevent them. Finally, this study demonstrates that authentication is the critical component of secure quantum communication for multiple users. The most secure quantum key distribution methods are still vulnerable to attacks from inside or outside the system if proper authentication is not in place.