Skip to main content
SpringerLink
Log in

Some Notes on Generalized Cyclotomic Sequences of Length pq

  • Short Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

We review the constructions of two main kinds of generalized cyclotomic binary sequences with length pq (the product with two distinct primes). One is the White-generalized cyclotomic sequences, the other is the Ding-Helleseth(DH, for short)-generalized cyclotomic sequences. We present some new pseudo-random properties of DH-generalized cyclotomic sequences using the theory of character sums instead of the theory of cyclotomy, which is a conventional method for investigating generalized cyclotomic sequences.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cusick T W, Ding C, Renvall A. Stream Ciphers and Number Theory. Amsterdam: Elsevier, 1998.

    Book  MATH  Google Scholar 

  2. Ding C. Binary cyclotomic generators. Fast Software Encryption, Lecture Notes in Comput. Sci., Berlin: Springer-Verlag, Vol. 1008, 1995, pp.20–60.

    Google Scholar 

  3. Ding C. Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields and Their Applications, 1997, 3(2): 159–174.

    Article  MATH  MathSciNet  Google Scholar 

  4. Ding C, Helleseth T. New generalized cyclotomy and its applications. Finite Fields and Their Applications, 1998, 4(2): 140–166.

    Article  MATH  MathSciNet  Google Scholar 

  5. Ding C. Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Transactions on Information Theory, 1998, 44(4): 1699–1702.

    Article  MATH  Google Scholar 

  6. Whiteman A L. A family of difference sets. Illinois J. Math., 1962, 6: 107–121.

    MATH  MathSciNet  Google Scholar 

  7. Ding C. Pattern distributions of Legendre sequences. IEEE Transactions on Information Theory, 1998, 44(4): 1693–1698.

    Article  MATH  Google Scholar 

  8. Ding C, Helleseth T, Shan W. On the linear complexity of Legendre sequences. IEEE Transactions on Information Theory, 1998, 44(3): 1276–1278.

    Article  MathSciNet  Google Scholar 

  9. Mauduit C, Sárközy A. On finite pseudorandom binary sequences I: Measures of pseudorandomness, the Legendre symbol. Acta Arithmetica, 1997, 82: 365–377.

    MATH  MathSciNet  Google Scholar 

  10. Cassaigne J, Mauduit C, Sárközy A. On finite pseudorandom binary sequences, VII: The measures of pseudorandomness. Acta Arithmetica, 2002, 103: 97–118.

    Article  MATH  MathSciNet  Google Scholar 

  11. Chen Z. Finite binary sequences constructed by explicit inversive methods. Finite Fields and Their Applications, 2007, DOI: 10.1016/j.ffa.2007.08.002.

  12. Gyarmati K. On a family of pseudorandom binary sequences. Periodica Mathematica Hungarica, 2004, 49(2): 45–63.

    Article  MATH  MathSciNet  Google Scholar 

  13. Rivat J, Sárközy A. Modular constructions of pseudorandom binary sequences with composite moduli. Periodica Math. Hungarica, 2005, 51(2): 75–107.

    Article  MATH  Google Scholar 

  14. Dai Z D, Gong G, Song H Y. Trace representation of binary Jacobi sequences. Technical Reports CORR 2002-32, 2002, http://www.cacr.math.uwaterloo.ca/.

  15. Bai E, Fu X, Xiao G. On the linear complexity of generalized cyclotomic sequences of order four over Z pq . IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, 2005, E88-A(1): 392–395.

    Article  Google Scholar 

  16. Bai E. Study on construction and randomness analysis of pseudorandom sequences [Dissertation]. Xidian University, China, 2004. (in Chinese)

  17. Brandstätter N, Winterhof A. Some notes on the two-prime generator of order 2. IEEE Transactions on Information Theory, 2005, 51(10): 3654–3657.

    Article  Google Scholar 

  18. Lidl R, Niederreiter H. Finite Fields. Reading: Addison-Wesley, MA, 1983.

    MATH  Google Scholar 

  19. Chen Z, Du X, Xiao G. Sequences related to Legendre/Jacobi sequences. Information Sciences, 2007, 177(21): 4820–4831.

    Article  MATH  MathSciNet  Google Scholar 

  20. Li S, Chen Z, Sun R, Xiao G. On the randomness of generalized cyclotomic sequences of order two and length pq. IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, 2007, E90-A(9): 2037–2041.

    Article  Google Scholar 

  21. Li S, Chen Z, Fu X, Xiao G. The autocorrelation values of new generalized cyclotomic sequences of order two and length pq. Journal of Computer Science and Technology, 2007, 22(6): 830–834.

    Article  MathSciNet  Google Scholar 

  22. Bai E, Liu X, Xiao G. Linear complexity of new generalized cyclotomic sequences of order two of length pq. IEEE Transactions on Information Theory, 2005, 51(5): 1849–1853.

    Article  MathSciNet  Google Scholar 

  23. Yan T, Sun R, Xiao G. Autocorrelation and linear complexity of the new generalized cyclotomic sequences. IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, 2007, E90-A (4): 857–864.

    Article  Google Scholar 

  24. Yan T, Hong L, Xiao G. The linear complexity of new generalized cyclotomic binary sequences of order four. Information Sciences, 2008, 178(3): 807–815.

    Article  MATH  MathSciNet  Google Scholar 

  25. Yan T, Chen Z, Xiao G. Linear complexity of Ding generalized cyclotomic sequences. Journal of Shanghai University, 2007, 11(1): 22–26.

    Article  MATH  MathSciNet  Google Scholar 

  26. Du X, Yan T, Xiao G. Trace representation of some generalized cyclotomic sequences of length pq. Information Sciences, 2008, 178(16): 3307–3316.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Lab of Applied Mathematics, Putian University, Putian, 351100, China

    Zhi-Xiong Chen

  2. Key Lab of Network Security and Cryptology, Fujian Normal University, Fuzhou, 350007, China

    Zhi-Xiong Chen

  3. National Key Lab of Communication, University of Electronic Science and Technology of China, Chengdu, 610054, China

    Sheng-Qiang Li

Authors
  1. Zhi-Xiong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheng-Qiang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhi-Xiong Chen.

Additional information

This work was supported in part by the Open Funds of Key Lab of Fujian Province University Network Security and Cryptology (Grant No. 07B005), the Funds of the Education Department of Fujian Province (Grant No. JA07164) and the Natural Science Foundation of Fujian Province of China (Grant No. 2007F3086).

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 74.4 kb).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, ZX., Li, SQ. Some Notes on Generalized Cyclotomic Sequences of Length pq . J. Comput. Sci. Technol. 23, 843–850 (2008). https://doi.org/10.1007/s11390-008-9167-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9167-2

Keywords

Search

Navigation