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

TL;DR

This paper investigates the k-error linear complexity of binary sequences based on Euler quotients modulo 2p, revealing their cryptographic stability and providing comprehensive values for all k>0.

Contribution

It introduces a method to determine k-error linear complexity for sequences derived from Euler quotients modulo 2p, highlighting their cryptographic robustness.

Findings

Sequences exhibit good stability in linear complexity.

Complete values of k-error linear complexity are determined for all k>0.

Sequences are suitable for cryptographic applications.

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.