| 优化扩域上椭圆曲线标量乘的一个新算法 |
| |
| 引用本文： | 刘铎,戴一奇.优化扩域上椭圆曲线标量乘的一个新算法[J].电子学报,2005,33(8):1451-1456. |
| |
| 作者姓名： | 刘铎 戴一奇 |
| |
| 作者单位： | 清华大学计算机科学与技术系,北京,100084;清华大学计算机科学与技术系,北京,100084 |
| |
| 摘 要： | 提出了一种优化扩域上椭圆曲线标量乘的新算法.算法基于Frobenius映射和二进制串的逻辑操作.文中对这个算法给出了细致精确的分析,而且在此基础上对新算法作了进一步改进.最后从理论分析和实际仿真两个方面就新算法和传统算法进行了比较.指出新算法执行时间比传统的φ-adic算法要少20%到40%.
|
| 关 键 词： | 密码学 椭圆曲线 优化扩域 Frobenius 标量乘 |
| 文章编号： | 0372-2112（2005）08-1451-06 |
| 收稿时间： | 2004-12-07 |
| 修稿时间： | 2004-12-072005-05-01 |
A New Method of Scalar Multiplication of Elliptic Curve over OEF |
| |
| LIU Duo,DAI Yi-qi.A New Method of Scalar Multiplication of Elliptic Curve over OEF[J].Acta Electronica Sinica,2005,33(8):1451-1456. |
| |
| Authors: | LIU Duo DAI Yi-qi |
| |
| Affiliation: | Department of Computer Science and Technology,Tsinghua University,Beijing 100084,China |
| |
| Abstract: | Elliptic curve cryptosystem is the focus of public cryptology nowadays,for it has many advantages which the RSA lacks.In this paper,a new elliptic curve scalar multiplication algorithm is proposed.The algorithm uses the Frobenius map on optimal extension field (OEF) and the logic operations of binary strings.Based on this algorithm,a new method of computing scalar multiplication of elliptic curve over an OEF is presented.The accurate analysis about it is given.The comparisons of traditional method and the new method are presented.The running time of new method is about 60%~80% of that of the traditional φ-adic scalar multiplication algorithms of elliptic curve over OEF. |
| |
| Keywords: | Frobenius |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
