Proceedings Article | 29 March 2023
KEYWORDS: Quantum numbers, Magnetism, Information security, Evolutionary algorithms, Bessel functions, Thin films, Spectroscopy, Plastics, Particles, Magneto-optics
As the most widely used pseudo-random number generation algorithm, the linear congruence algorithm has the characteristics of fast generation and can generate better random numbers in one-dimensional space. Random numbers are widely used in many fields, such as information security and communication, and it is important to study the generation of random sequences. However, the linear congruence method has some defects, for example, when the mode of the linear congruence method𝑚 takes 10, multiplier𝑎 takes 7, increment𝑐 takes 7 and the initial value𝑋0 takes 7, the sequence obtained is: 7,6,9,0, 7,6,9,0, ..., which results in a sequence with a period of 4. In the linear congruence method𝑚 , the 𝑎 and 𝑐 are crucial to the size of the period of the whole sequence and will directly affect the security of the algorithm. In this paper, the conditions for the linear congruence method to reach the full cycle are given on the basis of previous work, and a rigorous mathematical proof is given.
