Linear Congruential Generator
- Caroline FontaineAffiliated withLab-STICC/CID and Telecom Bretagne/ITI, CNRS/Lab-STICC/CID and Telecom Bretagne
Considering for example a = 3, b = 5, n = 17, and x0 = 2, the sequence produced by the linear congruential generator will be 11, 4, 0, 5, 3, 14, 13, 10, 1, 8, 12, 7, 9, 15, 16, …
Pseudorandom generators are very useful in cryptography, in protocols, but also in the generation of keystreams in stream ciphers. In this case, they have to present strong properties to face cryptanalysis.
Such generators are easy to implement and pass the following statistical tests: Golomb’s randomness postulates, frequency test, serial test, poker test ...
- Linear Congruential Generator
- Reference Work Title
- Encyclopedia of Cryptography and Security
- p 721
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, LLC
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 376. Department of Mathematics and Computing Science, Eindhoven University of Technology
- 377. Center for Secure Information Systems, George Mason University
- Author Affiliations
- 1. Lab-STICC/CID and Telecom Bretagne/ITI, CNRS/Lab-STICC/CID and Telecom Bretagne, Technopole Brest Iroise, CS 83818, 29238, Brest Cedex 3, France
To view the rest of this content please follow the download PDF link above.