Entropically secure encryption with faster key expansion
arXiv:2201.00188 · doi:10.1007/s11128-024-04330-z
Abstract
Entropically secure encryption is a way to encrypt a large plaintext with a small key and still have information-theoretic security, thus in a certain sense circumventing Shannon's result that perfect encryption requires the key to be at least as long as the entropy of the plaintext. Entropically secure encryption is not perfect, and it works only if a lower bound is known on the entropy of the plaintext. The typical implementation is to expand the short key to the size of the plaintext, e.g. by multiplication with a public random string, and then use one-time pad encryption. This works in the classical as well as the quantum setting. In this paper, we introduce a new key expansion method that is faster than existing ones. We prove that it achieves the same security. The speed gain is most notable when the key length is a sizeable fraction of the message length. In particular, a factor of 2 is gained in the case of approximate randomization of quantum states.
References in corpus (9)
- On quantum Renyi entropies: a new generalization and some properties
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Randomizing quantum states: Constructions and applications
- Optimal Encryption of Quantum Bits
- Relating different quantum generalizations of the conditional Renyi entropy
- On almost randomizing channels with a short Kraus decomposition
- Approximate Randomization of Quantum States With Fewer Bits of Key
- Quantum entropic security and approximate quantum encryption
- A new class of irreducible pentanomials for polynomial based multipliers in binary fields