Abstract
A new statistical test for randomness, the SAC test, is presented, together with its results over some well-known generators in the literature. These results are analyzed and some possible applications of the test, as for measuring the strength of cryptographic primitives including block ciphers, stream ciphers and pseudorandom number generators, especially during the design and analysis phase, are detailed. Finally, the source code for the SAC test is provided, which proves some of its other advantages: it is easy to implement, and very fast so well-suited for practical applications. © Springer-Verlag 2004.
Cite
CITATION STYLE
Hernandez, J. C., Sierra, J. M., & Seznec, A. (2004). The SAC test: A new randomness test, with some applications to PRNG analysis. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3043, 960–967. https://doi.org/10.1007/978-3-540-24707-4_108
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
