Skip to main content
SpringerLink
Log in

New generalized cyclotomic binary sequences of period \(p^2\)

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

New generalized cyclotomic binary sequences of period \(p^2\) are proposed in this paper, where p is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result shows that the proposed sequences have very large linear complexity if p is a non-Wieferich prime.

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. Apostol T.M.: Introduction to Analytic Number Theory. Springer, New York (1976).

    MATH  Google Scholar 

  2. Bai E., Liu X., Xiao G.: Linear complexity of new generalized cyclotomic sequences of order two of length \(pq\). IEEE Trans. Inf. Theory 51(5), 1849–1853 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  3. Cusick T.W., Ding C., Renvall A.: Stream Ciphers and Number Theory. Elsevier Science B.V, Amsterdam (1998).

    MATH  Google Scholar 

  4. Cassaigne J., Mauduit C., Sárközy A.: On finite pseudorandom binary sequences VII: the measure of pseudorandomness of pseudorandomness. Acta Arith. 103(2), 97–118 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  5. Ding C.: Binary cyclotomic generators. Fast Software Encryption. Lecture Notes in Computer Science, vol. 1008, pp. 29–60. Springer, Leuven (1995).

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Ding C.: Linear complexity of some generalized cyclotomic sequences. Int. J. Algebra Comput. 08(4), 431–442 (1998).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Ding C., Helleseth T.: Generalized cyclotomy codes of length \(p_1^{m_1}p_2^{m_2} \ldots p_t^{m_t}\). IEEE Trans. Inf. Theory 45(2), 467–474 (1999).

    Article  Google Scholar 

  11. Ding C., Helleseth T., Lam K.Y.: Several classes of binary sequences with three-level autocorrelation. IEEE Trans. Inf. Theory 45(7), 2606–2612 (1999).

    Article  MathSciNet  MATH  Google Scholar 

  12. Dorais F.G., Klyve D.: A Wieferich prime search up to \(6.7\times 10^{15}\). J. Integer Seq. 14(9), (2011). https://cs.uwaterloo.ca/journals/JIS/VOL14/Klyve/klyve3.html

  13. Du X., Chen Z.: A generalization of the Hall’s sextic residue sequences. Inf. Sci. 222, 784–794 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  14. Fan C., Ge G.: A unified approach to Whiteman’s and Ding-Helleseth’s generalized cyclotomy over residue class ring. IEEE Trans. Inf. Theory 60(2), 1326–1336 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  15. Hu L., Yue Q., Wang M.: The linear complexity of Whiteman’s generalized cyclotomic sequences of period \(p^{m+1}q^{n+1}\). IEEE Trans. Inf. Theory 58(8), 5534–5543 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  16. Ke P., Zhang J., Zhang S.: On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\). Des. Codes Cryptogr. 67(3), 325–339 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  17. Kim J.H., Song H.Y.: On the linear complexity of Hall’s sextic residue sequences. IEEE Trans. Inf. Theory 47(5), 2094–2096 (2001).

    Article  MathSciNet  MATH  Google Scholar 

  18. Kim Y.J., Jin S.Y., Song H.Y.: Linear complexity and autocorrelation of prime cube sequences. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Lecture Notes in Computer Science, vol. 4851, pp. 188–197. Springer, Berlin (2007).

  19. Mauduit C., Sárközy A.: On finite pseudorandom binary sequences I: measure of pseudorandomness, the Legendre symbol. Acta Arith. 82(4), 365–377 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  20. Niederreiter H.: Linear complexity and related complexity measures for sequences. Progress in Cryptology-INDOCRYPT. Lecture Notes in Computer Science, vol. 2904, pp. 1–17. Springer, Berlin (2003).

  21. Turyn R.J.: The linear generation of the Legendre sequence. J. Soc. Ind. Appl. Math. 12(1), 115–116 (1964).

    Article  MathSciNet  MATH  Google Scholar 

  22. Whiteman A.L.: A family of difference sets. Illionis J. Math. 6(1), 107–121 (1962).

    MathSciNet  MATH  Google Scholar 

  23. Yan T., Huang B., Xiao G.: Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^2\). Inf. Sci. 178(4), 1078–1086 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  24. Yan T., Li S., Xiao G.: On the linear complexity of generalized cyclotomic sequences with the period \(p^m\). Appl. Math. Lett. 21(2), 187–193 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  25. Zeng X., Cai H., Tang X., Yang Y.: Optimal frequency hopping sequences of odd length. IEEE Trans. Inf. Theory 59(5), 3237–3248 (2013).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The work of X. Zeng was supported by the National Natural Science Foundation of China (NSFC) under Grant 61472120.

Author information

Authors and Affiliations

  1. Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, 430062, China

    Zibi Xiao & Xiangyong Zeng

  2. College of Science, Wuhan University of Science and Technology, Wuhan, 430081, China

    Zibi Xiao

  3. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China

    Xiangyong Zeng

  4. Department of Informatics, University of Bergen, Bergen, Norway

    Chunlei Li & Tor Helleseth

Authors
  1. Zibi Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiangyong Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chunlei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tor Helleseth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiangyong Zeng.

Additional information

Communicated by G. Mullen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiao, Z., Zeng, X., Li, C. et al. New generalized cyclotomic binary sequences of period \(p^2\) . Des. Codes Cryptogr. 86, 1483–1497 (2018). https://doi.org/10.1007/s10623-017-0408-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-017-0408-7

Keywords

Mathematics Subject Classification

Search

Navigation