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

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

2010-05-25

arxiv.org/abs/1005.4548v2

Mathematics

Number Theory

Minor error corrected in final section

Scientific paper

Let $\mathcal{K}(a)$ denote the Kloosterman sum on the finite field of order $2^n$. We give a simple characterization of $\mathcal{K}(a)$ modulo 16, in terms of the trace of $a$ and one other function. We also give a characterization of $\mathcal{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.

Affiliated with

Also associated with

No associations

Rating

Binary Kloosterman sums using Stickelberger's theorem and the Gross-Koblitz formula does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Binary Kloosterman sums using Stickelberger's theorem and the Gross-Koblitz formula, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary Kloosterman sums using Stickelberger's theorem and the Gross-Koblitz formula will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-298076