Filters

20192
Reset filters

Settings

Scopus Q: Q3Subject: Statistical randomness testing

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Citation - WoS: 2
    Citation - Scopus: 4
    R-2 Composition Tests: a Family of Statistical Randomness Tests for a Collection of Binary Sequences
    (Springer, 2019) Uguz, Muhiddin; Doganaksoy, Ali; Sulak, Fatih; Kocak, Onur
    In this article a family of statistical randomness tests for binary strings are introduced, based on Golomb's pseudorandomness postulate R-2 on the number of runs. The basic idea is to construct recursive formulae with computationally tenable probability distribution functions. The technique is illustrated on testing strings of 2(7), 2(8), 2(10) and 2(12) bits. Furthermore, the expected value of the number of runs with a specific length is obtained. Finally the tests are applied to several collections of strings arising from different pseudorandom number generators.
  • Thumbnail Image
    Article
    Citation - WoS: 8
    Periodic Template Tests: a Family of Statistical Randomness Tests for a Collection of Binary Sequences
    (Elsevier, 2019) Sulak, Fatih; Doganaksoy, Ali; Uguz, Muhiddin; Kocak, Onur
    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 pi and root 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. (C) 2019 Elsevier B.V. All rights reserved.