A secure quantum communication protocol using insecure public channels

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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. Copyright © 2005 by International Federation for Information Processing.

Cite

CITATION STYLE

APA

Tsai, I. M., Yu, C. M., Tu, W. T., & Kuo, S. Y. (2005). A secure quantum communication protocol using insecure public channels. In IFIP Advances in Information and Communication Technology (Vol. 181, pp. 113–126). Springer New York LLC. https://doi.org/10.1007/0-387-25660-1_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free