arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.07795cs.DScs.DM
收藏

Jacobi符号的有效计算

Efficient computation of the Jacobi symbol

Niels Möller

摘要:

从左到右的GCD算法家族通过从较大的数字中反复减去较小的数字或较小数字的倍数来减少输入数字。本文介绍了如何扩展任何这样的算法来计算雅可比符号,使用一个单一的查表每减少。对于二次时间GCD算法(Euclid,Lehmer)和次二次算法(Knuth,Schönhage,Möller),额外的成本是线性的,大约是商序列中每个商一个查表。这种方法被用于2010年GMP中Jacobi符号计算的重写。

英文摘要:

The family of left-to-right GCD algorithms reduces input numbers by repeatedly subtracting the smaller number, or multiple of the smaller number, from the larger number. This paper describes how to extend any such algorithm to compute the Jacobi symbol, using a single table lookup per reduction. For both quadratic time GCD algorithms (Euclid, Lehmer) and subquadratic algorithms (Knuth, Schönhage, Möller), the additional cost is linear, roughly one table lookup per quotient in the quotient sequence. This method was used for the 2010 rewrite of the Jacobi symbol computation in GMP.

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

↑