One-time pads without prior encounter

DOI10.1142/S0129626410000211MaRDI QIDQ6483549zbMATH OpenFDO

Authors Naya Nagy, Selim G. Akl

Publication date 29 September 2010

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129626410000211

zbMATH Keywords

one-time padsquantum cryptographyunconventional computation

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• ONE-TIME PAD CRYPTOGRAPHY
• Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
• Automata, Languages and Programming
• How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)

Cited in

(3)

• SOFSEM 2005: Theory and Practice of Computer Science
• Automata, Languages and Programming
• One-time pads cannot be used to improve the efficiency of quantum communication

This page was built for publication: One-time pads without prior encounter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6483549)