An efficient deterministic test for Kloosterman sum zeros
An efficient deterministic test for Kloosterman sum zeros
We propose a simple deterministic test for deciding whether or not an element $a \in \mathbb {F}_{2^n}^{\times }$ or $\mathbb {F}_{3^n}^{\times }$ is a zero of the corresponding Kloosterman sum over these fields, and rigorously analyse its runtime. The test seems to have been overlooked in the literature. The expected …