Skip to main content
SpringerLink
Log in

Symmetric 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Period pq

  • Conference paper
  • First Online:
Information Security and Cryptology (Inscrypt 2020)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12612))

Included in the following conference series:

Abstract

In this paper, we consider Ding-Helleseth generalized cyclotomic sequences of length pq where p and q are odd distinct primes. We derive symmetric 2-adic complexity of these sequences for any p, q and show that they have high symmetric 2-adic complexity. These results generalize known conclusions of Yan et al. (IEEE Access, 2020, https://doi:10.1109/ACCESS.2020.3012570) about 2-adic complexity of Ding-Helleseth sequences of order 2 and of length pq.

V. Edemskiy were supported by RFBR-NSFC according to the research project No. 19-51-53003, C. Wu was partially supported by the Projects of International Cooperation and Exchange NSFC-RFBR No. 61911530130, by the National Natural Science Foundation of China No. 61373140, 61772292 and by the Natural Science Foundation of Fujian Province No. 2020J01905.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  MathSciNet  Google Scholar 

  2. Edemskiy, V., Sokolovskiy, N.: Notes about the linear complexity of Ding-Helleseth generalized cyclotomic sequences of length pq over the finite field of order \(p\) or \(q\). In: ITM Web of Conferences, vol. 9, p. 01005 (2017)

    Google Scholar 

  3. Golomb, S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967)

    MATH  Google Scholar 

  4. Hofer, R., Winterhof, A.: On the 2-adic complexity of the two-prime generator. IEEE Trans. Inf. Theory 64(8), 5957–5960 (2018)

    Article  MathSciNet  Google Scholar 

  5. Hu, H.: Comments on “a new method to compute the 2-adic complexity of binary sequences”. IEEE Trans. Inform. Theory 60, 5803–5804 (2014)

    Article  MathSciNet  Google Scholar 

  6. Hu, H., Feng, D.: On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences. IEEE Trans. Inf. Theory 54(2), 874–883 (2008)

    Article  MathSciNet  Google Scholar 

  7. Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Graduate Texts in Mathematics. Springer, New York (1990). https://doi.org/10.1007/978-1-4757-2103-4

  8. Klapper, A., Goresky, M.: Cryptanalysis based on 2-adic rational approxiamtion. In: CRYPTO 1995, LNCS, vol. 963, pp. 262–273 (1995)

    Google Scholar 

  9. Klapper, A., Goresky, M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10(2), 111–147 (1997). https://doi.org/10.1007/s001459900024

    Article  MathSciNet  MATH  Google Scholar 

  10. 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 E90-A(9), 2037–2041 (2007)

    Google Scholar 

  11. Li, S., Chen, Z., Fu, X., Xiao, G.: The autocorrelation values of new generalized cyclotomic sequences of order two and length \(pq\). J. Comput. Sci. Technol. 22(6), 830–834 (2007). https://doi.org/10.1007/s11390-007-9099-2

    Article  MathSciNet  Google Scholar 

  12. Sun, Y., Wang, Q., Yan, T.: The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation. Cryptography and Communications 10(3), 467–477 (2017). https://doi.org/10.1007/s12095-017-0233-x

    Article  MathSciNet  MATH  Google Scholar 

  13. Sun, Y., Yan, T., Chen, Z., Wang, L.: The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude. Cryptography and Communications 12(4), 675–683 (2019). https://doi.org/10.1007/s12095-019-00411-4

    Article  MathSciNet  MATH  Google Scholar 

  14. Sun, Y., Wang, Q., Yan, T.: A lower bound on the 2-adic comeplxity of the modified Jacobi sequences. Cryptogr. Commun. 11(2), 337–349 (2019). https://doi.org/10.1007/s12095-018-0300-y

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  16. Xiao, Z., Zeng X., Sun, Z.: 2-Adic complexity of two classes of generalized cyclotomic binary sequences. Internationl Journal of Foundations of Comput. Sci. 27(7), 879–893 (2016)

    Google Scholar 

  17. Xiong, H., Qu, L., Li, C.: A new method to compute the 2-adic complexity of binary sequences. IEEE Trans. Inform. Theory 60, 2399–2406 (2014)

    Article  MathSciNet  Google Scholar 

  18. 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 E90-A (4), 857–864 (2007)

    Google Scholar 

  19. Yan, T., Chen, Z., Xiao, G.: Linear complexity of Ding generalized cyclotomic sequences. Journal of Shanghai University 11(1), 22–26 (2007). https://doi.org/10.1007/s12095-018-0343-0

    Article  MathSciNet  MATH  Google Scholar 

  20. Yang, M., Feng, K.: Determination of 2-adic complexity of generalized binary sequences of order 2. arXiv:2007.15327

  21. Yan, M., Yan, T., Li, Y.: Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products. arXiv:1912.06134

  22. Yan, M., Yan, T., Sun, Y., Sun, S.: The 2-Adic complexity of ding-Helleseth generalized cyclotomic sequences of order 2 and period \(pq\). IEEE Access 8, 140682–140687 (2020). https://doi.org/10.1109/ACCESS.2020.3012570

    Article  Google Scholar 

  23. Zhang, L., Zhang, J., Yang, M., Feng, K.: On the 2-Adic complexity of the Ding-Helleseth-Martinsen binary sequences. IEEE Trans. Inform. Theory (2020). https://doi.org/10.1109/TIT.2020.2964171

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yaroslav-the-Wise Novgorod State University, Veliky Novgorod, Russia

    Vladimir Edemskiy

  2. Provincial Key Laboratory of Applied Mathematics, Putian University, Putian, 351100, Fujian, China

    Chenhuang Wu

  3. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 611731, Sichuan, China

    Chenhuang Wu

Authors
  1. Vladimir Edemskiy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chenhuang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vladimir Edemskiy .

Editor information

Editors and Affiliations

  1. Jinan University, Guangzhou, China

    Yongdong Wu

  2. Computer Science Department, Columbia University, New York, NY, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Edemskiy, V., Wu, C. (2021). Symmetric 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Period pq. In: Wu, Y., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2020. Lecture Notes in Computer Science(), vol 12612. Springer, Cham. https://doi.org/10.1007/978-3-030-71852-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-71852-7_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-71851-0

  • Online ISBN: 978-3-030-71852-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation