On the structure of digital explicit nonlinear and inversive pseudorandom number generators
From MaRDI portal
Publication:2655800
DOI10.1016/j.jco.2009.07.001zbMath1186.65008MaRDI QIDQ2655800
Arne Winterhof, Gottlieb Isabel Pirsic
Publication date: 26 January 2010
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2009.07.001
lattice test; complexity measure for sequences; general digital explicit nonlinear generator; inversive method; Marsaglia test; Niederreiter-Winterhof inversive pseudorandom number generator; nonlinear pseudorandom number generator
65C10: Random number generation in numerical analysis
11K45: Pseudo-random numbers; Monte Carlo methods
Related Items
Generalized explicit inversive generators of small \(p\)-weight degree, On lattice profile of the elliptic curve linear congruential generators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the joint linear complexity profile of explicit inversive multisequences
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- On the counting function of the lattice profile of periodic sequences
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- Counting functions and expected values for the lattice profile at \(n\)
- A Generalization of a Congruential Property of Lucas
- Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
- Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
- On the Structure of Inversive Pseudorandom Number Generators
- On the lattice structure of pseudorandom numbers generated over arbitrary finite fields
- On a new class of inversive pseudorandom numbers for parallelized simulation methods
