Journal of Computer Science and Technology

, Volume 22, Issue 3, pp 481–486 | Cite as

Some Notes on Prime-Square Sequences

  • En-Jian BaiEmail author
  • Xiao-Juan Liu
Short Paper


The well-known binary Legendre sequences possess good autocorrelation functions and high linear complexity, and are just special cases of much larger families of cyclotomic sequences. Prime-square sequences are the generalization of these Legendre sequences, but the ratio of the linear complexity to the least period of these sequences approximates to zero if the prime is infinite. However, a relatively straightforward modification can radically improve this situation. The structure and properties, including linear complexity, minimal polynomial, and autocorrelation function, of these modified prime-square sequences are investigated. The hardware implementation is also considered.


cyclotomy autocorrelation linear complexity sequence 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

11390_2007_9042_MOESM1_ESM.pdf (57 kb)
Supplementary material - Chinese Abstract (PDF 57 kb)


  1. [1]
    Massey J L. Shift register synthesis and BCH decoding. IEEE Trans. Inform. Theory, 1969, 15(1): 122–127.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Calabro D, Wolf J K. On the synthesis of two-dimensional arrays with desirable correlation properties. Inf. Control, 1967, 11(5/6): 537–560.zbMATHCrossRefGoogle Scholar
  3. [3]
    Ding C, Helleseth T, Shan W. On the linear complexity of Legendre sequences. IEEE Trans. Inform. Theory, 1998, 44(3): 1276–1282.CrossRefMathSciNetGoogle Scholar
  4. [4]
    Ding C. Linear complexity of some generalized cyclotomic sequences. International Journal on Algebra and Computation, 1998, 8(4): 431–442.zbMATHCrossRefGoogle Scholar
  5. [5]
    Park Y H, Hong D, Chun E. On the linear complexity of some generalized cyclotomic sequences. International Journal on Algebra and Computation, 2004, 14(4): 431–439.zbMATHCrossRefGoogle Scholar
  6. [6]
    Ding C. Binary cyclotomic generator. Fast Software Encryption, Lecture Notes in Comput. Sci. 1008, Springer, Berlin, 1995, pp.29–60.Google Scholar
  7. [7]
    Bai E, Liu X, Xiao G. Linear complexity of new generalized cyclotomic sequences of order two of length pq. IEEE Trans. Inform. Theory, 2005, 51(5): 1849–1853.CrossRefMathSciNetGoogle Scholar
  8. [8]
    Lidl R, Niederreiter H. Finite Fields. Reading, MA: Addison-Wesley, 1983.zbMATHGoogle Scholar
  9. [9]
    Ding C. Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Trans. Inform. Theory, 1998, 44(4): 1699–1702.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    Ding C, Helleseth T. New generalized cyclotomy and its applications. Finite Fields and Their Applications, 1998, 4(2): 140–166.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    Storer T. Cyclotomy and Difference Sets. Chicago: Markham, 1967.zbMATHGoogle Scholar

Copyright information

© Science Press, Beijing, China and Springer Science + Business Media, LLC, USA 2007

Authors and Affiliations

  1. 1.School of Information Science and TechnologyDonghua UniversityShanghaiChina
  2. 2.State Key Laboratory of Information SecurityGraduate University of Chinese Academy of SciencesBeijingChina
  3. 3.Department of Information and Computing ScienceShanghai University of Electric PowerShanghaiChina

Personalised recommendations