An efficient deterministic test for Kloosterman sum zeros

From MaRDI portal




Abstract: We propose a simple deterministic test for deciding whether or not an element ainF2nimes or F3nimes 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 cost of the test for binary fields is a single point-halving on an associated elliptic curve, while for ternary fields the expected cost is one half of a point-thirding on an associated elliptic curve. For binary fields of practical interest, this represents an O(n) speedup over the previous fastest test. By repeatedly invoking the test on random elements of F2nimes we obtain the most efficient probabilistic method to date to find non-trivial Kloosterman sum zeros. The analysis depends on the distribution of Sylow p-subgroups in the two families of associated elliptic curves, which we ascertain using a theorem due to Howe.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: An efficient deterministic test for Kloosterman sum zeros

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862534)