Results 1 - 10 of 253

Compound Inversive Congruential Generator Design Algorithm

by Jaroslaw Bubicz, Janusz Stoklosa
"... In this paper we present an algorithm for the compound method of designing generators as pseudorandom stream sources. Compound method relies on a technique of combining two or more inversive congruential generators. Experiments on congruential methods showed that even if all tested generators have m ..."
Abstract - Add to MetaCart
In this paper we present an algorithm for the compound method of designing generators as pseudorandom stream sources. Compound method relies on a technique of combining two or more inversive congruential generators. Experiments on congruential methods showed that even if all tested generators have

Inversive Congruential Pseudorandom Numbers: Distribution Of Triples

by Jürgen Eichenauer-Herrmann, Harald Niederreiter , 1997
"... This paper deals with the inversive congruential method with power of two modulus m for generating uniform pseudorandom numbers. Statistical independence properties of the generated sequences are studied based on the distribution of triples of successive pseudorandom numbers. It is shown that, on th ..."
Abstract - Cited by 41 (0 self) - Add to MetaCart
This paper deals with the inversive congruential method with power of two modulus m for generating uniform pseudorandom numbers. Statistical independence properties of the generated sequences are studied based on the distribution of triples of successive pseudorandom numbers. It is shown that

INVERSIVE CONGRUENTIAL PSEUDORANDOM NUMBERS: DISTRIBUTION OF TRIPLES

by Harald Niederreiter
"... Abstract. This paper deals with the inversive congruential method with power of two modulus m for generating uniform pseudorandom numbers. Statistical independence properties of the generated sequences are studied based on the distribution of triples of successive pseudorandom numbers. It is shown t ..."
Abstract - Add to MetaCart
Abstract. This paper deals with the inversive congruential method with power of two modulus m for generating uniform pseudorandom numbers. Statistical independence properties of the generated sequences are studied based on the distribution of triples of successive pseudorandom numbers. It is shown

On a nonlinear congruential pseudorandom number generator

by Takashi Kato, Li-ming Wu, Niro Yanagihara - Math. Comp , 1996
"... Abstract. A nonlinear congruential pseudorandom number generator with modulus M =2 w is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive one ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract. A nonlinear congruential pseudorandom number generator with modulus M =2 w is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive

Implementation of algorithms for IMP-polynomials

by Peter Hellekalek, Markus Mayer, Andreas Weingartner , 1994
"... Parallel Monte Carlo methods require pseudorandom number generators with long periods and stable statistical properties, in particular in the MIMD case. The type of the compound inversive congruential generator (cICG) satisfies these two important requirements. To implement cICG, we have to know sp ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Parallel Monte Carlo methods require pseudorandom number generators with long periods and stable statistical properties, in particular in the MIMD case. The type of the compound inversive congruential generator (cICG) satisfies these two important requirements. To implement cICG, we have to know

On the multidimensional distribution of inversive congruential pseudorandom numbers in parts of the period

by Harald Niederreiter, Igor, E. Shparlinski - Math. Comp , 2000
"... Abstract. The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. In this paper we present the first nontrivial bounds on the discrepancy of individual sequences of inversive congruential pseudorandom numbers in p ..."
Abstract - Cited by 10 (4 self) - Add to MetaCart
Abstract. The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. In this paper we present the first nontrivial bounds on the discrepancy of individual sequences of inversive congruential pseudorandom numbers

AVERAGE EQUIDISTRIBUTION PROPERTIES OF COMPOUND NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBERS

by Gerhard Larcher
"... Abstract. The present paper deals with the compound nonlinear congruential method for generating uniform pseudorandom numbers, which has been introduced recently. Equidistribution properties of the generated sequences over parts of the period are studied, based on the discrepancy of the correspondin ..."
Abstract - Add to MetaCart
Abstract. The present paper deals with the compound nonlinear congruential method for generating uniform pseudorandom numbers, which has been introduced recently. Equidistribution properties of the generated sequences over parts of the period are studied, based on the discrepancy

P A INVERSIVE CONGRUENTIAL GENERATOR WITH A VARIABLE SHIFT OF PSEUDORANDOM POINTS OVER THE COMPLEX PLANE

by Tran The Vinh , 2015
"... Abstract: Consider the generator of pseudorandom points on unit square produced by the inversive congruential recursion over the ring of Gaussian integers. Study the exponential sums on sequences of these points. ..."
Abstract - Add to MetaCart
Abstract: Consider the generator of pseudorandom points on unit square produced by the inversive congruential recursion over the ring of Gaussian integers. Study the exponential sums on sequences of these points.

Finding Small Solutions of a Class of Simultaneous Modular Equations and Applications to Modular Inversion Hidden Number Problem and Inversive Congruential Generator

by Jun Xu, Lei Hu, Zhangjie Huang, Liqiang Peng
"... Abstract. In this paper we revisit the modular inversion hidden number problem and the inversive congruential pseudo random number genera-tor and consider how to more efficiently attack them in terms of few-er samples or outputs. We reduce the attacking problem to finding s-mall solutions of systems ..."
Abstract - Add to MetaCart
Abstract. In this paper we revisit the modular inversion hidden number problem and the inversive congruential pseudo random number genera-tor and consider how to more efficiently attack them in terms of few-er samples or outputs. We reduce the attacking problem to finding s-mall solutions

Predicting the inversive generator

by Simon R. Blackburn, Domingo Gomez-perez, Jaime Gutierrez, Igor E. Shparlinski - Cryptography and Coding, LNCS 2898 , 2003
"... Abstract. Let p be a prime and let a and b be integers modulo p. The inversive congruential generator (ICG) is a sequence (un) of pseudoran-dom numbers defined by the relation un+1 ≡ au−1n + b mod p. We show that if b and sufficiently many of the most significant bits of three consec-utive values un ..."
Abstract - Cited by 11 (9 self) - Add to MetaCart
Abstract. Let p be a prime and let a and b be integers modulo p. The inversive congruential generator (ICG) is a sequence (un) of pseudoran-dom numbers defined by the relation un+1 ≡ au−1n + b mod p. We show that if b and sufficiently many of the most significant bits of three consec-utive values
Results 1 - 10 of 253