Published in

Institute of Electrical and Electronics Engineers, IEEE Transactions on Computers, 4(61), p. 591-592, 2012

DOI: 10.1109/tc.2011.109

Links

Tools

Export citation

Search in Google Scholar

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

Journal article published in 2012 by Mun-Kyu Lee
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

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.