A generator of pseudo-random numbers sequences with maximum period

Authors:
Sergio Sánchez;Regino Criado;Carlos Vega
Affiliations:
Dpto. de Matemáticas y Física Aplicadas y CC. de la Naturaleza, E.S.C.E.T., U.R.J.C., C/Tulipán s/n, 28933-Madrid, Spain;Dpto. de Matemáticas y Física Aplicadas y CC. de la Naturaleza, E.S.C.E.T., U.R.J.C., C/Tulipán s/n, 28933-Madrid, Spain;Dpto. de Matemática Aplicada a las Tec. de la Información, U.P.M., Ciudad Universitaria s/n, 28040-Madrid, Spain
Venue:
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Year:
2003

Citing 4
Cited 0

Reconstructing truncated integer variables satisfying linear congruences

SIAM Journal on Computing - Special issue on cryptography
Inferring sequences produced by pseudo-random number generators

Journal of the ACM (JACM)
Random number generators: good ones are hard to find

Communications of the ACM
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents several guidelines in order to show that it is possible to choose in an adequate manner the parameters a, b and m of the linear congruential generator xn+1 = (aċxn+b) mod m in order to maximize the period of the generated series of pseudo-random numbers, in such a manner that the period obtained is close to the theoretical upper bound of m!.