Lattice structure and linear complexity profile of nonlinear pseudorandom number generators

DOI10.1007/s00200-003-0116-6zbMath1026.11064OpenAlexW1972186222MaRDI QIDQ1396702

Gerhard Dorfer, Arne Winterhof

Publication date: 8 July 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/s00200-003-0116-6

zbMATH Keywords

linear complexity profilenonlinear methodpseudorandom number generatorMarsaglia's lattice test

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (15)

Pseudorandom sequences derived from automatic sequences ⋮ 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 ⋮ On the counting function of the lattice profile of periodic sequences ⋮ On the \(N\)th linear complexity of automatic sequences ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ Enumeration results on linear complexity profiles and lattice profiles ⋮ Continued fraction for formal Laurent series and the lattice structure of sequences ⋮ Hamming correlation of higher order ⋮ Joint linear complexity of multisequences consisting of linear recurring 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 profile of nonlinear pseudorandom number generators