- Free Articles
- Time in Philosophical Logic Encyclopedia of Database Systems
- Indoor Localization Encyclopedia of GIS
- Suffix Tree Construction in Hierarchical Memory Encyclopedia of Algorithms
- Probabilistic Data Forwarding in Wireless Sensor Networks Encyclopedia of Algorithms
- Renaming Encyclopedia of Algorithms
**More Free Articles**

Computer Science
>
Encyclopedia of Cryptography and Security
>
Linear Congruential Generator

This is the free portion of the full article.
The full article
is available to licensed users only.

How do I get access?

# Linear Congruential Generator

## Related Concepts

## Definition

A linear congruential generator is a pseudorandom generator that produces a sequence of numbers

for

*x*_{1},*x*_{2},*x*_{3},*…*according to the following linear recurrence:*t*≥ 1 (modular arithmetic); integers*a*,*b*, and*n*characterize entirely the generator, and the seed is*x*_{0}.## Example

Considering for example *a* = 3, *b* = 5, *n* = 17, and *x* _{0} = 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, *…*

## Background

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.

## Applications

Such generators are easy to implement and pass the following statistical tests: Golomb's randomness postulates, frequency test, serial test, poker test,