Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
13431043 | Discrete Applied Mathematics | 2019 | 14 Pages |
Abstract
In this work, we classify all templates according to their periods and for each template we evaluate the exact probabilities using generating functions. Afterwards, we propose a new family of statistical randomness tests, that is periodic template tests, for a collection of binary sequences. We apply these tests to the outputs of AES, SHA-3, SHA-2 family, SHA-1 and MD5 and the binary expansion of Ï and 2, and biased non-random data to test the power of new tests. Moreover, we give the probabilities for all templates for the overlapping template matching test in the NIST test suite. Afterwards, we analyse the power of templates and compare the periodic template tests with NIST overlapping template test.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Fatih Sulak, Ali DoÄanaksoy, Muhiddin UÄuz, Onur Koçak,