LS-14 test suite for long sequences

No Thumbnail Available

Date

2024

Journal Title

Journal ISSN

Volume Title

Publisher

Hacettepe Univ, Fac Sci

Research Projects

Organizational Units

Organizational Unit
Mathematics
(2000)
The Atılım University Department of Mathematics was founded in 2000 and it offers education in English. The Department offers students the opportunity to obtain a certificate in Mathematical Finance or Cryptography, aside from their undergraduate diploma. Our students may obtain a diploma secondary to their diploma in Mathematics with the Double-Major Program; as well as a certificate in their minor alongside their diploma in Mathematics through the Minor Program. Our graduates may pursue a career in academics at universities, as well as be hired in sectors such as finance, education, banking, and informatics. Our Department has been accredited by the evaluation and accreditation organization FEDEK for a duration of 5 years (until September 30th, 2025), the maximum FEDEK accreditation period achievable. Our Department is globally and nationally among the leading Mathematics departments with a program that suits international standards and a qualified academic staff; even more so for the last five years with our rankings in the field rankings of URAP, THE, USNEWS and WEBOFMETRIC.

Journal Issue

Abstract

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 patterns, 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 intro duce 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.

Description

Uguz, Muhiddin/0000-0003-2344-503X

Keywords

. Randomness, random number, statistical tests, cryptography, NIST SP800-22, dynamic partitioning

Turkish CoHE Thesis Center URL

Citation

0

WoS Q

Scopus Q

Source

Volume

53

Issue

1

Start Page

230

End Page

250

Collections