%0 Journal Article
%T Speeding Scalar Multiplication of Elliptic Curve over GF(2^mn)
%A Ding Yong
%A Yin-Fang Hong
%A Wei-Tao Wang
%A Yuan-Yuan Zhou
%J International Journal of Network Security
%D 2010
%I Femto Technique
%X Lee et al. proposed two methods to speed up the computation of scalar multiplication of elliptic curve defined over GF(2^{mn}) with a medium size of m in the range 10 leq m leq 20. In these methods, Frobenius map is utilized to expand the integer k and each coefficient of the expansion is represented as a binary string. In this paper, with the application of joint sparse form (JSF) to the coefficients, some variations of Lee et al.'s methods are proposed to achieve a better performance at a lower storage requirement.
%K Elliptic curve cryptography
%K frobenius map
%K joint sparse form
%K scalar multiplication
%U http://ijns.femto.com.tw/download_paper.jsp?PaperID=IJNS-2009-04-03-1&PaperName=ijns-v11-n2/ijns-2010-v11-n2-p70-77.pdf