Cryptology ePrint Archive: Report 2008/118
Setting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication
Patrick Longa and Catherine Gebotys
Abstract: In this paper, we introduce the Fractional Window-w Multibase Non-Adjacent Form (Frac-wmbNAF) method to perform the scalar multiplication. This method generalizes the recently developed Window-w mbNAF (wmbNAF) method by allowing an unrestricted number of precomputed points. We then make a comprehensive analysis of the most recent and relevant methods existent in the literature for the ECC scalar multiplication, including the presented generalization and its original non-window version known as Multibase Non-Adjacent Form (mbNAF). Moreover, we present new improvements in the point operation formulae. Specifically, we reduce further the cost of composite operations such as doubling-addition, tripling, quintupling and septupling of a point, which are relevant for the speed up of methods using multiple bases. Following, we also analyze the precomputation stage in scalar multiplications and present efficient schemes for the different studied scenarios. Our analysis includes the standard elliptic curves using Jacobian coordinates, and also Edwards curves, which are gaining growing attention due to their high performance. We demonstrate with extensive tests that mbNAF is currently the most efficient method without precomputations not only for the standard curves but also for the faster Edwards form. Similarly, Frac-wmbNAF is shown to attain the highest performance among window-based methods for all the studied curve forms.
Category / Keywords: public-key cryptography / Elliptic curve cryptosystem, scalar multiplication, multibase non-adjacent form, fractional windows, point operation, composite operation, precomputation scheme.
Publication Info: CACR technical report (University of Waterloo)
Date: received 16 Mar 2008
Contact author: plonga at uwaterloo ca
Available format(s): PDF | BibTeX Citation
Version: 20080317:042516 (All versions of this report)
Short URL: ia.cr/2008/118
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]