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

Pseudorandom sequences play an important role in communication and stream ciphers. In recent years, the method of generating pseudorandom sequences based on arithmetical functions has attracted increasing attention. k-error linear complexity is an important index to evaluate the stability of a sequence. Recently, J. Zhang and C. Zhao introduced binary sequences derived from Euler quotients modulo 2p (where p > 3 is an odd prime). In this paper, the k-error linear complexity of such sequences over F2 was considered with the condition that 2 is a primitive root modulo p2. Certain decimal sequences were used to determine the values of k-error linear complexity for all k > 0. The results showed that such sequences have good stability in terms of cryptography.