On the Power of Quantum Encryption Keys
From MaRDI portal
Publication:3535360
DOI10.1007/978-3-540-88403-3_12zbMath1177.94153arXiv0808.2869OpenAlexW1614033707MaRDI QIDQ3535360
Christopher Portmann, Akinori Kawachi
Publication date: 11 November 2008
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.2869
Related Items (3)
Bit-oriented quantum public-key encryption based on quantum perfect encryption ⋮ Block encryption of quantum messages ⋮ Computational indistinguishability between quantum states and its cryptographic application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational indistinguishability between quantum states and its cryptographic application
- Randomizing quantum states: constructions and applications
- Continuity of quantum conditional information
- How Many Copies are Needed for State Discrimination?
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Computational Indistinguishability Between Quantum States and Its Cryptographic Application
- Approximate Randomization of Quantum States With Fewer Bits of Key
This page was built for publication: On the Power of Quantum Encryption Keys