Achievable Key Rates for Universal Simulation of Random Data With Respect to a Set of Statistical Tests

DOI10.1109/TIT.2003.821994MaRDI QIDQ3547372zbMATH OpenOpenAlexFDO

Authors Neri Merhav

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2003.821994

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Statistical aspects of information-theoretic topics (62B10) Random number generation in numerical analysis (65C10) Characterization and structure theory of statistical distributions (62E10) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• A universal statistical test for random bit generators
• scientific article; zbMATH DE number 503266
• Information Security
• Statistical randomized encodings: a complexity theoretic view
• A new test for randomness and its application to some cryptographic problems
• Secure non-interactive simulation from arbitrary joint distributions
• On the pass rate of NIST statistical test suite for randomness
• Kolmogorov complexity, pseudorandom generators and statistical models testing.
• scientific article; zbMATH DE number 1980972

Cited in

(3)

• Sharp entropy bounds for discrete statistical simulation
• Universal Delay-Limited Simulation
• On Universal Simulation of Information Sources Using Training Data

This page was built for publication: Achievable Key Rates for Universal Simulation of Random Data With Respect to a Set of Statistical Tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547372)