Minimal polynomials of Kloosterman zeros

Abstract

Kloosterman sums are exponential sums on finite fields
with important applications in Cryptography and Coding Theory.
Of particular interest are Kloosterman zeros, which are
field elements on which the Kloosterman sum attains the value 0.
For Kloosterman zeros in fields of characteristic 2, we study
relations among coefficients of their minimal polynomials over GF(2).
There is an interesting interplay between computational methods
and mathematical proofs.

Details