Randomness quality and trade-offs for CA random string generators

DOI10.1007/978-3-031-45286-4_1MaRDI QIDQ6623008

Bruno Martin

Publication date: 23 October 2024

zbMATH Keywords

Boolean functionsrandom number generationpseudo-randomnessrandomness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
• Probabilistic encryption
• Random sequence generation by cellular automata
• The mathematics community and the NSA: encryption and the NSA role in international standards
• Advances on Random Sequence Generation by Uniform Cellular Automata
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A spectral characterization of correlation-immune combining functions
• The definition of random sequences
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Randomness quality and trade-offs for CA random string generators

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