...
首页> 外文期刊>Designs, Codes and Crytography >On the Computation of Square Roots in Finite Fields
【24h】

On the Computation of Square Roots in Finite Fields

机译:关于有限域中平方根的计算

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, two improvements for computing square roots in finite fields are presented. Firstly, we give a simple extension of a method by O. Atkin, which requires two exponentiations in F_q, when q ≡ 9 mod 16. Our second method gives a major improvement to the Cipolla-Lehmer algorithm, which is both easier to implement and also much faster. While our method is independent of the power of 2 in q ― 1. its expected running time is equivalent to 1.33 as many multiplications as exponentiation via square and multiply. Several numerical examples are given that show the speed-up of the proposed methods, compared to the routines employed by Mathematica, Maple, respectively Magma.
机译:本文提出了两种在有限域中计算平方根的改进方法。首先,我们给出O. Atkin方法的简单扩展,当q extension 9 mod 16时,它需要F_q有两个指数。我们的第二种方法对Cipolla-Lehmer算法进行了重大改进,既易于实现又易于实现。也快得多。虽然我们的方法不受q -1中2的幂的限制,但其预期运行时间等于1.33乘以平方和乘的幂。与Mathematica,Maple和Magma分别采用的例程相比,给出了几个数值示例,这些示例说明了所提出方法的速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号