求模p的平方根的一种算法
An algorithm for finding square root modulo p
摘要:
本文提出了一种求模p平方根的新算法。虽然存在一个计算模素数(3 mod 4)的元素的平方根的直接公式,但计算模素数(1 mod 4)的平方根并不简单。Tonelli-Shanks算法仍然是最广泛使用的,并且在所有素数上平均时可能是最快的[19]。本文提出了一种求模所有奇素数的平方根的新算法,该算法在运行时间上与Tonelli-Shanks算法相同,但在实际应用中比现有算法有了改进.除了实际有效的计算时间,所提出的方法不一定需要非剩余的可用性,也可以与“相对非剩余”。与非残基(概率1/2)相比,这种“相对非残基”更容易找到(概率2/3)。
英文摘要:
We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial. Tonelli-Shanks algorithm remains the most widely used and probably the fastest when averaged over all primes [19]. This paper proposes a new algorithm for finding square roots modulo all odd primes, which shows improvement over existing method in practical terms although asymptotically gives the same run time as Tonelli-Shanks. Apart from practically efficient computation time, the proposed method does not necessarily require availability of non-residue and can work with `relative non-residue' also. Such `relative non-residues' are much easier to find ( probability 2/3) compared to non-residues ( probability 1/2).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。