The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

The linear complexity of a sequence is not only a measure for the unpredictability and thus
suitability for cryptography but also of interest in information theory because of its close …

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 paper introduces a discrete wheel-switching chaotic system (DWSCS). Changing the
controlling sequence of the wheel switch allows DWSCS to generate a large number of new …

Chapter 4 PSEUDORANDOM SEQUENCES Page 1 Chapter 4 PSEUDORANDOM
SEQUENCES Alev Topuzoglu and Arne Winterhof 1. Introduction Sequences, which are …

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

In a recent work, Shallit and Vasiga have obtained several results about tails and cycles in
orbits of repeated squaring. Some of these results have been based on the Extended …

Let $ p $ be a prime and let $ a $ and $ b $ be elements of the finite field $\mathbb {F} _p $
of $ p $ elements. The inversive congruential generator (ICG) is a sequence $(u_n) $ of …

We improve lower bounds on the k th-order nonlinear complexity of pseudorandom
sequences over finite fields, including explicit inversive sequences and sequences obtained …