Testing of Code-Based Pseudorandom Number Generators for Post-Quantum Application

This article presents the results of studies of design pseudorandom sequence generators using code-based cryptosystems. The resistance of this generators type is based on the complexity of solving the syndrome decoding problem, which allows to provide resistance to classic cryptanalysis and cryptanalysis using quantum computing. The article describes the principles of constructing a classic Fisher-Stern generator and proposes a new approach to design a code-based generator that can be applied in the post-quantum period. Heuristic testing of the presented generators was also conducted in terms of a period length, a sequence generation speed, and a resistance of the generators, which revealed the Fisher-Stern generator deficiency. It is a difference between a theoretical and a practical period of the generated sequences, which is eliminated in the proposed generator by adding two components: a linear feedback shift register and an adder.