Skip to main content
SpringerLink
Log in

Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period \(2p^n\)

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

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

Included in the following conference series:

Abstract

In this paper, we construct new q-ary generalized cyclotomic sequences of length \(2p^n\). We study the linear complexity of these sequences over the finite field of order q and show that they have high linear complexity when \(n\ge 2\). These sequences are constructed by new generalized cyclotomic classes presented by Zeng et al.

V. Edemskiy and N. Sokolovskii were supported by RFBR-NSFC according to the research project No. 19-51-53003.

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. Du, X., Chen, Z.: A generalization of the Hall’s sextic residue sequences. Inf. Sci. 222, 784–794 (2013)

    Article  MathSciNet  Google Scholar 

  3. Du, X.N., Wu, C.H., Wei, W.Y.: An extension of binary threshold sequence from Fermat quotient. Adv. Math. Commun. 10(4), 743–752 (2016)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Edemskiy, V., Antonova, O.: The linear complexity of generalized cyclotomic sequences with period \(2p^n\). AAECC 25(3), 213–223 (2014)

    Article  MathSciNet  Google Scholar 

  6. Edemskiy, V., Li, C., Zeng, X., Helleseth, T.: The linear complexity of generalized cyclotomic binary sequences of period \(p^n\). Des. Codes Cryptograph. 87(5), 1183–1197 (2019)

    Article  MathSciNet  Google Scholar 

  7. Edemskiy, V., Wu, C.: On the linear complexity of binary sequences derived from generalized cyclotomic classes modulo \(2^np^m\). WSEAS Trans. Math. 18, 197–202 (2019)

    Google Scholar 

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

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley, Boston (1983)

    Google Scholar 

  11. Ouyang, Y., Xie, X.: Linear complexity of generalized cyclotomic sequences of period \(2p^m\). Des. Codes Crypt. 87, 2585–2596 (2019). https://doi.org/10.1007/s10623-019-00638-5

    Article  MathSciNet  MATH  Google Scholar 

  12. Montgomery, P.L.: New solutions of \(a^{p - 1} \equiv 1 (mod \; p^2)\). Math. Comput. 61(203), 361–363 (1993). Special Issue Dedicated to Derrick Henry Lehmer

    MATH  Google Scholar 

  13. Wu, C., Chen, Z., Du, X.: The linear complexity of \(q\)-ary generalized cyclotomic sequences of period \(p^m\). J. Wuhan Univ. 59(2), 129–136 (2013)

    MathSciNet  MATH  Google Scholar 

  14. Xiao, Z., Zeng, X., Li, C., Helleseth, T.: New generalized cyclotomic binary sequences of period \(p^2\). Des. Codes Cryptograph. 86(7), 1483–1497 (2018)

    Article  MathSciNet  Google Scholar 

  15. 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  Google Scholar 

  16. Ye, Z., Ke, P., Wu, C.: A further study of the linear complexity of new binary cyclotomic sequence of length \(p^n\). AAECC (2018). https://doi.org/10.1007/s00200-018-0368-9

    Article  MATH  Google Scholar 

  17. Ye, Z., Ke, P., Chen, Z.: Linear complexity of \(d\)-ary sequence derived from euler quotients over \(GF(q)\). Chin. J. Electron. 28(3), 529–534 (2019)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  19. Zhang, J.W., Zhao, C.A., Ma, X.: Linear complexity of generalized cyclotomic binary sequences of length \(2p^m\). AAECC 21, 93–108 (2010)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novgorod State University, Veliky Novgorod, Russia

    Vladimir Edemskiy & Nikita Sokolovskii

Authors
  1. Vladimir Edemskiy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikita Sokolovskii
    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. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China

    Zhe Liu

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

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Edemskiy, V., Sokolovskii, N. (2020). Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period \(2p^n\). In: Liu, Z., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2019. Lecture Notes in Computer Science(), vol 12020. Springer, Cham. https://doi.org/10.1007/978-3-030-42921-8_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-42921-8_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-42920-1

  • Online ISBN: 978-3-030-42921-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation