Inversive congruential generator

From Wikipedia, the free encyclopedia

Inversive congruential generators are a type of nonlinear congruential pseudorandom number generator, which use the modular multiplicative inverse (if it exists) to generate the next number in a sequence. The standard formula for an inversive congruential generator is

x_{i+1} \equiv (ax_{i}^{-1} + c) \pmod m

where

0 \le x_{i} < m.

[edit] See also

 This cryptography-related article is a stub. You can help Wikipedia by expanding it.
This number theory-related article is a stub. You can help Wikipedia by expanding it.
Languages