2-Adic Complexity of Self-Shrinking Sequence

Huijuan WANG  Qiaoyan WEN  Jie ZHANG  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E94-A   No.11   pp.2462-2465
Publication Date: 2011/11/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E94.A.2462
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Cryptography and Information Security
linear complexity,  2-adic complexity,  self-shrinking sequence,  

Full Text: PDF>>
Buy this Article

This paper studies the 2-adic complexity of the self-shrinking sequence under the relationship between 2-adic integers and binary sequences. Based on the linear complexity and the number of the sequences which have the same connection integer, we conclude that the 2-adic complexity of the self-shrinking sequence constructed by a binary m-sequence of order n has a lower bound 2n-2-1. Furthermore, it is shown that its 2-adic complexity has a bigger lower bound under some circumstances.