Skip to main content
SpringerLink
Log in

The linear complexity and 4-adic complexity of quaternary sequences with period pq

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

Quaternary sequences with high linear complexity and N-adic complexity have been widespread concerned in cryptography. By using the Gray mapping, we construct a new class generalized cyclotomic quaternary sequences with period pq over \({\mathbb {Z}}_4\). We determine the linear complexity over \(\mathbb F_4\) and 4-adic complexity of the sequences. The results show that these sequences have high linear complexity and 4-adic complexity.

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. Chen, Z.X.: Linear complexity and trace representation of quaternary sequences over \(Z_4\) based on generalized cyclotomic classes modulo \(pq\). Cryptog. Commun. 9, 445–458 (2017)

    Article  MATH  Google Scholar 

  2. Cusick, T., Ding, C.S., Renvall, A.: Stream Ciphers and Number Theory. Elsevier, Amsterdam (1998)

    MATH  Google Scholar 

  3. Ding, C.S.: Cyclotomic constructions of cyclic codes with length being the product of two primes. IEEE Trans. Inf. Theory. 58, 2231–2236 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Edemskiy, V.: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\). Des. Codes Cryptogr. 61, 251–260 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Edemskiy, V., Chen, Z.X.: On the 4-adic complexity of the two-prime quaternary generator. J. Appl. Math. Comput. (2022). https://doi.org/10.1007/s12190-200-01740-z

    Article  MathSciNet  MATH  Google Scholar 

  7. Edemskiy, V., Ivanov, A.: Linear complexity of quaternary sequences of length \(pq\) with low autocorrelation. J. Comput. Applied Math. 15, 555–560 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Li, D.D., Wen, Q.Y., Zhang, J., Chang, Z.L.: Linear complexity of generalized cyclotomic quaternary sequences with period \(pq\). IEICE Trans. Fundam. E97–A, 1153–1158 (2014)

    Article  Google Scholar 

  9. Li, S.Q., Zhou, L., Xiao, G.Z.: Study on a class of Whiteman-generalized cyclotomic sequence with length \(pq\) and order two. J. Electron. Inf. Techn. 31, 2205–2208 (2009)

    Google Scholar 

  10. Liu, H.N., Chen, X.L.: Autocorrelation values and linear complexity of new generalized cyclotomic sequences. Acta Math. Sin. 62, 233–246 (2019)

    MathSciNet  MATH  Google Scholar 

  11. Ma, J., Zhao, W., Jia, Y.G., Jiang, H.Y.: New generalized cyclotomic quaternary sequences with large linear complexity and a product of two primes period. Information. 12, 2078–2489 (2021)

    Article  Google Scholar 

  12. Wang, G.H., Du, X.N., Wan, Y.Q.: Linear complexity of balanced quaternary generalized cyclotomic sequences with period \(pq\). J. Shandong Univ. 51, 145–150 (2016)

    MATH  Google Scholar 

  13. Wei, W.Y., Du, X.N., Li, Z.X., Wan, Y.Q.: Linear complexity of quaternary generalized cyclotomic sequences with period \(pq\). Comput. Sci. 44, 174–176 (2017)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Yang, M.H., Qiang, S.Y., Feng, K.Q., Lin, D.D.: On the 4-adic complexity of quaternary sequences of period \(2p\) with ideal autorrelation. In: Proc. IEEE Int. Symp. Inf. Theory, Electr Network, July 12-July 20, 2021, 1812-1816

  16. Zhang, Y., Ke, P.H.: Construction of quaternary sequences of length \(pq\) with low autocorrelation. Cryptogr. Commun. 3, 55–64 (2011)

Download references

Author information

Authors and Affiliations

  1. Research Center for Number Theory and its Applications, Northwest University, Xi’an, 710127, China

    Chaoran Zhang, Xiaoyan Jing & Zhefeng Xu

Authors
  1. Chaoran Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoyan Jing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhefeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhefeng Xu.

Ethics declarations

Conflict of interest

The authors declare that they have no conflicts of interest to report regarding the present study.

Additional information

Publisher's Note

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

This work is supported by National Natural Science Foundation of China (11971381).

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

Zhang, C., Jing, X. & Xu, Z. The linear complexity and 4-adic complexity of quaternary sequences with period pq. J. Appl. Math. Comput. 69, 2003–2017 (2023). https://doi.org/10.1007/s12190-022-01822-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-022-01822-y

Keywords

Mathematics Subject Classification

Search

Navigation