摘要
介绍了GF(2n)运用仿射坐标的快速算法,在2P+Q的基础上给出了计算形如k1p+k2Q(P≠Q)的算法,并通过验证对其效率加以分析,以(P+Q)+P代替2P+Q算法可以节约时间达到18%左右。
Aim To study the. use of the GF（2″）affine coordinate fast algorithm.Methord To discuss like k1P＋k2Q on the basis of the 2P＋Q algorithm.Results The algorithmis of k1P＋k2Q is obtained.Conclusion Through its application is given, and efficiency analysis verified through （P＋Q）＋P to replace the 2P＋Q algorithm can save time to reach about 18%.
出处
《微计算机信息》
2009年第24期62-63,共2页
Control & Automation
关键词
椭圆曲线
仿射坐标
快速算法
elliptic curve
affine coordinates
fast algorithm
