MAXEM: A New Pseudo-Random Number Generating Algorithm with Implementation of Modulo Arithmetic, XORShift, and Entropy Modulation

This paper introduces a novel pseudo-random number generation algorithm incorporating modulo arithmetic, XORShift, and entropy modulation. The method is designed to enhance randomness and unpredictability by utilizing bitwise manipulations and dynamic entropy modulation. Experimental results demonstrate the algorithm’s performance across various test sets. The algorithm seeks to resolve two of the most common problems of common PRNGs, which are the quality of randomness with selection of an arbitrary seed and the presence of periodic cycles. The findings suggest potential applications in cryptography and statistical simulations.