Abstract
Developing random number generators which involve some nonlinear operation in their generation schemes has been a central research issue in this area, since the nonlinearity has long been believed to be useful to make the resulting sequences look more random. In this chapter, we discuss three types of nonlinear generator. The first and second ones are defined by slightly modifying linear congruential generators, using polynomial arithmetic and multiplicative inversion, respectively. The third type consists of random number generators for cryptographic applications, which require the sequences produced to have a certain property of ‘ unpredictability.’ This property turns out to be strongly connected with the ‘nonlinearity’ involved in the generation scheme. In fact, linear congruential sequences are known to be unsuitable for such applications because of their polynomial-time ‘predictability.’
Article FootNote
Random number generation is too important to be left to chance. — Robert R. Coveyou (1969)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tezuka, S. (1995). Beyond Linear Congruential Generators. In: Uniform Random Numbers. The Springer International Series in Engineering and Computer Science, vol 315. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2317-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2317-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5980-7
Online ISBN: 978-1-4615-2317-8
eBook Packages: Springer Book Archive