Software for testing small-length bit sequences for randomness

Authors

DOI:

https://doi.org/10.18372/2225-5036.26.14962

Keywords:

software, bit sequence, testing, multidimensional statistics, random sequences, pseudo-random sequence, statistical testing.

Abstract

This article dedicated to systematization of scientific positions about the static testing of sequences, widely used in cryptographic systems of information protection for the production of key and additional information (random numbers, vectors of initialization etc.) In this paper, randomness and the best-known test suite for detecting it is examined. Testing a bit sequence for randomness is not a new problem. Now there are a large number of test packages that solve this problem. Particular attention is paid to the statistical study of bit sequences. However, the specificity of subject areas, testing systems and problems of existing methods indicate the relevance of this issue and the need to improve existing testing methods. The available test suites show low flexibility and versatility in finding hidden patterns in small data lengths (up to 100 bits). To solve this problem, it is proposed to use algorithms based on multivariate statistics. Tests for multivariate statistics allow you to better explore a sequence by using multiple sequence characteristics simultaneously. They are based on examining patterns of length two and / or three and help to uncover hidden dependencies between data. These algorithms combine all the advantages of statistical methods and are the only alternative for analyzing short and medium length sequences. In this paper, static testing of sequences using multivariate statistics is considered. The paper provides formulas for testing bit sequences for randomness, using two-dimensional or three-dimensional statistics, which can be used to test short and medium sequences. To implement the proposed technique, a software tool was developed to test the bit sequence for randomness. This tool includes NIST tests as well as tests using multivariate statistics, which have worked well for testing short bit sequences. As a result of using the developed tool, it is possible to analyze a bit sequence and select the highest quality pseudo-random sequence for use in a particular subject area.

References

Д. Кнут, Искусство программирования. Том 2. Получисленные алгоритмы, М.: Вильямс, 2007, 832 с.

М. Иванов, Д. Михайлов, И. Чугунков, Стохастические методы и средства защиты информа-ции в компьютерных системах и сетях, М.: Кудиц-Пресс, 2009, 512 с.

М. Иванов, И. Чугунков, Криптографиче-ские методы защиты информации в компьютерных системах и сетях, М.: НИЯУ МИФИ, 2012, 400 с.

A. Rukhin, A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, National Institute of Standards and Technology, 2010. [Electronic resource]. Online: https:// nvlpubs. nist. gov / nistpubs / Legacy / SP / nistspecial publication800-22r1a.pdf.

DIEHARD Statistical Tests. [Electronic re-source]. Online: https://stat.fsu.edu/pub/diehard/.

Diehard Tests. [Electronic resource]. Online: https://en.wikipedia.org/wiki/Diehard_tests.

TestU01: A software library in ANSI C for empirical testing of random number generators. Department d’Informatique et de Recherche Operationnelle, University of Montreal. 2013. [Electronic resource]. Online: http://simul.iro.umontreal. ca/testu01/ guide-shorttestu01.pdf.

И. Гайдышев, Программное обеспечение анализа данных AtteStat. Руководство пользователя. Вер-сия 13, 2012, 505 с.

S. Popereshnyak, G. Dimitrov, "The Testing of Pseudorandom Sequences using Multidimensional Statistics", Proceedings of the 1st International Workshop on Digital Content & Smart Multimedia (DCSMart 2019) Lviv, Ukraine, December 23-25, pp. 151-161, 2019.

Published

2023-02-24

Issue

Section

Cryptology