Work

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

Year: 2021

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2112.10173

Author: Ryabko, Boris

Institutions: Novosibirsk State University, Siberian Branch of the Russian Academy of Sciences, Federal Research Center for Information and Computational Technologies

Language: English

Topic: Cryptography and Data Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Russian Foundation for Basic Research

Awards: G2934504215, G609225257

OpenAlex ID: W4225522845

Cites:

Cited by:

Related to: 10