# A Hybrid Inversive Congruential Pseudorandom Number Generator with High Period

...read more

##### Citations

##### References

...read more

...read more

6,074 citations

...read more

...read more

3,672 citations

...read more

...read more

1,154 citations

### "A Hybrid Inversive Congruential Pse..." refers methods in this paper

...The PRNG {yn} derived from (5) is purely periodic with period M/2, regardless of the odd initial conditions y0, y1, and the set {y1, y2, . . . , yM 2 } = GM if and only if a ≡ 1 (mod 4), b ≡ 0 (mod M2 ) and c ≡ 2 (mod 4)....

[...]

...Then, the PRNs {xn}, defined by (2), belong to the set HM = { 1 M , 3 M , . . . , M−1 M } ....

[...]

...Also with the same parameters and 109 PRNs we ran the Dieharder Test which also showed promising results which are being visually displayed in Figure 2 (Here the 109 bits are partitioned into 31249999 32-bit numbers which are further converted to decimal numbers and then the Dieharder Test is run)....

[...]

...In the spirit of the known Blum-Micali PRN [1], we define a pseudorandom binary sequence {zn} by zn = f(yn), where f : GM → {0, 1} is given by...

[...]

...In the spirit of the known Blum-Micali PRN [1], we define a pseudorandom binary sequence {zn} by zn = f(yn), where f : GM → {0, 1} is given by f(x) = { 0 if x < M2 1 if x > M2 ....

[...]

...read more

...read more

89 citations

...read more

88 citations

### "A Hybrid Inversive Congruential Pse..." refers background in this paper

...The lattice test complexity is known for the inversive congruential generator (see [6, 19], for more on this generator)....

[...]