Entropically secure encryption with faster key expansion
From MaRDI portal
Publication:6492513
DOI10.1007/S11128-024-04330-ZMaRDI QIDQ6492513
Publication date: 25 April 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- On almost randomizing channels with a short Kraus decomposition
- On arithmetical algorithms over finite fields
- Entropic security in quantum cryptography
- Fast multiplication of polynomials over fields of characteristic 2
- Randomizing quantum states: constructions and applications
- Relating different quantum generalizations of the conditional Rényi entropy
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Composing Quantum Protocols in a Classical Environment
- Quantum Key Recycling with 8-state encoding (The Quantum One-Time Pad is more interesting than we thought)
- Quantum Entropic Security and Approximate Quantum Encryption
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Faster Multiplication in GF(2)[x]
- On quantum Rényi entropies: A new generalization and some properties
- Approximate Randomization of Quantum States With Fewer Bits of Key
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Entropically secure encryption with faster key expansion
