2000 character limit reached
On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p (1910.04607v1)
Published 10 Oct 2019 in cs.CR
Abstract: 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.