论文信息 - Comments on "Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation"

Comments on "Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation"

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.

Mun-Kyu Lee | Mun-Kyu Lee

[1] Vassil S. Dimitrov,et al. Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation , 2008, IEEE Transactions on Computers.

[2] Alfred Menezes,et al. Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[3] Jerome A. Solinas,et al. Efficient Arithmetic on Koblitz Curves , 2000, Des. Codes Cryptogr..

[4] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .

[5] Laurent Imbert,et al. Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains , 2005, ASIACRYPT.