Advanced Search
Volume 32 Issue 4
Dec.  2010
Turn off MathJax
Article Contents
Du Xiao-ni, Yan Tong-jiang, Shi Yong-fang. Linear Complexity of Generalized Cyclotomic Sequences with Period pm[J]. Journal of Electronics & Information Technology, 2010, 32(4): 821-824. doi: 10.3724/SP.J.1146.2009.00430
Citation: Du Xiao-ni, Yan Tong-jiang, Shi Yong-fang. Linear Complexity of Generalized Cyclotomic Sequences with Period pm[J]. Journal of Electronics & Information Technology, 2010, 32(4): 821-824. doi: 10.3724/SP.J.1146.2009.00430

Linear Complexity of Generalized Cyclotomic Sequences with Period pm

doi: 10.3724/SP.J.1146.2009.00430
  • Received Date: 2009-03-30
  • Rev Recd Date: 2009-10-19
  • Publish Date: 2010-04-19
  • In this paper, a new class of generalized cyclotomic sequences of period pm(p odd prime and m1) with arbitrary order is constructed and its minimal polynomial is determined. Hence the linear complexity of it is obtained. The possible values of its linear complexity are pointed out, which is pm-1, pm, (pm-1)/2 and (pm+1)/2. The research also indicate that linear complexity of the sequences always take the values as above when the corresponding characteristic sets satisfies certain conditions. The results show that most of these sequences have good linear complexity.
  • loading
  • Golomb S W. Shift Register Sequences[M]. Holden-Day, CA,San Francisco, 1967. Revised edition: Aegean Park, CA,Laguna Hills, 1982, Chapter 2.[2]Ding C. Binary cyclotomic generators [C]. Fast SoftwareEncryption: Berlin: Springer-Veralg, 1995, LNCS 1008:20-60.[3]Cusick T W, Ding C, and Renvall A. Stream Ciphers andNumber Theory[M]. Elsevier, Amsterdam, 1998, Chapter3-8.[4]Ding C and Helleseth T. New generalized cyclotomy and itsapplication[J].Finite Fields Applications.1998, 4(2):140-166[5]Chen Z and Li S. Some notes on generalized cyclotomicsequences of length pq[J].Journal of Computer Science andTechnology.2008, 23(5):843-850[6]Du X, Yan T, and Xiao G. Trace representation of somegeneralized cyclotomic sequences of length pq[J]. InformationSciences, 2008, 178(16): 3307-3316.[7]Ding C, Helleseth T, and Shan W J. On the linear complexityof Legendre sequence[J].IEEE Transaction on InformationTheory.1998, 44(3):1276-1278[8]Yan T, Huang B, and Xiao G. Cryptographic properties ofsome binary generalized cyclotomic sequences with the lengthp2 [J].Information Sciences.2008, 178(4):807-815[9]Du X, Chen Z, Shi A, and Sun R. Trace representation of anew class of sextic sequences of period p=3(mod8) [J]. IEICETransaction on Fundamentals, 2009, E92-A(2): 668-670.[10]Yan T, Sun R, and Xiao G. Autocorrelation and linearcomplexity of the new generalized cyclotomic sequences[J].IEICE Transaction on Fundamentals.2007, E90-A(4):857-864[11]Kim Y J, Jin S Y, and Song H Y. Linear complexity andautocorrelation of prime cube sequences[C]. AAECC 2007,Springer-Verlag Berlin Heidelberg 2007, LNCS 4851:188-197.[12]Yan T, Li S, and Xiao G. On the linear complexity ofgeneralized cyclotomic sequences with the period pm [J].Applied Mathematics Letters.2008, 21(2):187-193[13]Kim Y J and Song H Y. Linear complexity of prime n-squaresequences[C]. ISIT 2008, Toronto, Canada, July 6-11, 2008:2405-2408.[14]Yan T, Du X, and Xiao G. Linear complexity of binaryWhiteman generalized cyclotomic sequences of order 2k [J].Information Sciences, Doi:10.1016/j.ins. 2008. 11. 006.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3601) PDF downloads(857) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return