Cryptology ePrint Archive: Report 2018/964

Fast Scalar Multiplication for Elliptic Curves over Prime Fields by Efficiently Computable Formulas

Saud Al Musa and Guangwu Xu

Abstract: This paper addresses fast scalar multiplication for elliptic curves over finite fields. In the first part of the paper, we obtain several efficiently computable formulas for basic elliptic curves arithmetic in the family of twisted Edwards curves over prime fields. Our $2Q+P$ formula saves about $2.8$ field multiplications, and our $5P$ formula saves about $4.2$ field multiplications in standard projective coordinate systems, compared to the latest existing results. In the second part of the paper, we formulate bucket methods for the DAG-based and the tree-based abstract ideas. We propose systematically finding a near optimal chain for multi-base number systems (MBNS). These proposed bucket methods take significantly less time to find a near optimal chain, compared to an optimal chain. We conducted extensive experiments to compare the performance of the MBNS methods (e.g., greedy, ternary/binary, multi-base NAF, tree-based, rDAG-based, and bucket). Our proposed formulas were integrated in these methods. Our results show our work had an important role in advancing the efficiency of scalar multiplication.

Category / Keywords: public-key cryptography / twisted Edwards curves, Edwards curves, scalar multiplication, efficient formulas, DBNS, MBNS

Date: received 9 Oct 2018, last revised 18 Oct 2018

Contact author: gxu4uwm at uwm edu

Available format(s): PDF | BibTeX Citation

Version: 20181018:192229 (All versions of this report)

Short URL: ia.cr/2018/964


[ Cryptology ePrint archive ]