Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms
Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms
复制标题
DOI：
10.1007/3-540-46035-7_13
复制
发表时间：
2002-05
期刊：
影响因子：
--
通讯作者：
Young-Ho Park;Sangtae Jeong;Jongin Lim
中科院分区：
文献类型：
--
作者：
Young-Ho Park;Sangtae Jeong;Jongin Lim
由于Koblitz曲线被Gunter等人推广到超椭圆Koblitz曲线以实现更快的点乘。[10]我们扩展了Gallant等人最近的工作。[8]到超椭圆曲线因此，加速点乘的扩展方法适用于有限域上具有可有效计算的自同态的更大的超椭圆曲线族。对于这个特殊的曲线族，在亏格g= 2（3）的情况下，对于160位点乘，最好的一般方法可以实现高达55（59）%的加速比。
As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by Gunter, et al.[10] we extend the recent work of Gallant, et al.[8] to hyperelliptic curves. So the extended method for speeding point multiplication applies to a much larger family of hyperelliptic curves over finite fields that have efficiently-computable endomorphisms. For this special family of curves, a speedup of up to 55 (59)% can be achieved over the best general methods for a 160-bit point multiplication in case of genus g= 2 (3).