首页 | 本学科首页   官方微博 | 高级检索  
   检索      

二元Edwards曲线的半分算法
引用本文:林齐平,张方国.二元Edwards曲线的半分算法[J].国防科技大学学报,2012,34(2):21-24.
作者姓名:林齐平  张方国
作者单位:1. 中山大学信息科学与技术学院,广东广州,510006
2. 中山大学信息科学与技术学院,广东广州510006;中国科学院软件研究所,北京100190
摘    要:利用二元Edwards曲线加法公式的对称性得到可做半分的公式.在推导半分算法过程中曲线参数有两种情况:d1≠d2和d1=d2.当曲线参数d1≠d2时,利用和Weierstrass曲线的双有理等价关系、迹函数和半迹函数,得到了Edwards曲线的半分算法.而当曲线参数d1=d2时,给出了定理证明,虽然在这种情况下倍加公式更简单,但半分算法反而更复杂.进一步分析了半分算法的效率,指出虽然在二元Edwards曲线上可以进行半分运算,但目前半分算法的效率仍然比不上倍加方法.利用ω一坐标简化半分算法并应用在标量乘计算上.

关 键 词:点半分  二元Edwards曲线  ω-坐标
收稿时间:2011/7/28 0:00:00

Halving on binary Edwards curves
LIN Qiping and ZHANG Fangguo.Halving on binary Edwards curves[J].Journal of National University of Defense Technology,2012,34(2):21-24.
Authors:LIN Qiping and ZHANG Fangguo
Institution:1,2(1.School of Information Science and Technology,Sun Yat-sen University,Guangzhou 510006,China; 2.Institute of Software,Chinese Academy of Sciences,Beijing 100190,China)
Abstract:The formulas of binary Edwards curves which can be halved are transformed from the doubling ones by using the symmetry of the formulas.Two situations are to be handled in the derivation by the parameters of the curves.In the case of d1≠d2,it is naturally to get a halving algorithm by using the relation of birational equivalence from the Weierstrass curves,the trace functions and the half-trace functions.In the case of d1=d2,a theorem is given to prove it.It is not easy to get a halving algorithm,although the doubling formulas are simpler in this case.Then the efficiency of the halving algorithm is analyzed.The result shows that the efficiency of the halving algorithm cannot catch up with that of the doubling one.Using the ω-coordinate,the halving algorithm is simplified,and is further used to compute the scalar multiplication.
Keywords:point halving  binary Edwards curves  ω-coordinate
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《国防科技大学学报》浏览原始摘要信息
点击此处可从《国防科技大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号