Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
复制标题
评估大程度同源性及其在基于配对的密码学中的应用
DOI：
10.1007/978-3-540-85538-5_7
复制
发表时间：
2008
期刊：
影响因子：
3.7
通讯作者：
K. Lauter
中科院分区：
文献类型：
--
作者：
Reinier Bröker;D. Charles;K. Lauter
提出了一种计算有限域上椭圆曲线大次同构的新方法。以前的方法都有指数运行时间的对数的程度。如果自同态环的椭圆曲线是“小”，我们可以做得更好，我们提出了一个算法的运行时间是多项式的对数的程度。我们给出了几个应用程序，我们的技术对基于密码学。
We present a new method to evaluate large degree isogenies between elliptic curves over finite fields. Previous approaches all have exponentialrunning time in the logarithm of the degree. If the endomorphism ring of the elliptic curve is `small' we can do much better, and we present an algorithm with a running time that is polynomialin the logarithm of the degree. We give several applications of our techniques to pairing based cryptography.