DocumentCode
3048551
Title
On quantum authentication protocols
Author
Kanamori, Yoshito ; Yoo, Seong-Moo ; Gregory, Don A. ; Sheldon, Frederick T.
Author_Institution
Dept. of Electr. & Comput. Eng., Alabama Univ., Huntsville, AL, USA
Volume
3
fYear
2005
fDate
28 Nov.-2 Dec. 2005
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.
Keywords
computer networks; message authentication; protocols; quantum cryptography; quantum entanglement; RSA encryption; polynomial-time; quantum authentication protocols; quantum computers; quantum superposition states; sharing quantum entangled particles; unconditional security; Authentication; Computer networks; Cryptographic protocols; Cryptography; Physics computing; Polarization; Polynomials; Quantum computing; Quantum entanglement; Quantum mechanics;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE
Print_ISBN
0-7803-9414-3
Type
conf
DOI
10.1109/GLOCOM.2005.1577930
Filename
1577930
Link To Document