We study divisibility by eight of exponential sums of several classes of functions over finite elds of characteristic two. For the binary classical Kloosterman sums K(a) over such fi elds we give a simple recurrent algorithm for finding the largest k, such that 2k divides the Kloosterman sum K(a). This gives a simple description of zeros of such Kloosterman sums.