Home | History | Annotate | Download | only in resolv

Lines Matching full:generator

15  * permutation generator based on a Luby-Rackoff block cipher. This
42 * n = prime, g0 = generator to n,
44 * g = g0^j mod n will be a generator again.
47 * X[n] = a*X[n-1]+b mod m is a Linear Congruential Generator
59 * The output of this generator is then randomly permuted though a
80 #define RU_GEN 2 /* Starting generator */
169 * Initializes the seed and chooses a suitable generator. Also toggles
202 * gcd(j, RU_N-1) == 1, giving a new generator for
242 /* Linear Congruential Generator */
260 printf("Generator: %u\n", ru_g);