Abstract
A result due to Helleseth and Zinoviev characterises binary Kloosterman sums modulo 8. We give a similar result for ternary Kloosterman sums modulo 9. This leads to a complete characterisation of values that ternary Kloosterman sums assume modulo 18. The proof uses Stickelberger’s theorem and Fourier analysis.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Charpin, P., Helleseth, T., Zinoviev, V.: The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd. Journal of Combinatorial Theory 114, 332–338 (2007)
Dillon, J.F.: Elementary Hadamard Difference Sets. PhD thesis, University of Maryland (1974)
Garaschuk, K., Lisoněk, P.: On ternary Kloosterman sums modulo 12. Finite Fields Appl. 14(4), 1083–1090 (2008)
Garaschuk, K., Lisoněk, P.: On binary Kloosterman sums divisible by 3. Designs, Codes and Cryptography 49, 347–357 (2008)
Gross, B.H., Koblitz, N.: Gauss sums and the p-adic Γ-function. Ann. of Math. (2) 109(3), 569–581 (1979)
Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inform. Theory 52(5), 2018–2032 (2006)
Helleseth, T., Zinoviev, V.: On ℤ4-linear Goethals codes and Kloosterman sums. Designs, Codes and Cryptography 17, 269–288 (1999)
Katz, N., Livné, R.: Sommes de Kloosterman et courbes elliptiques universelles caractéristiques 2 et 3. C. R. Acad. Sci. Paris Sér. I. Math. 309(11), 723–726 (1989)
Katz, N.M.: Gauss sums, Kloosterman sums, and monodromy groups. Annals of Mathematics Studies, vol. 116. Princeton University Press, Princeton (1988)
Lachaud, G., Wolfmann, J.: The weights of the orthogonals of the extended quadratic binary Goppa codes. IEEE Trans. Inform. Theory 36(3), 686–692 (1990)
Langevin, P., Leander, G.: Monomial bent functions and Stickelberger’s theorem. Finite Fields and Their Applications 14, 727–742 (2008)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1986)
Lisoněk, P.: On the connection between Kloosterman sums and elliptic curves. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds.) SETA 2008. LNCS, vol. 5203, pp. 182–187. Springer, Heidelberg (2008)
Lisoněk, P., Moisio, M.: On zeros of Kloosterman sums (to appear 2009)
Moisio, M.: The divisibility modulo 24 of Kloosterman sums on GF(2m), m even. Finite Fields and Their Applications 15, 174–184 (2009)
Robert, A.: The Gross-Koblitz formula revisited. Rendiconti del Seminario Matematico della Università di Padova 105, 157–170 (2001)
van der Geer, G., van der Vlugt, M.: Kloosterman sums and the p-torsion of certain Jacobians. Math. Ann. 290(3), 549–563 (1991)
Wan, D.Q.: Minimal polynomials and distinctness of Kloosterman sums. Finite Fields Appl. 1(2), 189–203 (1995); Special issue dedicated to Leonard Carlitz
Washington, L.C.: Introduction to Cyclotomic Fields. Springer, Heidelberg (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Göloğlu, F., McGuire, G., Moloney, R. (2010). Ternary Kloosterman Sums Modulo 18 Using Stickelberger’s Theorem. In: Carlet, C., Pott, A. (eds) Sequences and Their Applications – SETA 2010. SETA 2010. Lecture Notes in Computer Science, vol 6338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15874-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-15874-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15873-5
Online ISBN: 978-3-642-15874-2
eBook Packages: Computer ScienceComputer Science (R0)