LS-14 Test Suite for Long Sequences

Loading...
Publication Logo

Date

2024

Journal Title

Journal ISSN

Volume Title

Publisher

Hacettepe Univ, Fac Sci

Open Access Color

GOLD

Green Open Access

Yes

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Average
Influence
Average
Popularity
Average

Research Projects

Journal Issue

Abstract

Random number sequences are used in many branches of science. Because of many techni- cal 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 ap- proximations 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 collec- tion 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.

Description

Keywords

Randomness, Random Number|Statistical Tests, Cryptography, NIST SP800-22, Dynamic Partitioning, İstatistik, Statistics, Randomness;random number;statistical tests;cryptography;NISTSP800-22;dynamic partitioning, cryptography, Data encryption (aspects in computer science), Exact enumeration problems, generating functions, randomness, statistical tests, dynamic partitioning, Sequences (mod \(m\)), NIST SP800-22, Applications of computability and recursion theory, random number, Comprehensive works on combinatorics, graph theory, and probability (educational aspects)

Fields of Science

0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Citation

WoS Q

Q2

Scopus Q

Q3
OpenCitations Logo
OpenCitations Citation Count
N/A

Source

Hacettepe Journal of Mathematics and Statistics

Volume

53

Issue

1

Start Page

230

End Page

250
PlumX Metrics
Citations

Scopus : 3

Captures

Mendeley Readers : 1

SCOPUS™ Citations

3

checked on Feb 20, 2026

Web of Science™ Citations

1

checked on Feb 20, 2026

Page Views

8

checked on Feb 20, 2026

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
0.63877855

Sustainable Development Goals

SDG data is not available