
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2p^{2}
Jingwei ZHANG ChangAn ZHAO Xiao MA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E93A
No.1
pp.302308 Publication Date: 2010/01/01 Online ISSN: 17451337
DOI: 10.1587/transfun.E93.A.302 Print ISSN: 09168508 Type of Manuscript: PAPER Category: Cryptography and Information Security Keyword: binary sequence, generalized cyclotomy, linear complexity,
Full Text: PDF(186KB)>>
Summary:
In this paper, we compare two generalized cyclotomic binary sequences with length 2p^{2} in terms of the linear complexity. One classical sequence is defined using the method introduced by Ding and Helleseth, while the other modified sequence is defined in a slightly different manner. We show that the modified sequence has linear complexity of 2p^{2}, which is higher than that of the classical one.

