Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP |
| |
Authors: | Charles H. Bennett Gilles Brassard Seth Breidbart |
| |
Affiliation: | 1. IBM, Yorktown, NY, USA 2. Département IRO, Université de Montréal, Montreal, QC, Canada 3. CIFAR, Toronto, ON, Canada 4. Institute for Theoretical Studies, ETH Zürich, Zurich, Switzerland 5. Box 1526, New York, NY, 10268, USA
|
| |
Abstract: | When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a communications channel on which it is impossible in principle to eavesdrop without a high probability of being detected. With such a channel, a one-time pad can safely be reused many times as long as no eavesdrop is detected, and, planning ahead, part of the capacity of these uncompromised transmissions can be used to send fresh random bits with which to replace the one-time pad when an eavesdrop finally is detected. Unlike other schemes for stretching a one-time pad, this scheme does not depend on complexity-theoretic assumptions such as the difficulty of factoring. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|