Article ID Journal Published Year Pages File Type
4949834 Discrete Applied Mathematics 2017 6 Pages PDF
Abstract
We study the divisibility by 3k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3k divides the Kloosterman sum K(a). This gives a new test for zeros of such Kloosterman sums.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On Kloosterman sums over finite fields of characteristic 3
Authors
, ,