Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP

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 eavesd...

Full description

Saved in:
Bibliographic Details
Published in:Natural computing 2014-12, Vol.13 (4), p.453-458
Main Authors: Bennett, Charles H., Brassard, Gilles, Breidbart, Seth
Format: Article
Language:English
Subjects:
Artificial Intelligence
Atoms & subatomic particles
Channels
Complex Systems
Computer Science
Computers
Cryptography
Digital
Evolutionary Biology
Photons
Processor Architectures
Quantum cryptography
Quantum physics
Quantum theory
Stretching
Theory of Computation
Uncertainty
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1567-7818
1572-9796
DOI:10.1007/s11047-014-9453-6