Skip to main content

Trace Representation of the Sequences Derived from Polynomial Quotient

  • Conference paper
  • First Online:
Cloud Computing and Security (ICCCS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11066))

Included in the following conference series:

Abstract

The discrete Fourier transform and trace representation of certain sequences can help generate the sequences efficiently and analyse their cryptographic properties. In this paper, we first determine the defining pairs of the binary sequences derived from a class of polynomial quotient modulo an odd prime p and the Legendre symbol. We then derive the discrete Fourier transform and the trace representation of this class of sequences.

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

Access this chapter

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. Blahut, R.E.: Transform techniques for error control codes. IBM J. Res. Develop. 23, 299–315 (1979). https://doi.org/10.1147/rd.233.0299

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, Z.: Trace representation and linear complexity of binary sequences derived from Fermat quotient. Sci. China Inf. Sci. 57, 1–10 (2014). https://doi.org/10.1007/s11432-014-5092-x

    Article  MathSciNet  Google Scholar 

  3. Chen, Z., Du, X.: On the linear complexity of binary threshold sequences derived from Fermat quotient. Des. Codes Cryptogr. 67, 317–323 (2013). https://doi.org/10.1007/s10623-012-9608-3

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, Z., Gómez-Pérez, D.: Linear complexity of binary sequences derived from polynomial quotients. In: Helleseth, T., Jedwab, J. (eds.) SETA 2012. LNCS, vol. 7280, pp. 181–189. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30615-0_17

    Chapter  Google Scholar 

  5. Chen, Z.: Linear complexity of Legendre-polynomial quotient. arXiv:1705.01380

  6. Chen, Z., Winterhof, A.: Additive character sums of polynomial quotient. Contemp. Math., Amer. Math. Soc., Providence, RI. 579, 67–73 (2012). https://doi.org/10.1090/conm/579/11519

  7. Cusick, T., Ding, C., Renvall, A.: Stream ciphers and number theory, North-Holland Mathematical Library, vol. 55 (1998)

    Google Scholar 

  8. Dai, Z., Gong, G., Song, H.Y.: A trace representation of binary Jacobi sequences. Discrete Math. 309, 1517–1527 (2009). https://doi.org/10.1016/j.disc.2008.02.024

    Article  MathSciNet  MATH  Google Scholar 

  9. 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. Inform. Theory 57, 1530–1547 (2011). https://doi.org/10.1109/TIT.2010.2103757

    Article  MathSciNet  MATH  Google Scholar 

  10. Ernvall, R., Metsänkylä, T.: On the \(p\)-divisibility of Fermat quotient. Math. Comp. 66, 1353–1365 (1997). https://doi.org/10.1090/S0025-5718-97-00843-0

    Article  MathSciNet  MATH  Google Scholar 

  11. Golomb, S.W.: Shift Register Sequences, Holden-Day, CA, San Francisco (1967). Revised edition: Aegean Park, CA, Laguna Hills (1982)

    Google Scholar 

  12. Shparlinski, I.E.: Character sums with Fermat quotient. Q. J. Math. 62(4), 1031–1043 (2011)

    Article  MathSciNet  Google Scholar 

  13. Jungnickel, D.: Finite Fields, Structure and Arithmetics, Bibliographisches Institut, Mannheim (1993)

    Google Scholar 

  14. Kim, J.H., Song, H.Y.: Trace representation of Legendre sequences. Des. Codes Cryptogr. 24, 343–348 (2001). https://doi.org/10.1023/A:1011287607979

    Article  MathSciNet  MATH  Google Scholar 

  15. Kim, J.H., Song, H.Y., Gong, G.: Trace representation of Hall’s sextic residue sequences of period \(p\equiv 7 ~(\text{mod} \; 8)\). In: Mathematical Properties of Sequences and Other Combinatorial Structures 2002, Int’l Series in Engineering and Computer Science, vol. 579, pp. 23–32. Springer, Boston (2003). https://doi.org/10.1007/978-1-4615-0304-04

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

    MATH  Google Scholar 

Download references

Acknowledgement

X. N. Du was partially supported by the National Natural Science Foundation of China (grants No. 61462077 and 61772022). C. Wu is partially supported by the National Natural Science Foundation of China (grant No. 61772292) and 2016 Development Program for Distinguished Young Scientific Research Talent of Universities in Fujian Province.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liping Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, L., Du, X., Wu, C. (2018). Trace Representation of the Sequences Derived from Polynomial Quotient. In: Sun, X., Pan, Z., Bertino, E. (eds) Cloud Computing and Security. ICCCS 2018. Lecture Notes in Computer Science(), vol 11066. Springer, Cham. https://doi.org/10.1007/978-3-030-00015-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00015-8_3

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics