H Niederreiter, IE Shparlinski - Monte Carlo and Quasi-Monte Carlo …, 2002 - Springer
Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators Page 1 Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators Harald …
We obtain lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator, of the inversive generator, and of a new …
H Niederreiter, IE Shparlinski - International Symposium on Applied …, 2003 - Springer
Dynamical Systems Generated by Rational Functions Page 1 Dynamical Systems Generated by Rational Functions Harald Niederreiter1 and Igor E. Shparlinski2 1 Department of …
G Dorfer, A Winterhof - Applicable Algebra in Engineering, Communication …, 2003 - Springer
Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators Page 1 AAECC 13, 499–508 (2003) 2003 Lattice Structure and Linear Complexity …
W Meidl, A Winterhof - Journal of Complexity, 2004 - Elsevier
Linear complexity and linear complexity profile are interesting characteristics of a sequence for applications in cryptography and Monte-Carlo methods. We introduce some new explicit …
H Niederreiter, A Winterhof - Applicable Algebra in Engineering …, 2002 - Springer
It is shown that aq-periodic sequence over the finite field F q passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity is large. The …
A Winterhof - Journal of Number Theory, 2001 - Elsevier
Consider an extension field Fqm= Fq (α) of the finite field Fq. Davenport proved that the set Fq+ α contains at least one primitive element of Fqm if q is sufficiently large with respect to …
W Meidl, A Winterhof - Information processing letters, 2003 - Elsevier
On the linear complexity profile of explicit nonlinear pseudorandom numbers Page 1 Information Processing Letters 85 (2003) 13–18 www.elsevier.com/locate/ipl On the linear …