Enhancing the Security of Cryptographic Systems by Pseudo-Random Number Generation Algorithms
Pseudo-random numbers play an indispensable role in the design of encryption systems, such as public and private key flow. The efficiency of crypto systems is directly proportional to the quality of the secret key generated using a random number generation algorithm. In this paper, the efficiency and applicability of a modified Linear Congruential Generator (LCG) type algorithm will be presented to increase the rate of occurrence of numbers and tend as much as possible to a truly random number. Moreover, it will be integrated into a graphical interface, which can later be integrated into the security of a larger application or even a website.
swarnavo09, “Elements of Cybersecurity,” 2022. Accessed: Mar. 15, 2023. [Online]. Available: https://www.geeksforgeeks.org/elements-of-cybersecurity/
H. Kavak, J.J. Padilla, D. Vernon-Bido, S.Y. Diallo, R. Gore, S. Shetty, “Simulation for cybersecurity: state of the art and future directions,” Journal of Cybersecurity, Vol. 7, Issue 1, 2021. Accessed Apr. 4, 2023. [Online]. Available: https://academic.oup.com/cybersecurity/article/7/1/tyab005/6170701.
J. V. Neumann, Various techniques used in connection with random digits, 1951.
B. Fathi-Vajargah, R. Asghari, "A Novel Pseudo-Random Number Generator for Cryptographic Applications," Indian Journal of Science and Technology, 9(6), 2016.
H. Tang, “Reverse multiple recursive random number,” European Journal of Operational Research, 164, 2005.
akshisaxena, Hash Map in Python, 2023. Accessed Mar. 22, 2023. [Online]. Available: https://www.geeksforgeeks.org/hash-map-in-python/
Python hash(). Accessed Mar. 20, 2023. [Online]. Available: https://www.programiz.com/python-programming/methods/built-in/hash