On the Cryptographic Properties of Binary 2<sup>n</sup>-periodic Sequences

CHANG Zuling; WEN Qiaoyan

Article Contents

Article Navigation > Chinese Journal of Electronics > 2011 > 20(2): 307-311

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 2ⁿ-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 2ⁿ-periodic Sequences,” Chinese Journal of Electronics, vol. 20, no. 2, pp. 307-311, 2011,

PDF( 220 KB)

On the Cryptographic Properties of Binary 2ⁿ-periodic Sequences

Received Date: 2010-08-01
Rev Recd Date: 2010-10-01
Publish Date: 2011-04-25

Abstract

Abstract

New properties and methods about the linear complexity and the k-error linear complexity of binary 2ⁿ-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.
- Sequence,
- Games-Chan algorithm,
- Linearcomplexity,
- k-error linear complexity,
- Critical error sequence