Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Efficient Scalar Multiplications for Elliptic Curve Cryptosystems Using Mixed Coordinates Strategy and Direct Computations
verfasst von : Roghaie Mahdavi, Abolghasem Saiadian
Erschienen in: Cryptology and Network Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Scalar multiplication is the heart of elliptic curve cryptosystems. Several techniques have been proposed for efficient scalar multiplication. Mixed coordinate strategy is a useful technique for implementing efficient scalar multiplication. It splits a scalar multiplication into a few parts, and performs each part in the best coordinate. Also, the running time of scalar multiplication can be reduced by applying direct computations in the evaluation stage. This technique directly computes points of the form 2
P
+
Q
from points
P
and
Q
on the elliptic curve. In this paper, we apply mixed coordinate strategy and direct computations to various scalar multiplication algorithms such as binary method, NAF and window NAF methods, MOF and window MOF methods to find the best combinations of mixed coordinates strategy and direct computations for scalar multiplication with respect to the computational costs and memory consumption.