Paper 2021/1667
Using data compression and randomization to build an unconditionally secure short key cipher
Boris Ryabko
Abstract
We consider the problem of constructing an unconditionally secure cipher for the case when the key length is less than the length of the encrypted message. (Unconditional security means that a computationally unbounded adversary cannot obtain information about the encrypted message without the key.) In this article, we propose data compression and randomization techniques combined with entropically-secure encryption. The resulting cipher can be used for encryption in such a way that the key length does not depend on the entropy or the length of the encrypted message; instead, it is determined by the required security level.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- secret-key cryptographyinformation theoryentropic securityindistinguishabilitydata compressionShannon code
- Contact author(s)
- boris @ ryabko net
- History
- 2021-12-20: received
- Short URL
- https://ia.cr/2021/1667
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1667,
author = {Boris Ryabko},
title = {Using data compression and randomization to build an unconditionally secure short key cipher},
howpublished = {Cryptology ePrint Archive, Paper 2021/1667},
year = {2021},
note = {\url{https://eprint.iacr.org/2021/1667}},
url = {https://eprint.iacr.org/2021/1667}
}
