Randomness Quality and Trade-Offs for CA Random String Generators - Université Côte d'Azur Access content directly
Proceedings Year : 2023

Randomness Quality and Trade-Offs for CA Random String Generators

Abstract

We present classical theories for randomness, starting from mathematical ones to others focusing on randomness testing, more useful in computer science. Those characterisations are made by bounding the computational resources required for testing. Next, we present some suitable practical randomness testing suites designed to measure the quality of random strings that can be efficiently generated. Finally, random string generation by binary uniform cellular automata of increasing quality illustrates the improvements of the randomness testing suites.
No file

Dates and versions

hal-04361165 , version 1 (22-12-2023)

Licence

Copyright

Identifiers

Cite

Bruno Martin. Randomness Quality and Trade-Offs for CA Random String Generators. Reachability Problems, 14235, Springer Nature Switzerland, pp.3-12, 2023, Lecture Notes in Computer Science, 978-3-031-45286-4. ⟨10.1007/978-3-031-45286-4_1⟩. ⟨hal-04361165⟩
4 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More