Skip to main content
SpringerLink
Log in

Symmetric 2-adic complexity of Tang–Gong interleaved sequences from generalized GMW sequence pair

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

Abstract

Tang–Gong interleaved sequences constructed from the generalized GMW sequence pair are a class of binary sequences with optimal autocorrelation magnitude. In this paper, the symmetric 2-adic complexity of these sequences is investigated. We first derive a lower bound on their 2-adic complexity by extending the method proposed by Hu. Then, by analysing the algebraic structure of these sequences, a lower bound on their symmetric 2-adic complexity is obtained. Our result shows that the symmetric 2-adic complexity of these sequences is large enough to resist attacks with the rational approximation algorithm.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Data availability

No datasets were generated or analysed during the current study.

References

  1. Cai Y., Ding C.: Binary sequences with optimal autocorrelation. Theor. Comput. Sci. 410(24–25), 2316–2322 (2009).

    Article  MathSciNet  Google Scholar 

  2. Du X., Zhao L., Niu Z.: 2-Adic complexity of two classes of generalized cyclotomic binary sequences with order 4. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102(11), 1566–1570 (2019).

    Article  Google Scholar 

  3. Edemskiy V., Sun Y.: The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\). Cryptogr. Commun. 14(2), 183–199 (2022).

    Article  MathSciNet  Google Scholar 

  4. Edemskiy V., Wu C.: Symmetric 2-adic complexity of Ding–Helleseth generalized cyclotomic sequences of period \(pq\). In: International Conference on Information Security and Cryptology, Guangzhou, China, pp. 318–327 (2021).

  5. Golomb S., Gong G.: Signal Design with Good Correlation: For Wireless Communications, Cryptography and Radar Applications. Cambridge University Press (2005).

    Book  Google Scholar 

  6. Gong G.: Theory and applications of \(q\)-ary interleaved sequences. IEEE Trans. Inf. Theory 41(2), 400–411 (1995).

    Article  MathSciNet  Google Scholar 

  7. Gong G.: New designs for signal sets with low cross correlation, balance property, and large linear span: \(GF(p)\) case. IEEE Trans. Inf. Theory 48(11), 2847–2867 (2002).

    Article  MathSciNet  Google Scholar 

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

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

    Article  MathSciNet  Google Scholar 

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

  11. Klapper A., Goresky M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10(2), 111–147 (1997).

    Article  MathSciNet  Google Scholar 

  12. Li N., Tang X.: On the linear complexity of binary sequences of period \(4N\) with optimal autocorrelation value/magnitude. IEEE Trans. Inf. Theory 57(11), 7597–7604 (2011).

    Article  MathSciNet  Google Scholar 

  13. Sun Y., Wang Q., Yan T.: The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation. Cryptogr. Commun. 10(3), 467–477 (2018).

    Article  MathSciNet  Google Scholar 

  14. Sun Y., Wang Q., Yan T.: A lower bound on the 2-adic complexity of the modified Jacobi sequence. Cryptogr. Commun. 11(2), 337–349 (2019).

    Article  MathSciNet  Google Scholar 

  15. Sun Y., Yan T., Chen Z., Wang L.: The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude. Cryptogr. Commun. 12(4), 675–683 (2020).

    Article  MathSciNet  Google Scholar 

  16. Sun Y., Yan T., Wang Q.: The 2-adic complexity of Yu–Gong sequences with interleaved structure and optimal autocorrelation magnitude. Des. Codes Cryptogr. 89(4), 695–707 (2021).

    Article  MathSciNet  Google Scholar 

  17. Tang X., Gong G.: New constructions of binary sequences with optimal autocorrelation value/magnitude. IEEE Trans. Inf. Theory 56(3), 1278–1286 (2010).

    Article  MathSciNet  Google Scholar 

  18. Wang Y., Han X., Wang W., Heng Z.: Linear complexity over \(\text{ F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation. Des. Codes Cryptogr. 90(8), 1695–1712 (2022).

    Article  MathSciNet  Google Scholar 

  19. Xiao Z., Zeng X.: 2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude. Cryptogr. Commun. 13(5), 865–885 (2021).

    Article  MathSciNet  Google Scholar 

  20. Xiao Z., Zeng X., Ke M.: On the symmetric 2-adic complexity of periodic binary sequences. Adv. Math. Commun. (2022). https://doi.org/10.3934/amc.2022088.

    Article  Google Scholar 

  21. Xiao Z., Zeng X., Sun Z.: 2-Adic complexity of two classes of generalized cyclotomic binary sequences. Int. J. Found. Comput. Sci. 27(7), 879–893 (2016).

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  23. Xiong H., Qu L., Li C.: 2-Adic complexity of binary sequences with interleaved structure. Finite Fields Appl. 33, 14–28 (2015).

    Article  MathSciNet  Google Scholar 

  24. Yan M., Yan T., Li Y.: Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products. Cryptogr. Commun. 13(1), 15–26 (2021).

    Article  MathSciNet  Google Scholar 

  25. Yu N., Gong G.: New binary sequences with optimal autocorrelation magnitude. IEEE Trans. Inf. Theory 54(10), 4771–4779 (2008).

    Article  MathSciNet  Google Scholar 

  26. Zhang L., Zhang J., Yang M., Feng K.: On the 2-adic complexity of the Ding-Helleseth-Martinsen binary sequences. IEEE Trans. Inf. Theory 66(7), 4613–4620 (2020).

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous referees for their helpful comments and suggestions. The work of X. Zeng was supported by the National Natural Science Foundation of China under Grant 62072161, and by the Innovation Group Project of the Natural Science Foundation of Hubei Province of China under Grant 2023AFA021. The work of B. Yang, K. He and Z. Xiao was supported by the National Natural Science Foundation of China under Grant 12061027.

Author information

Authors and Affiliations

  1. College of Science, Wuhan University of Science and Technology, Wuhan, 430081, Hubei, China

    Bo Yang, Kangkang He & Zibi Xiao

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

    Xiangyong Zeng

Authors
  1. Bo Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kangkang He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiangyong Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zibi Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

B. Yang and Z. Xiao discussed and developed the basic idea. K. He performed calculations and drafted the manuscript. B. Yang verified the computation and revised the manuscript. X. Zeng and Z. Xiao supplemented the details of the article and polished it. All authors reviewed the manuscript.

Corresponding author

Correspondence to Zibi Xiao.

Ethics declarations

Competing interests

The authors declare no competing interests.

Additional information

Communicated by J. Jedwab.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, B., He, K., Zeng, X. et al. Symmetric 2-adic complexity of Tang–Gong interleaved sequences from generalized GMW sequence pair. Des. Codes Cryptogr. 92, 2473–2489 (2024). https://doi.org/10.1007/s10623-024-01399-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-024-01399-6

Keywords

Mathematics Subject Classification

Search

Navigation