The divisibility modulo 24 of Kloosterman sums on $GF(2^m)$, $m$ even
Combinatorics
2008-02-16 v2
Abstract
In a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums over a finite field were evaluated modulo 24 in the case odd, and the number of those giving the same value for modulo 24 was given. In this paper the same is done in the case 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.
Keywords
Cite
@article{arxiv.0801.2988,
title = {The divisibility modulo 24 of Kloosterman sums on $GF(2^m)$, $m$ even},
author = {Marko Moisio},
journal= {arXiv preprint arXiv:0801.2988},
year = {2008}
}
Comments
15 pages, submitted; an annoying typo corrected in the abstract