Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
LS-14 test suite for long sequences
Download
index.pdf
Date
2024-02-29
Author
Akcengiz, Ziya
Aslan, Melis
Doğanaksoy, Ali
Sulak, Fatih
Uğuz, Muhiddin
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
126
views
27
downloads
Cite This
Random number sequences are used in many branches of science. Because of many technical reasons and their practicality, pseudo random sequences are usually employed in place of true number sequences. Whether a sequence generated through a deterministic process is a pseudo random, in other words, random-looking sequence or it contains certain pat-terns, can be determined with the help of statistics and mathematics. Although, in the literature there are many statistical randomness tests for this purpose, there is no much work on test suites specialized for long sequences, that is sequences of length 1,000,000 bits or more. Most of the randomness tests for long sequences use some mathematical approximations to compute expected values of the random variables and hence their results contain some errors. Another approach to evaluate randomness criteria of long sequences is to partition the long sequence into a collection short sequences and evaluate the collection for the ran-domness using statistical goodness of fit tests. The main advantage of this approach is, as the individual sequences are short, there is no need to use mathematical approximations. On the other hand when the second approach is preferred, partition the long sequence into a collection of fixed length subsequences and this approach causes a loss of information in some cases. Hence the idea of dynamic partition should be included to perform a more reliable test suite. In this paper, we propose three new tests, namely the entire R2 run, dynamic saturation point, and dynamic run tests. Moreover, we in-troduce a new test suite, called LS-14, consisting of 14 tests to evaluate randomness of long sequences. As LS-14 employs all three approaches: testing the entire long sequence, testing the collection of fixed length partitions of it, and finally, testing the collection obtained by the dynamic partitions of it, the proposed LS-14 test suit differs from all existing suites. Mutual comparisons of all 14 tests in the LS-14 suite, with each other are computed. Moreover, results obtained from the proposed test suite and NIST SP800-22 suite are compared. Examples of sequences with certain patterns which are not observed by NIST SP800-22 suite but detected by the proposed test suite are given.
Subject Keywords
cryptography
,
dynamic partitioning
,
NIST SP800-22
,
random number
,
Randomness
,
statistical tests
URI
https://hdl.handle.net/11511/109051
Journal
Hacettepe Journal of Mathematics and Statistics
DOI
https://doi.org/10.15672/hujms.1190807
Collections
Department of Mathematics, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Z. Akcengiz, M. Aslan, A. Doğanaksoy, F. Sulak, and M. Uğuz, “LS-14 test suite for long sequences,”
Hacettepe Journal of Mathematics and Statistics
, vol. 53, no. 1, pp. 230–250, 2024, Accessed: 00, 2024. [Online]. Available: https://hdl.handle.net/11511/109051.