ANALYSIS OF APPROACHES FOR TESTING PSEUDORANDOM BIT SEQUENCES

Authors

  • S. Popreshnyak Taras Shevchenko National University of Kyiv

Keywords:

bit sequence, testing, random sequences, pseudorandom sequence, statistical testing

Abstract

An article devoted to the systematization of scientific positions on static testing of sequences widely used in cryptographic information security systems to obtain key and additional information (random numbers, initialization vectors, etc.). Existing approaches to testing pseudo-random sequences are considered. The main advantages and disadvantages of the most well-known test packages for sequence analysis for randomness are presented. The information obtained allows you to choose the most optimal approach and tests to check the bit sequence for randomness, depending on the available characteristics of this sequence. It was found that for sequences up to 100 bits there are not enough existing statistical packets and this direction requires further and thorough research.

Author Biography

S. Popreshnyak, Taras Shevchenko National University of Kyiv

candidate of physical and mathematical sciences, associate professor of the department of software systems and technology

Downloads

Published

2021-03-22

Issue

Vol. 1 No. 12(64) (2020)

Section

Статьи

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

CC BY-ND

A work licensed in this way allows the following:

1. The freedom to use and perform the work: The licensee must be allowed to make any use, private or public, of the work.

2. The freedom to study the work and apply the information: The licensee must be allowed to examine the work and to use the knowledge gained from the work in any way. The license may not, for example, restrict "reverse engineering."

2. The freedom to redistribute copies: Copies may be sold, swapped or given away for free, in the same form as the original.