One Way of Testing of Pseudorandom Sequence of Small Length Using Multidimensional Statistics

Existing approaches to testing pseudorandom sequences, their advantages and disadvantages are considered. It is revealed that for sequences of length up to 100 bits there are not enough existing statistical packets. The available techniques show low flexibility and versatility in the means of finding hidden patterns in the data. Perspective direction of research - static testing of sequences using n-dimensional statistics is considered. To solve this problem, it is suggested to use algorithms based on multidimensional statistics. In the work, formulas are given and theorem for testing sequences for randomness, using two or three-dimensional statistics that can be used for small and medium-sized sequences is formulated. The new technique of PRS testing is proposed in the paper, and several criteria for testing bit sequence of small length are considered, which, in comparison with one-dimensional statistics, gives a more accurate result.