44 citations · 69 across the 30 of their papers we have counts for
36 papers
Reduction of the secret key length in the perfect cipher by data compression and randomisation
Boris Ryabko
Perfect ciphers have been a very attractive cryptographic tool ever since C. Shannon described them. Note that, by definition, if a perfect cipher is used, no one can get any infor…
Unconditionally secure ciphers with a short key for a source with unknown statistics
Boris Ryabko
We consider the problem of constructing an unconditionally secure cipher with a short key for the case where the probability distribution of encrypted messages is unknown. Note tha…
Entropically secure cipher for messages generated by Markov chains with unknown statistics
Boris Ryabko
In 2002, Russell and Wang proposed a definition of entropically security that was developed within the framework of secret key cryptography. An entropically-secure system is uncond…
Using data compression and randomization to build an unconditionally secure short key cipher
Boris Ryabko
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…
Fast direct access to variable length codes
Boris Ryabko
We consider the issue of direct access to any letter of a sequence encoded with a variable length code and stored in the computer's memory, which is a special case of the random ac…
Calibrating random number generator tests
Boris Ryabko
Currently, statistical tests for random number generators (RNGs) are widely used in practice, and some of them are even included in information security standards. But despite the…