One Way of Testing of Lightweight Pseudorandom Number Generator for Securing the Internet of Things

The available approaches to testing random or pseudorandom sequences show low flexibility and versatility in the means of finding hidden patterns in the data. It is revealed that for sequences of length up to 100 bits there are not enough existing statistical packets. Perspective direction of research - static testing of sequences using multidimensional 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 threedimensional 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 onedimensional statistics, gives a more accurate result. As a result of the implementation of this technique, an information system can be created that will allow analyzing the PRS of a small length and choosing a quality PRS for use in the Internet of Things Security.