Applicability Criterion of the Non Overlapping Template Matching Algorithm from NIST Statistical Test Suite SP800-22 for Long Aperiodic Patterns
摘要
The paper presents the problem of testing the randomness of bit strings in a pattern search using the Non Overlapping Template Matching algorithm. Presented problem arises when using long aperiodic patterns resulting in false-positive scores rejecting the generator as non-random. The paper proposes an additional criterion for the applicability of the algorithm, which allows to evade discussed problem.