Related Experiment Video
Updated: Jul 12, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Unconditionally Secure Ciphers with a Short Key for a Source with Unknown Statistics
Boris Ryabko1,2
1Federal Research Center for Information and Computational Technologies, Novosibirsk 630090, Russia.
Abstract:
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 that unconditional security means that an adversary with no computational constraints can only obtain a negligible amount of information ("leakage") about an encrypted message (without knowing the key). Here, we consider the case of a priori (partially) unknown message source statistics. More specifically, the message source probability distribution belongs to a given family of distributions. We propose an unconditionally secure cipher for this case. As an example, one can consider constructing a single cipher for texts written in any of the languages of the European Union. That is, the message to be encrypted could be written in any of these languages.
Related Concept Videos
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
Censoring Survival Data
Chebyshev's Theorem to Interpret Standard Deviation
Estimating Population Mean with Unknown Standard Deviation
William S. Gosset (1876–1937) of the...
Unusual Results
According to the range rule of thumb, any value above or below two standard deviations, 2σ from the mean, μ is considered unusual.
Maximum unusual value =...
Propagation of Uncertainty from Random Error

