Node:DICG, Next:EXTERNAL, Previous:MEICG, Up:Definitions
y_n = a * inv(y_{n-1}) + b (mod p) n > 0
All operations are in the field F_{2^k} !!
prng_new
):
"dicg(k,a,b,y_0)"
.
prng_is_congruential
is TRUE
.
prng_can_seed
is TRUE
.
The parameter of prng_seed
will be used as
y_{n-1}
in the next call to get_next
prng_can_fast_sub
and prng_can_fast_con
are FALSE
.
Tricky.
Eichenauer-Herrmann and Niederreiter, "Digital inversive pseudorandom numbers", ACM Transactions on Modeling and Computer Simulation, 4:339-349 (1994)