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.
|