On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p

10/10/2019

∙

by   Chenhuang Wu, et al.

∙

0

∙

share

We consider the k-error linear complexity of binary sequences derived from Eluer quotients modulo 2p (p>3 is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of k-error linear complexity for all k>0. Our results indicate that such sequences have good stability from the viewpoint of cryptography.