Inversive congruential generator
Semantic Scholar uses AI to extract papers important to this topic.
In this paper we revisit the modular inversion hidden number problem (MIHNP) and the inversive congruential generator (ICG) and… (More)
- IACR Cryptology ePrint Archive
In this paper we revisit the modular inversion hidden number problem and the inversive congruential pseudo random number… (More)
Generalization of the inversive congruential generator of pseudorandom numbers on the prime module is considered and the… (More)
Nonlinear congruential pseudorandom number generators based on inversions have recently been introduced and analyzed. These… (More)
We consider two nonlinear methods for generating uniform pseudo-random numbers in (0, 1), namely quadratic congruential generator… (More)
Table 4 The parallel sequence test results for the Split Multiplicative Linear Congruential Combination geneator and Srand48… (More)
In this paper we present an algorithm for the compound method of designing generators as pseudorandom stream sources. Compound… (More)
Let p be a prime and let a and b be elements of the finite field Fp of p elements. The inversive congruential generator (ICG) is… (More)
Let p be a prime and let a and b be integers modulo p. The inversive congruential generator (ICG) is a sequence (un) of… (More)
- ACM Trans. Model. Comput. Simul.
Pseudorandom numbers are important ingredients of stochastic simulations. Their quality is fundamental for the strength of the… (More)