Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Wald-Wolfowitz Runs Test II01:17

Wald-Wolfowitz Runs Test II

251
The Wald-Wolfowitz runs test, commonly referred to as the runs test, is a nonparametric test used to assess the randomness of ordered data. The test evaluates the number of runs, which are consecutive sequences of similar elements within the data. If the number of runs is significantly higher or lower than expected, the data is considered non-random, indicating a detectable pattern or structure.
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
251
Censoring Survival Data01:09

Censoring Survival Data

108
Survival analysis is a statistical method used to analyze time-to-event data, often employed in fields such as medicine, engineering, and social sciences. One of the key challenges in survival analysis is dealing with incomplete data, a phenomenon known as "censoring." Censoring occurs when the event of interest (such as death, relapse, or system failure) has not occurred for some individuals by the end of the study period or is otherwise unobservable, and it might have many different...
108
Chebyshev's Theorem to Interpret Standard Deviation01:15

Chebyshev's Theorem to Interpret Standard Deviation

4.2K
Chebyshev’s theorem, also known as Chebyshev’s Inequality, states that the proportion of values of a dataset for K standard deviation is calculated using the equation:
4.2K
Estimating Population Mean with Unknown Standard Deviation01:22

Estimating Population Mean with Unknown Standard Deviation

7.9K
In practice, we rarely know the population standard deviation. In the past, when the sample size was large, this did not present a problem to statisticians. They used the sample standard deviation s as an estimate for σ and proceeded as before to calculate a confidence interval with close enough results. However, statisticians ran into problems when the sample size was small. A small sample size caused inaccuracies in the confidence interval.
William S. Gosset (1876–1937) of the...
7.9K
Unusual Results01:16

Unusual Results

3.2K
Unusual results are those that have a very low chance of occurring. Unusual results can be identified using probabilities and the range rule of thumb. In problems involving probability, unusual results can be observed in 2 instances – an unusually high number of successes or an unusually low number of successes.
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 =...
3.2K
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

704
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
704

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The Amount of Data Required to Recognize a Writer's Style Is Consistent Across Different Languages of the World.

Entropy (Basel, Switzerland)·2025
Same author

Building Test Batteries Based on Analyzing Random Number Generator Tests within the Framework of Algorithmic Information Theory.

Entropy (Basel, Switzerland)·2024
Same author

Information-Theoretic Method for Assessing the Quality of Translations.

Entropy (Basel, Switzerland)·2022
Same author

Using Data Compression to Build a Method for Statistically Verified Attribution of Literary Texts.

Entropy (Basel, Switzerland)·2021
Same author

Time-Adaptive Statistical Test for Random Number Generators.

Entropy (Basel, Switzerland)·2020
Same author

Using the Data-Compression Method for Studying Hunting Behavior in Small Mammals.

Entropy (Basel, Switzerland)·2020
Same journal

Research on a Regional Availability Evaluation Model for Road-Area High-Entropy Energy Based on Synergy Factors.

Entropy (Basel, Switzerland)·2026
Same journal

Atmospheric Turbulence Channel Modeling and Performance Analysis of a CO-ZP-OFDM Coherent Optical Communication System for UAV Air-to-Ground Scenarios.

Entropy (Basel, Switzerland)·2026
Same journal

Information Geometry and Asymptotic Theory for SMML Estimators.

Entropy (Basel, Switzerland)·2026
Same journal

Correlation Entropy and Power-Law Kinetics.

Entropy (Basel, Switzerland)·2026
Same journal

Research on the Contagion of Systemic Financial Risk Under the Impact of Climate Risks-From the Perspective of Complex Networks and Machine Learning.

Entropy (Basel, Switzerland)·2026
Same journal

The Statistical-Mechanical Meaning of the Wave Function of Quantum Mechanics.

Entropy (Basel, Switzerland)·2026
See all related articles

Related Experiment Video

Updated: Jul 12, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

590

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.

Entropy (Basel, Switzerland)
|October 28, 2023
PubMed
Summary
This summary is machine-generated.

This study introduces a new unconditionally secure cipher using a short key, even when message statistics are unknown. This provides robust data protection for diverse language sources, like all European Union languages.

Keywords:
cryptographydata compressionentropically-secure symmetric encryption schemeindistinguishabilityunconditionally secure cipheruniversal code

More Related Videos

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
09:23

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators

Published on: May 30, 2014

14.6K
Design and Analysis for Fall Detection System Simplification
08:05

Design and Analysis for Fall Detection System Simplification

Published on: April 6, 2020

10.7K

Related Experiment Videos

Last Updated: Jul 12, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

590
Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
09:23

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators

Published on: May 30, 2014

14.6K
Design and Analysis for Fall Detection System Simplification
08:05

Design and Analysis for Fall Detection System Simplification

Published on: April 6, 2020

10.7K

Area of Science:

  • Cryptography and Information Security
  • Theoretical Computer Science

Background:

  • Unconditional security in cryptography ensures negligible information leakage to adversaries, regardless of their computational power.
  • Existing cryptographic methods often rely on assumptions about message source statistics, limiting their applicability.
  • Handling unknown or partially known message distributions is a significant challenge in secure communication.

Purpose of the Study:

  • To develop an unconditionally secure cipher suitable for scenarios with unknown message probability distributions.
  • To design a cipher that utilizes a short key for practical implementation.
  • To address the challenge of encrypting data from sources with a priori unknown statistics, such as multilingual text.

Main Methods:

  • The study focuses on theoretical construction of cryptographic primitives.
  • It explores methods for achieving security guarantees even when the message source's probability distribution is not precisely known.
  • The proposed cipher is designed to be applicable to a family of probability distributions.

Main Results:

  • A novel unconditionally secure cipher has been constructed.
  • The cipher is designed to work with a short key.
  • It provides security guarantees for message sources where the probability distribution is unknown but belongs to a specified family.

Conclusions:

  • The proposed cipher offers a practical solution for unconditionally secure communication in diverse and uncertain data environments.
  • This advancement is particularly relevant for applications involving multiple languages or varied data sources.
  • The work contributes to the field of cryptography by extending unconditional security to scenarios with unknown source statistics.