The simple ideal cipher system

Boris Ryabko

Paper 2001/046

The simple ideal cipher system

Boris Ryabko

Abstract

We address the problem of how to construct ideal cipher systems when the length of a key is much less than the length of an encrypted message. We suggest a new secret key cipher system in which firstly the message is transformed into two parts in such a way that the biggest part consists of independent and equiprobable letters. Secondly the relatively small second part is enciphered wholly by the Vernam cipher whereas only few bits from the biggest part are enciphered. This transformation is based on the fast version of the Elias construction of an unbiased random sequence. The time required for encoding and decoding and the memory size of the encoder and decoder are presented as functions of the ratio of the key length and the message length. The suggested scheme can be applied to sources with unknown statistics.

Metadata

Available format(s): PS
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: ideal cipher system fast algorithms Shannon entropy
Contact author(s): ryabko @ neic nsk su
History: 2001-06-07: received
Short URL: https://ia.cr/2001/046
License: CC BY

BibTeX

@misc{cryptoeprint:2001/046,
      author = {Boris Ryabko},
      title = {The simple ideal cipher system},
      howpublished = {Cryptology {ePrint} Archive, Paper 2001/046},
      year = {2001},
      url = {https://eprint.iacr.org/2001/046}
}