On the lattice structure of pseudorandom numbers generated over arbitrary finite fields

DOI10.1007/S002000100074zbMath0992.11047OpenAlexW1975950310MaRDI QIDQ5941760

Harald Niederreiter, Arne Winterhof

Publication date: 26 August 2001

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000100074

zbMATH Keywords

congruential generatorlattice testnonlinear methodpseudorandom number generator

Mathematics Subject Classification ID

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

Related Items (6)

Normality of the Thue-Morse function for finite fields along polynomial values ⋮ On the structure of digital explicit nonlinear and inversive pseudorandom number generators ⋮ Generalized explicit inversive generators of small \(p\)-weight degree ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ On the linear complexity profile of explicit nonlinear pseudorandom numbers. ⋮ Improving results on the pseudorandomness of sequences generated via the additive order of a finite field

This page was built for publication: On the lattice structure of pseudorandom numbers generated over arbitrary finite fields