Skip to main content

On a Conjecture of Helleseth

  • Conference paper
Algebraic Informatics (CAI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8080))

Included in the following conference series:

Abstract

We are concerned about a conjecture proposed in the middle of the seventies by Hellesseth in the framework of maximal sequences and theirs cross-correlations. The conjecture claims the existence of a zero outphase Fourier coefficient. We give some divisibility properties in this direction.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chabaud, F., Vaudenay, S.: Links between differential and linear cryptanalysis. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356–365. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  2. Dillon, J.F.: Elementary Hadamard Difference Sets. PhD thesis, Univ. of Maryland (1974)

    Google Scholar 

  3. Helleseth, T.: Some results about the cross-correlation function between two maximal linear sequences. Discrete Math. 16(3), 209–232 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  4. Katz, D.J.: Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth. J. Comb. Theory, Ser. A 119(8), 1644–1659 (2012)

    Article  MATH  Google Scholar 

  5. Katz, N., Livné, R.: Sommes de Kloosterman et courbes elliptiques universelles en caractéristiques 2 et 3. C. R. Acad. Sci. Paris Sér. I Math. 309(11), 723–726 (1989)

    MATH  Google Scholar 

  6. Kavut, S., Maitra, S., Yücel, M.D.: Search for boolean functions with excellent profiles in the rotation symmetric class. IEEE Transactions on Information Theory 53(5), 1743–1751 (2007)

    Article  Google Scholar 

  7. Keijo, K., Marko, R.A., Keijoe, V.: On integer value of Kloosterman sums. IEEE Trans. Info. Theory (2010)

    Google Scholar 

  8. Lachaud, G., Wolfmann, J.: Sommes de Kloosterman, courbes elliptiques et codes cycliques en caractéristique 2. C. R. Acad. Sci. Paris Sér. I Math. 305, 881–883 (1987)

    MathSciNet  MATH  Google Scholar 

  9. Lang, S.: Cyclotomic fields I and II, 2nd edn. Graduate Texts in Mathematics, vol. 121. Springer, New York (1990), With an appendix by Karl Rubin

    Google Scholar 

  10. Langevin, P.: Numerical projects page (2007), http://langevin.univ-tln.fr/project/spectrum

  11. Pursley, M.B., Sarwate, D.V.: Cross correlation properties of pseudo-random and related sequences. Proc. IEEE 68, 593–619 (1980)

    Article  Google Scholar 

  12. Tao, F.: On cyclic codes of length \({2^{2^r}-1}\) with two zeros whose dual codes have three weights. Designs, Codes and Cryptography 62(3) (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aubry, Y., Langevin, P. (2013). On a Conjecture of Helleseth. In: Muntean, T., Poulakis, D., Rolland, R. (eds) Algebraic Informatics. CAI 2013. Lecture Notes in Computer Science, vol 8080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40663-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40663-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40662-1

  • Online ISBN: 978-3-642-40663-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics