Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation

DOI10.1016/j.tcs.2021.12.006OpenAlexW4200404846MaRDI QIDQ2067627

Guillermo Sosa-Gómez, Yuniel Matos-Rodríguez, Carlos Miguel Legón-Pérez, Omar Rojas, Evaristo José Madarro-Capó

Publication date: 18 January 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.12.006

zbMATH Keywords

cryptographylaw of the iterated logarithmPRNGLIL testrandomness statistical test

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Resource bounded randomness and computational complexity
• Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
• Randomness? What randomness?
• Seedless fruit is the sweetest: random number generation, revisited
• On testing pseudorandom generators via statistical tests based on the arcsine law
• A survey on true random number generators based on chaos
• The law of iterated logarithm for subordinated Gaussian sequences: uniform Wasserstein bounds