Pseudorandom number generators with self-monitoring of correct operation

Abstract

A promising direction in solving information security problems is the use of stochastic methods based on the use of pseudorandom number generators (PRNG), the result of which is to insure unpredictability into the operation of computer systems and their elements. Non-Linear Feedback Shift Registers (NLFSRs) are used to construct pseudo-random number generators (PRNGs) for stream ciphers. Their theory is not as complete as the theory of linear feedback shift registers (LFSRs), in particular M-sequences generators. For example, in the general case, it is not known how to construct an NLFSR with maximum period. The purpose of this work is to substantiate the possibility of constructing (M – 2n + 1)-sequence generators with error detection. Results obtained: a method is presented for constructing PRNGs using shift registers with nonlinear feedbacks, the convolution over GF(2n) of the contents of memory elements of which changes according to a previously known law.

Keywords

• pseudorandom number generator, lfsr, nlfsr, generator (м – 2n + 1)-sequences, error detection.