The correlation measure of order k is an important measure of pseudorandomness for binary
sequences. This measure tries to look for dependence between several shifted versions of a …

The 2-adic complexity has been well-analyzed in the periodic case. However, we are not
aware of any theoretical results in the aperiodic case. In particular, the N th 2-adic …

Let $\mathbb {F} _q $ be the finite field of $ q $ elements. We define the Rudin-Shapiro
function $ R $ on monic polynomials $ f= t^ n+ f_ {n-1} t^{n-1}+\dots+ f_0\in\mathbb {F} _q [t] …

In this survey we summarize properties of pseudorandomness and non-randomness of
some number-theoretic sequences and present results on their behaviour under the …

Automatic sequences are not suitable sequences for cryptographic applications since both
their subword complexity and their expansion complexity are small, and their correlation …

The (Nth) linear complexity is a measure of pseudorandomness for binary sequences.
Sequences with small linear complexity are highly predictable and therefore far from being …

There are several ways to evaluate the predictability of binary sequences of pseudorandom
numbers. In this thesis, the 2-adic complexity and its relation to other measures such as …