This modification made it possible to ensure the constancy of the repetition period of the output pseudorandom pulse sequence in the entire range of possible values of the initial settings–keys (seed) at specific values of the module. This paper proposes a modification to AGF, the essence of which is to use prime numbers as modules of recurrent equations describing the operation of generators. Nevertheless, when used as a primary it can be quite resistant to cryptanalysis generators. By itself, such a generator is not cryptographically strong. A special place among such generators is occupied by additive Fibonacci generators (AFG).
Pseudorandom number and bit sequence generators are widely used in cybersecurity, measurement, and other technology fields.
0 kommentar(er)
