5 citations · 12 across the 17 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CR2023
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…
cs.CR2023
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…