Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Journal of Cryptology
An algorithm for modular exponentiation
Information Processing Letters
Theory and Applications of the Double-Base Number System
IEEE Transactions on Computers
Elliptic curves in cryptography
Elliptic curves in cryptography
Efficient elliptic curve exponentiation
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Designs, Codes and Cryptography
Extending scalar multiplication using double bases
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
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
An analysis of double base number systems and a sublinear scalar multiplication algorithm
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
FPGA implementation of point multiplication on koblitz curves using kleinian integers
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
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
Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
New formulae for efficient elliptic curve arithmetic
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
A graph theoretic analysis of double base number systems
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Optimizing double-base elliptic-curve single-scalar multiplication
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Efficient window-based scalar multiplication on elliptic curves using double-base number system
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Using 5-isogenies to quintuple points on elliptic curves
Information Processing Letters
Efficient arithmetic on hessian curves
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
ISC'07 Proceedings of the 10th international conference on Information Security
A new algorithm for computing triple-base number system
ACM SIGARCH Computer Architecture News
| Hi-index | 0.00 |
We investigate the impact of larger digit sets on the length of Double-Base Number system (DBNS) expansions. We present a new representation system called extended DBNS whose expansions can be extremely sparse. When compared with double-base chains, the average length of extended DBNS expansions of integers of size in the range 200–500 bits is approximately reduced by 20% using one precomputed point, 30% using two, and 38% using four. We also discuss a new approach to approximate an integer n by d2a3b where d belongs to a given digit set. This method, which requires some precomputations as well, leads to realistic DBNS implementations. Finally, a left-to-right scalar multiplication relying on extended DBNS is given. On an elliptic curve where operations are performed in Jacobian coordinates, improvements of up to 13% overall can be expected with this approach when compared to window NAF methods using the same number of precomputed points. In this context, it is therefore the fastest method known to date to compute a scalar multiplication on a generic elliptic curve.