Entropically secure encryption with faster key expansion
From MaRDI portal
Recommendations
Cites work
- Approximate Randomization of Quantum States With Fewer Bits of Key
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Composing Quantum Protocols in a Classical Environment
- Entropic security in quantum cryptography
- Fast multiplication of polynomials over fields of characteristic 2
- Faster Multiplication in GF(2)[x]
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 2086703 (Why is no real title available?)
- On almost randomizing channels with a short Kraus decomposition
- On arithmetical algorithms over finite fields
- On quantum Rényi entropies: a new generalization and some properties
- Quantum Entropic Security and Approximate Quantum Encryption
- Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
- Quantum Vernam cipher
- Randomizing quantum states: constructions and applications
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Relating different quantum generalizations of the conditional Rényi entropy
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Entropically secure encryption with faster key expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492513)
