IntroductionThe minimum size of the sequence we analyze is 1 Mbyte and up to 256 Mbytes. Those tests were not originally written for analyzing such huge sequences of random numbers. Therefore, some performance gaps were encountered. Many tests were too CPU hungry and memory hungry to be run in a reasonable time ( a few minutes for 1 Mbyte). We adapted those tests to run faster and with using less memory when possible. When despites our efforts, the response time was still too large, we run the test on a few "randomly" chosen subsequences.
We describe our usage of each of the tests.
Test 1 (Frequency test ), Test 2
(Block Frequency test ), Test 3 (Runs test), Test 14 ( Cumulative Sums)
Test 4 (Longest runs tests)
Test 5: Binary matrix rank test
Test 6: Discrete Fourier transfom
Test 7: Non Overlapping
Template Matching
Test 8 (Overlapping
Template Matching), Test 10 ( Lempel-Ziv compression ), Test 12 (serial
test , m=14) , Test 15 (Random Excursion) , Test 16 (Random
Excursion Variant)
Test 9 : Maurer's Universal
Tests
Test 11: Linear Complexity
Test 13 : Approximate Entropy