A secure quantum communication protocol using insecure public channels

I. Ming Tsai, Chia Mu Yu, Wei Ting Tu, Sy Yen Kuo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Due to the discovery of Shor's algorithm1, many classical crypto-systems based on the hardness of solving discrete log and factoring problem are theoretically broken in the presence of quantum computers. This means that some of the classical secret communication protocols are no longer secure and hence motivate us to find other secure crypto-systems. In this paper, we present a new quantum communication protocol which allows two parties, Alice and Bob, to exchange classical messages securely. Eavesdroppers are not able to decrypt the secret messages and will be detected if they do exist. Unlike classical crypto-systems, the security of this protocol is not based on the hardness of any unproven mathematic or algorithmic problem. Instead, it is based on the laws of nature.

Original languageEnglish
Title of host publicationSecurity and Privacy in the Age of Ubiquitous Computing - IFIP TC11 20th International Information Security Conference
EditorsSihan Qing, Eiji Okamoto, Hiroshi Yoshiura, Ryoichi Sasaki
PublisherSpringer New York LLC
Pages113-126
Number of pages14
ISBN (Print)9780387256580
DOIs
StatePublished - 2005
Externally publishedYes
EventIFIP TC11 20th International Information Security Conference, IFIP/SEC2005 - Chiba, Japan
Duration: 30 05 200501 06 2005

Publication series

NameIFIP Advances in Information and Communication Technology
Volume181
ISSN (Print)1868-4238

Conference

ConferenceIFIP TC11 20th International Information Security Conference, IFIP/SEC2005
Country/TerritoryJapan
CityChiba
Period30/05/0501/06/05

Keywords

  • Encrypted Communication
  • Quantum Cryptgraphy
  • Quantum Entanglement

Fingerprint

Dive into the research topics of 'A secure quantum communication protocol using insecure public channels'. Together they form a unique fingerprint.

Cite this