On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients

03/09/2018

∙

by   Zhixiong Chen, et al.

∙

0

∙

share

We investigate the k-error linear complexity of pseudorandom binary sequences derived from the Euler quotients modulo p^r, a power of an odd prime p. The contribution extends the earlier results for the binary sequences defined by polynomial quotients (including Fermat quotients) modulo p. Exactly speaking, we establish a recursive relation on the k-error linear complexity of the sequences. And we state the exact values of the k-error linear complexity for the case of r=3. Results indicate that the binary sequences considered have nice cryptographic features-they have high linear complexity and keep stability if changing a few terms.