CHANG Zuling and WEN Qiaoyan, “On the Cryptographic Properties of Binary 2n-periodic Sequences,” Chinese Journal of Electronics, vol. 20, no. 2, pp. 307-311, 2011,
Citation:
CHANG Zuling and WEN Qiaoyan, “On the Cryptographic Properties of Binary 2n-periodic Sequences,” Chinese Journal of Electronics, vol. 20, no. 2, pp. 307-311, 2011,
CHANG Zuling and WEN Qiaoyan, “On the Cryptographic Properties of Binary 2n-periodic Sequences,” Chinese Journal of Electronics, vol. 20, no. 2, pp. 307-311, 2011,
Citation:
CHANG Zuling and WEN Qiaoyan, “On the Cryptographic Properties of Binary 2n-periodic Sequences,” Chinese Journal of Electronics, vol. 20, no. 2, pp. 307-311, 2011,
New properties and methods about the linear complexity and the k-error linear complexity of binary 2n-periodic sequences are provided. Using Games-Chan algorithm and new method, we give some new results about k-error linear complexity, and the method to count the number of critical error sequences is also provided.