Theory and applications for a double-base number system
ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Designs, Codes and Cryptography
Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
IEEE Transactions on Computers
New Point Addition Formulae for ECC Applications
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
A Tree-Based Approach for Computing Double-Base Chains
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
The Jacobi model of an elliptic curve and side-channel analysis
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Improved techniques for fast exponentiation
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Optimizing double-base elliptic-curve single-scalar multiplication
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Faster addition and doubling on elliptic curves
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Extended double-base number system with applications to elliptic curve cryptography
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient and secure elliptic curve point multiplication using double-base chains
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Fractional windows revisited: improved signed-digit representations for efficient exponentiation
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
ISC'07 Proceedings of the 10th international conference on Information Security
Using 5-isogenies to quintuple points on elliptic curves
Information Processing Letters
Fast scalar multiplication for ECC over GF(p) using division chains
WISA'10 Proceedings of the 11th international conference on Information security applications
| Hi-index | 0.00 |
Recently, the new Multibase Non-Adjacent Form (mb NAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases to represent the scalar. In this work, we first optimize the previous method using fractional windows, and then introduce further improvements to achieve additional cost reductions. Moreover, we present new improvements in the point operation formulae. Specifically, we reduce further the cost of composite operations such as quintupling and septupling of a point, which are relevant for the speed up of multibase methods in general. Remarkably, our tests show that, in the case of standard elliptic curves, the refined mb NAF method can be as efficient as Window-w NAF using an optimal fractional window size. Thus, this is the first published method that does not require precomputations to achieve comparable efficiency to the standard window-based NAF method using precomputations. On other highly efficient curves as Jacobi quartics and Edwards curves, our tests show that the refined mb NAF currently attains the highest performance for both scenarios using precomputations and those without precomputations.