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 alr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 2012-04, Vol.61 (4), p.591-592
1. Verfasser: Lee, Mun-Kyu
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Computational efficiency
Elliptic curve cryptography
Elliptic curves
Koblitz curves
Markov processes
Memory management
sublinearity
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2011.109