Abstract
Linear congruential method was one of the first one proposed to generate pseudorandom numbers. However, due to drawbacks arising from linearity nonlinear methods of generating pseudorandom numbers were proposed; however, these methods were mostly nonlinear recurrences of rank 1, i.e., iterations of a univariate map. In this paper we propose a generator which is a recurrence of order \(k\) based on 2-adic 1-Lipschitz bijective functions and find conditions under which generator produces sequences with the period of \(k2^{t}\) of uniformly distributed numbers modulo \(2^{t}\).
This is a preview of subscription content, log in via an institution to check access.
References
P. Stǎnicǎ, C. Riera, T. Roy and S. Sarkar, “A hybrid inversive congruential pseudorandom number generator with high period,” Europ. J. Pure Appl. Math. 14 (1), 1–18 (2021).
V. Anashin and A. Khrennikov, Applied Algebraic Dynamics (De Gruyter, Berlin, New York, 2009).
J. Eichenauer-Herrmann and H. Grothe, “A new inversive congruential pseudorandom number generator with power of two modulus,” ACM Trans. Model. Comp. Simul. (TOMACS) 2 (1), 1–11 (1992).
Acknowledgments
The author wishes to thank Prof. Vladimir S. Anashin for his supervisorship on preparing this manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sidorov, A. \(2\)-Adic 1-Lipschitz Maps-Based Nonlinear Pseudorandom Generators of Arbitrary Rank Having the Longest Period. P-Adic Num Ultrametr Anal Appl 15, 85–93 (2023). https://doi.org/10.1134/S2070046623020012
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S2070046623020012