Recently, a conjecture on the linear complexity of a new class of generalized cyclotomic
binary sequences of period p^ r pr was proposed by Xiao et al.(Des Codes Cryptogr 86 (7) …

In this paper, we construct new q-ary generalized cyclotomic sequences of length 2 p^ n. We
study the linear complexity of these sequences over the finite field of order q and show that …

In this paper, a family of binary sequences derived from Euler quotients with RSA modulus
pq is introduced. Here two primes p and q are distinct and satisfy gcd(pq,(p-1)(q-1))=1. The …

For an odd prime p and positive integers r, d such that 0< d≤ pr, a generic construction of d‐
ary sequence based on Euler quotients is presented in this paper. Compared with the …

In this paper, we present a generic construction of r-ary sequences with period pq 2 based
on the Euler quotient modulo pq, where p and q are odd primes satisfying that p divides q− 1 …

Based on the Euler quotient modulo 2 p (p is an odd prime), we extend the binary sequence
with period 2 p^ 2 to r-ary sequence where r is an odd prime divisor of (p-1). We determine …

We introduce a new measure of pseudorandomness, the (periodic) Hamming correlation of
order l which generalizes the Hamming autocorrelation (l= 2). We analyze the relation …