AbstractIn a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums K(a) over a finite field F2m were evaluated modulo 24 in the case m odd, and the number of those a giving the same value for K(a) modulo 24 was given. In this paper the same is done in the case m even. The key techniques used in this paper are different from those used in the aforementioned work. In particular, we exploit recent results on the number of irreducible polynomials with prescribed coefficients
AbstractLet pm be any prime power and Kn(a,pm) be the Kloosterman sum Kn(a,pm)=∑x1=1pm⋯∑xn=1pmepm(x1...
AbstractWe introduce Kloosterman polynomials over F2m, and use these polynomials to prove three iden...
Abstract. Let pm be any prime power and Kn(a, pm) be the Kloosterman sum Kn(a, pm) = ∑pm x1=1 · · ·...
AbstractIn a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums K(a) over a finite fie...
Abstract. Recently Garashuk and Lisonek evaluated Kloosterman sums K(a) modulo 4 over a finite field...
AbstractLet K(a) be the so-called classical Kloosterman sum over F2m. In this paper, we compute K(a)...
AbstractIn a previous paper, we studied the cosets of weight 4 of binary extended 3-error-correcting...
Recently Garashuk and Lisonek evaluated Kloosterman sums K (a) modulo 4 over a finite field F3m ...
AbstractGaraschuk and Lisoněk (2008) in [3] characterised ternary Kloosterman sums modulo 4, leaving...
We extend to the setting of polynomials over a finite field certain estimates for short Kloosterman ...
AbstractLet K(a) denote the Kloosterman sum on F3m. It is easy to see that K(a)≡2(mod3) for all a∈F3...
Kloosterman sums are exponential sums on finite fields with important applications in Cryptography a...
AbstractWhile most proofs of the Weil bound on one-variable Kloosterman sums over finite fields are ...
AbstractRecently, Shin and Sung found new identities for Kloosterman sums over F2m with odd m. They ...
AbstractWe estimate sums of Kloosterman sums for a real quadratic number field F of the typeS=∑c|N(c...
AbstractLet pm be any prime power and Kn(a,pm) be the Kloosterman sum Kn(a,pm)=∑x1=1pm⋯∑xn=1pmepm(x1...
AbstractWe introduce Kloosterman polynomials over F2m, and use these polynomials to prove three iden...
Abstract. Let pm be any prime power and Kn(a, pm) be the Kloosterman sum Kn(a, pm) = ∑pm x1=1 · · ·...
AbstractIn a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums K(a) over a finite fie...
Abstract. Recently Garashuk and Lisonek evaluated Kloosterman sums K(a) modulo 4 over a finite field...
AbstractLet K(a) be the so-called classical Kloosterman sum over F2m. In this paper, we compute K(a)...
AbstractIn a previous paper, we studied the cosets of weight 4 of binary extended 3-error-correcting...
Recently Garashuk and Lisonek evaluated Kloosterman sums K (a) modulo 4 over a finite field F3m ...
AbstractGaraschuk and Lisoněk (2008) in [3] characterised ternary Kloosterman sums modulo 4, leaving...
We extend to the setting of polynomials over a finite field certain estimates for short Kloosterman ...
AbstractLet K(a) denote the Kloosterman sum on F3m. It is easy to see that K(a)≡2(mod3) for all a∈F3...
Kloosterman sums are exponential sums on finite fields with important applications in Cryptography a...
AbstractWhile most proofs of the Weil bound on one-variable Kloosterman sums over finite fields are ...
AbstractRecently, Shin and Sung found new identities for Kloosterman sums over F2m with odd m. They ...
AbstractWe estimate sums of Kloosterman sums for a real quadratic number field F of the typeS=∑c|N(c...
AbstractLet pm be any prime power and Kn(a,pm) be the Kloosterman sum Kn(a,pm)=∑x1=1pm⋯∑xn=1pmepm(x1...
AbstractWe introduce Kloosterman polynomials over F2m, and use these polynomials to prove three iden...
Abstract. Let pm be any prime power and Kn(a, pm) be the Kloosterman sum Kn(a, pm) = ∑pm x1=1 · · ·...