Efficient Algorithm for Computing Odd-Degree Isogenies on Montgomery Curves
Efficient Algorithm for Computing Odd-Degree Isogenies on Montgomery Curves
复制标题
计算蒙哥马利曲线奇数同基因的高效算法
DOI:
10.1007/978-3-030-65299-9_20
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Miyaji Atsuko
中科院分区:
文献类型:
--
作者:
Kodera Kenta;Cheng Chen-Mou;Miyaji Atsuko
Isogeny-based cryptography, such as commutative supersingular isogeny Diffie-Hellman (CSIDH), has been shown to be promising candidates for post-quantum cryptography. However, their speeds have remained unremarkable. For example, computing odd-degree isogenies between Montgomery curves is a dominant computation in CSIDH. To increase the speed of this isogeny computation, this study proposes a new technique called the “2-ADD-Skip method,” which reduces the required number of points to be computed. This technique is then used to develop a novel algorithm for isogeny computation. It is found that the proposed algorithm requires fewer field arithmetic operations for the degrees ofcompared with the algorithm of Meyeret al., which utilizes twisted Edwards curves. Further, a prototype CSIDH-512 implementation shows that the proposed algorithm can give a 6.7% speedup over the implementation by Meyeret al.Finally, individual experiments for each degree of isogeny show that the proposed algorithm requires the lowest number of clock cycles among existing algorithms for.
登录
查看更多内容
DOI:
10.1007/978-3-030-30530-7_9
发表时间:
2019
期刊:
IACR Cryptol. ePrint Arch.
影响因子:
--
作者:
Daniel Cervantes;Mathilde Chenu;Jesús;L. D. Feo;F. Rodríguez;Benjamin A. Smith
通讯作者:
Benjamin A. Smith
DOI:
10.1007/978-3-030-25510-7_17
发表时间:
2019
期刊:
IACR Cryptol. ePrint Arch.
影响因子:
--
作者:
Michael Meyer;Fabio Campos;S. Reith
通讯作者:
S. Reith
DOI:
--
发表时间:
2018
期刊:
IACR Cryptology ePrint Archive
影响因子:
--
作者:
Joost Renes
通讯作者:
Joost Renes
DOI:
10.1007/978-3-030-26834-3_2
发表时间:
2019
期刊:
IACR Cryptol. ePrint Arch.
影响因子:
--
作者:
Hiroshi Onuki;Yusuke Aikawa;T. Yamazaki;T. Takagi
通讯作者:
T. Takagi