Using data compression and randomization to build an unconditionally secure short key cipher

TL;DR

This paper introduces a novel unconditionally secure cipher that uses data compression and randomization, enabling secure encryption with a key length independent of message size, based solely on desired security level.

Contribution

It presents a new method combining data compression, randomization, and entropically-secure encryption to achieve unconditional security with short keys regardless of message length.

Findings

Key length is independent of message size or entropy.

The cipher guarantees security against unbounded adversaries.

The approach effectively balances security level and key size.

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.