This paper examines the linear complexity of a family of generalized cyclotomic binary
sequences of period p^ n pn recently proposed by Xiao et al.(Des Codes Cryptogr, 2017 …

We investigate the $ k $-error linear complexity of pseudorandom binary sequences of
period $ p^{\mathfrak {r}} $ derived from the Euler quotients modulo $ p^{\mathfrak {r}-1} $, a …

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 …

Linear complexity is an important pseudo-random measure of the key stream sequence in a
stream cipher system. The 1-error linear complexity is used to measure the stability of the …

Linear complexity is an important pseudo-random measure of the keystream sequence in a
stream cipher system. The error linear complexity is employed to measure the stability of the …

关于二元割圆序列的k-错线性复杂度k-error linear complexity of binary cyclotomic generators
Page 1 2019 年2 月 Journal on Communications February 2019 2019034-1 第40 卷第2 期 …

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 …

In this paper, we study the k-error linear complexity of binary sequences with periods pn,
which are derived from new generalized cyclotomic classes modulo a power of an odd …

Abstract Xiao, Zeng, Li and Helleseth proposed new generalized cyclotomic binary
sequences s∞ of period pm and showed that these sequences are almost balanced and …