A Quantum Cipher with Near Optimal Key-Recycling
From MaRDI portal
Publication:5451045
Recommendations
- How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)
- Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
- Quantum authentication with key recycling
- Quantum Vernam cipher
- Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
Cited in
(17)- How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
- Optimal attacks on qubit-based quantum key recycling
- Quantum authentication with key recycling
- Quantum reversible circuit of AES-128
- Quantum cryptography beyond quantum key distribution
- Quantum mutual implicit authentication key agreement protocol without entanglement with key recycling
- Quantum key evolution and its applications
- Block encryption of quantum messages
- Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
- Quantum ciphertext authentication and key recycling with the trap code
- Advances in Cryptology - EUROCRYPT 2004
- Study on the security of the authentication scheme with key recycling in QKD
- Two-way unclonable encryption with a vulnerable sender
- Quantum Vernam cipher
- Quantum stream ciphers: impossibility of unconditionally strong algorithms
- Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
This page was built for publication: A Quantum Cipher with Near Optimal Key-Recycling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451045)
