CROct 10, 2019
On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p
arXiv:1910.04607v13 citations
Originality Synthesis-oriented
AI Analysis
This work provides incremental analysis for cryptographic sequences, relevant to researchers in cryptography and coding theory.
The authors determined the k-error linear complexity for binary sequences derived from Euler quotients modulo 2p, showing these sequences have good cryptographic stability.
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.