arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1104.3882math.NTcs.CR
收藏

Kloosterman和零点的一个有效确定性检验

An efficient deterministic test for Kloosterman sum zeros

Omran Ahmadi, Robert Granger

摘要:

我们提出了一个简单的确定性测试,以决定是否元素$a \in \F_{2^n}^{\times}$或$\F_{3^n}^{\times}$是零的相应Kloosterman和这些字段,并严格分析其运行时。这个测试在文献中似乎被忽略了。二进制域的测试的期望成本是在相关的椭圆曲线上的单个点减半,而对于三进制域,期望成本是在相关的椭圆曲线上的点三分之一。对于实际感兴趣的二进制字段,这表示比以前最快的测试有O(n)的加速。通过反复调用测试随机元的$\F_{2^n}^{\times}$,我们获得了最有效的概率方法,以找到非平凡的Kloosterman和零。分析取决于分布的Sylow $p$ -子群在两个家庭的相关椭圆曲线,我们确定使用一个定理,由于豪。

英文摘要:

We propose a simple deterministic test for deciding whether or not an element $a \in \F_{2^n}^{\times}$ or $\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 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 $\F_{2^n}^{\times}$ 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑