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.0451OpenAlexW3125254270WikidataQ40235134 ScholiaQ40235134MaRDI QIDQ268457

Seth Breidbart, Gilles Brassard, 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

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (12)

How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\) ⋮ Experimental quantum cryptography. ⋮ Two-way unclonable encryption with a vulnerable sender ⋮ Quantum key distribution scheme with key recycling in integrated optical network ⋮ Quantum cryptography beyond quantum key distribution ⋮ Optimal attacks on qubit-based quantum key recycling ⋮ Quantum cryptography ⋮ Preface ⋮ Preface ⋮ Quantum data locking for high-rate private communication ⋮ Quantum Authentication and Encryption with Key Recycling ⋮ Quantum Authentication with Key Recycling

Cites Work

• Unnamed Item
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A single quantum cannot be cloned

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