Title :
Comments on "Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation”
Author_Institution :
Sch. of Comput. & Inf. Eng., Inha Univ., Incheon, South Korea
fDate :
4/1/2012 12:00:00 AM
Abstract :
In 2008, Dimitrov et al. proposed a point multiplication algorithm on Koblitz curves using multiple-base expansions. They claimed that their algorithm is the first provably sublinear point multiplication algorithm on Koblitz curves. In this paper, we show that the well-known τ-adic NAF method is already sublinear and also guarantees a better average performance.
Keywords :
public key cryptography; Koblitz curves; hardware implementation; multiple base expansions; sublinear point multiplication; Algorithm design and analysis; Computational efficiency; Elliptic curve cryptography; Elliptic curves; Markov processes; Memory management; Elliptic curve cryptography; Koblitz curves; sublinearity.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2011.109
