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 …

Automatic sequences such as the Thue–Morse sequence and the Rudin–Shapiro sequence
are highly predictable and thus not suitable in cryptography. In particular, they have small …

An m-sequence is the one of the largest period among those produced by a linear feedback
shift register. It possesses several desirable features of pseudorandomness such as …

The (classical) crosscorrelation is an important measure of pseudorandomness of two binary
sequences for applications in communications. The arithmetic crosscorrelation is another …

Binary-sequences are those with the largest period among the binary sequences produced
by linear shift registers with length. They have a wide range of applications in …

The arithmetic correlations of two binary half‐ℓ‐sequences with connection integer pr, which
is an odd prime power, are investigated. Possible values (of the arithmetic correlation) are …

It is known that Hall's sextic residue sequence has some desirable features of
pseudorandomness: an ideal two-level autocorrelation and linear complexity of the order of …

Arithmetic cross/auto-correlation, which is the with-carry analog of classical correlation, is an
important figure of merit for pseudorandom sequences. It is desirable that the absolute …

Let 1<; g 1<;⋯<; g φ (p-1)<; p-1 be the ordered primitive roots modulo p. We study the
pseudorandomness of the binary sequence (sn) defined by sn≡ g n+ 1+ g n+ 2 mod 2, n= 0 …

In this paper we study a family of Legendre sequences and its pseudo-randomness in terms
of their family complexity. We present an improved lower bound on the family complexity of a …