Testing random number generators
WSC '92 Proceedings of the 24th conference on Winter simulation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A fast string searching algorithm
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
On Independence and Sensitivity of Statistical Randomness Tests
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Fast and space-efficient location of heavy or dense segments in run-length encoded sequences
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
Given a string x [1..n ] drawn from the alphabet {0,1}, and a rational density parameter 0 ≤ *** ≤ 1, this paper considers algorithms for finding the longest substring of x with density *** . That is, if the length of the substring is m , the number of one-bits in the substring is exactly *** ×m . It is surprisingly difficult to devise an algorithm that has worst case time less than the obvious brute-force algorithm's O (n 2). We present three new approaches to reducing the running time, and an algorithm that solves the problem in O (n logn ) expected time. We then apply the new algorithm, as well as an empirical estimate of the lim-sup and the lim-inf of a centred statistic which is expected to obey a law of the iterated logarithm, to the randomness testing of (a) the output of the BSD function Random, and (b) the output of the stream cipher Dragon. The results for these outputs warrant further study.