Volume 4 • Issue 1 • PP: 09 –17 • 2024
A Study of Some Important Algorithms Used in the Process of Generating Random Numbers
Open Access & Copyright
© 2024 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
View PDF Abstract
The efforts of many researchers and scholars have focused on providing appropriate algorithms for generating random numbers and developing them in a manner that suits the need for them, but these algorithms still have advantages and disadvantages, so they are suitable for a specific study and not suitable for another study. The reason for the interest of researchers and scholars in the process of generating random numbers is that random numbers have many scientific and technical applications, starting with generating a series of semi-random numbers, from computer simulation to encryption, games of chance, and random samples for statistics and security. In simulation, which is one of the important methods provided by the new science of operations research, the primary reliance is on generating a series of random numbers that follow the regular distribution in the range [0,1], and then converting these random numbers into random variables that follow the probability distribution according to which the system to be simulated works, as the accuracy of the results we obtain from the simulation process depends on the numbers we generate using one of the algorithms. In other words, the appropriate algorithm for the field of study must be chosen from among the algorithms used, which prompted us to prepare this research. We present a reference study of some of the algorithms used to generate random numbers, highlighting their advantages, disadvantages, and most important areas of use. We then calculate and compare these algorithms. The algorithms discussed are the Middle Square Method, Middle multi-Method, Fibonacci Methods, and Linear congruential Methods.
Keywords
References
[1] A. K. I. Sheet, Introduction to Random Number Generators and Simulation. University of Mosul, 2009.
[2] I. M. Alali, Operations Research. Tishreen University Publications, 2004.
[3] S. Ahmed, Operations Research. Damascus: Arab Center for Arabization, Translation, Authorship, and Publishing, 1998.
[4] A. M. A. R. Bari, Modeling and Simulation. Saudi Arabia, 2002.
[5] D. E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley, 1969.
[6] V. Padányi and T. Herendi, “Generalized middlesquare method,” Annales Mathematicae et Informaticae, vol. 56, pp. 95–108, 2022.
[7] B. Widynski, “Middle-square weyl sequence RNG,” arXiv preprint arXiv:1704.00358, 2022.
[8] H. Rahimov, M. Babaie, and H. Hassanabadi, “Improving middle square method RNG using chaotic map,” Applied Mathematics, vol. 2, no. 4, pp. 482–486, 2011.
[9] B. Widynski, “Squares: A fast counter-based RNG,” arXiv preprint arXiv:2004.06278, 2020.
[10] V. Maksymovych, M. Shabatura, O. Harasymchuk, M. Karpinski, D. Jancarczyk, and P. Sawicki, “Development of additive fibonacci generators with improved characteristics for cybersecurity needs,” Applied Sciences, vol. 12, no. 3, p. 1519, 2022.
[11] G. L. Steele, Jr. and S. Vigna, “Computationally easy, spectrally good multipliers for congruential pseudorandom number generators,” Software: Practice and Experience, vol. 52, no. 2, pp. 443–458, 2022.
[12] D. Johnston, Random Number Generators—Principles and Practices. De Gruyter, 2018.
[13] H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods. Philadelphia, PA: Society for Industrial and Applied Mathematics, 1992.
[14] D. E. Knuth, The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd ed. Addison- Wesley, 1997.
[15] J. E. Gentle, Random Number Generation and Monte Carlo Methods, 2nd ed. Springer, 2003.
[16] J. von Neumann, “Various techniques used in connection with random digits,” Monte Carlo Method, National Bureau of Standards Applied Mathematics Series, vol. 12, pp. 36–38, 1949.
[17] S. K. Park and K. W. Miller, “Random number generators: Good ones are hard to find,” Communications of the ACM, vol. 31, no. 10, pp. 1192–1201, 1989.
Cite This Article
Choose your preferred format
Publisher's Note
The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.