Binary Kloosterman sums using Stickelberger's theorem and the Gross-Koblitz formula

2010/05/25 by Faruk Göloğlu, G. E. McGuire, Gologlu, Faruk +3
Mathematics · Computer Science · #Analytic Number Theory Research #Coding theory and cryptography #Finite Group Theory Research

paper · pdf · doi:10.48550/arxiv.1005.4548

Abstract

Let K(a) denote the Kloosterman sum on the finite field of order 2ⁿ. We give a simple characterization of K(a) modulo 16, in terms of the trace of a and one other function. We also give a characterization of K(a) modulo 64 in terms of a different function, which we call the lifted trace. Our proofs use Fourier analysis, Stickelberger's theorem and the Gross-Koblitz formula.

Related

• Ternary Kloosterman sums using Stickelberger's theorem and the Gross-Koblitz formula
• Some Congruences of Kloosterman Sums and their Minimal Polynomials
• A lower bound for classical Kloosterman sums and an application
• On the degree of a Kloosterman sum as an algebraic integer
• An identity for the Kloosterman sum