Lattice structure and linear complexity of nonlinear pseudorandom numbers
From MaRDI portal
Publication:1861173
DOI10.1007/s002000200105zbMath1033.11038OpenAlexW2055360862MaRDI QIDQ1861173
Arne Winterhof, Harald Niederreiter
Publication date: 13 March 2003
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000200105
inverse methodlinear complexitynonlinear methodpseudorandom number generatorMarsaglia's lattice test
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (13)
On the structure of digital explicit nonlinear and inversive pseudorandom number generators ⋮ Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ On lattice profile of the elliptic curve linear congruential generators ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ On the counting function of the lattice profile of periodic sequences ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ Enumeration results on linear complexity profiles and lattice profiles ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ On k-error linear complexity of some explicit nonlinear pseudorandom sequences ⋮ On the linear complexity profile of some new explicit inversive pseudorandom numbers ⋮ Counting functions and expected values for the lattice profile at \(n\) ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
This page was built for publication: Lattice structure and linear complexity of nonlinear pseudorandom numbers
