Elliptic Curve Cryptography Affine Coordinate the Use of Fast Algorithm
Quan Shuang-yan · Microcomputer Information · 2009
Aim To study the use of the GF(2n) 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%.