On Kloosterman sums over finite fields of characteristic 3

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.