Skip to main content
SpringerLink
Log in

Linear Complexity of r-ary Sequences Derived from Euler Quotients Modulo 2p

  • Conference paper
  • First Online:
Book cover Artificial Intelligence and Security (ICAIS 2019)

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

Included in the following conference series:

Abstract

Based on the Euler quotient modulo 2p (p is an odd prime), we extend the binary sequence with period \(2p^2\) to r-ary sequence where r is an odd prime divisor of \((p-1)\). We determine exact values of the linear complexity of the new sequences under the assumption \(r^{p-1}\not \equiv 1 \pmod {p^2}\), which are larger than half of the period. For cryptographic purpose, the linear complexities of the sequences in this paper are of desired values.

Supported by National Natural Science Foundation of China (61763044).

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. Chen, Z.: Linear complexity of some binary sequences derived from Fermat quotients. China Commun. 9(2), 105–110 (2012)

    MathSciNet  Google Scholar 

  2. Chen, Z.: Trace representation and linear complexity of binary sequences derived from Fermat quotients. Sci. China Inf. Sci. 57(11), 1–10 (2014)

    MathSciNet  Google Scholar 

  3. Chen, Z., Du, X.: On the linear complexity of binary threshold sequences derived from Fermat quotients. Des. Codes Cryptogr. 67(3), 317–323 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, Z., Du, X., Marzouk, R.: Trace representation of pseudorandom binary sequences derived from Euler quotients. Appl. Algebr. Eng. Commun. Comput. 26(6), 555–570 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dai, Z., Gong, G., Song, H.: A trace representation of binary Jacobi sequences. Discrete Math. 309(6), 1517–1527 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dai, Z., Gong, G., Song, H., Ye, D.: Trace representation and linear complexity of binary \(e\)-th power residue sequences of period \(p\). IEEE Trans. Inf. Theory 57(3), 1530–1547 (2011)

    MathSciNet  MATH  Google Scholar 

  7. Dai, Z., Gong, G., Song, H., Ye, D.: Trace representation and linear complexity of binary e-th residue sequences. In: International Workshop on Coding and Cryptography-WCC, pp. 121–133 (2003)

    Google Scholar 

  8. Du, X., Klapper, A., Chen, Z.: Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. Inf. Process. Lett. 112, 233–237 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Du, X., Chen, Z., Hu, L.: Linear complexity of binary sequences derived from Euler quotients with prime-power modulus. Inf. Process. Lett. 112(14–15), 604–609 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Du, X.: An extension of binary threshold sequences from Fermat quotients. Adv. Math. Commun. 10(4), 745–754 (2016)

    Article  MathSciNet  Google Scholar 

  11. Golomb, S., Gong, G.: Signal Design for Good Correlation. Cambridge University Press, Cambridge (2015)

    MATH  Google Scholar 

  12. Jungnickel, D.: Finite Fields, Structure and Arithmetics. Biblographiches Institute, Mannheim (1993)

    MATH  Google Scholar 

  13. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  14. Massey, J.L.: Shift register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122–127 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  15. Wu, C., Wei, W.: An extension of binary threshold sequences from Fermat quotients. Adv. Math. Commun. 10(4), 743–752 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wu, C., Chen, Z., Du, X.: Binary threshold sequences derived from Carmichael quotients with even numbers modulus. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E95-A(7), 1197–1199 (2012)

    Article  Google Scholar 

  17. Xiong, L., Shi, Y.: On the privacy-preserving outsourcing scheme of reversible data hiding over encrypted image data in cloud computing. CMC: Comput. Mater. Contin. 55(3), 523–539 (2018)

    MathSciNet  Google Scholar 

  18. Xu, W., Xiang, S., Sachnev, V.: A cryptograph domain image retrieval method based on Paillier homomorphic block encryption. CMC: Comput. Mater. Contin. 055(2), 285–295 (2018)

    Google Scholar 

  19. Zhang, J., Zhao, C.: Linear complexity and trace representation of sequences with period \(2p^2\). In: IEEE International Symposium on Information Theory, pp. 2206–2210 (2018)

    Google Scholar 

  20. Zhao, L., Du, X., Wu, C.: Trace representation of the sequences derived from polynomial quotient. In: Sun, X., Pan, Z., Bertino, E. (eds.) ICCCS 2018. LNCS, vol. 11066, pp. 26–37. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00015-8_3

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou, 730070, Gansu, People’s Republic of China

    Rayan Mohammed, Xiaoni Du & Li Li

Authors
  1. Rayan Mohammed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoni Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Li Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoni Du .

Editor information

Editors and Affiliations

  1. Nanjing University of Information Science and Technology, Nanjing, China

    Xingming Sun

  2. Nanjing University of Information Science and Technology, Nanjing, China

    Zhaoqing Pan

  3. Purdue University, West Lafayette, IN, USA

    Elisa Bertino

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mohammed, R., Du, X., Li, L. (2019). Linear Complexity of r-ary Sequences Derived from Euler Quotients Modulo 2p. In: Sun, X., Pan, Z., Bertino, E. (eds) Artificial Intelligence and Security. ICAIS 2019. Lecture Notes in Computer Science(), vol 11634. Springer, Cham. https://doi.org/10.1007/978-3-030-24271-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24271-8_10

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation