The book introduces new techniques that imply rigorous lower bounds on the com plexity of
some number-theoretic and cryptographic problems. It also establishes certain attractive …

We present a survey of recent work on the linear complexity, the linear complexity profile,
and the k-error linear complexity of sequences and on the joint linear complexity of …

This survey article collects recent results on recursive nonlinear pseudorandom number
generators and sketches some important proof techniques. We mention upper bounds on …

We study the distribution of s-dimensional points of Fermat quotients modulo p with arbitrary
lags. If no lags coincide modulo p the same technique as in [21] works. However, there are …

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 …

Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number
Generators Page 1 AAECC 13, 499–508 (2003) 2003 Lattice Structure and Linear Complexity …

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 …

We prove a relation between two measures of pseudorandomness, the arithmetic
autocorrelation, and the correlation measure of order k. Roughly speaking, we show that any …

Recently, Dorfer and Winterhof introduced and analyzed a lattice test for sequences of
length n over a finite field. We determine the number of sequences η of length n with given …

Recently, we showed that an extension of Marsaglia's lattice test for segments of sequences
over arbitrary fields and the linear complexity profile provide essentially equivalent quality …