Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)

DOI10.1007/s11047-014-9453-6zbMath1404.81083arXiv1407.0451WikidataQ40235134 ScholiaQ40235134MaRDI QIDQ268457

Gilles Brassard, Seth Breidbart, Charles H. Bennett

Publication date: 15 April 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.0451

Mathematics Subject Classification ID

94A60: Cryptography

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

81P94: Quantum cryptography (quantum-theoretic aspects)

Related Items

Experimental quantum cryptography.