Skew-Frobenius Maps on Hyperelliptic Curves
Skew-Frobenius Maps on Hyperelliptic Curves
复制标题
DOI：
10.1093/ietfec/e91-a.7.1839
复制
发表时间：
2008-07
期刊：
影响因子：
--
通讯作者：
Shun Kozaki;Kazuto Matsuo;Yasutomo Shimbara
中科院分区：
文献类型：
--
作者：
Shun Kozaki;Kazuto Matsuo;Yasutomo Shimbara
使用Frobenius映射的标量乘法方法以加速（超）椭圆曲线密码系统的有效方法而闻名。然而，由于域操作成本的原因，这些方法对于构造在小扩展度域上的密码系统并不有效。Iijima等人表明，可以在椭圆曲线的二次扭转上使用某些自同构进行快速标量乘法，而没有Frobenius映射的缺点。本文给出了任意属超椭圆曲线雅可比矩阵上自同构的一个推广。
Scalar multiplication methods using the Frobenius maps are known for efficient methods to speed up (hyper)elliptic curve cryptosystems. However, those methods are not efficient for the cryptosystems constructed on fields of small extension degrees due to costs of the field operations. Iijima et al. showed that one can use certain automorphisms on the quadratic twists of elliptic curves for fast scalar multiplications without the drawback of the Frobenius maps. This paper shows an extension of the automorphisms on the Jacobians of hyperelliptic curves of arbitrary genus.