Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Software Implementation of the NIST Elliptic Curves Over Prime Fields
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Algorithms for Multi-exponentiation
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
More Flexible Exponentiation with Precomputation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Software Implementation of Elliptic Curve Cryptography over Binary Fields
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Fast exponentiation with precomputation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
This paper defines a signed factorial expansion of an integer, and proposes two new methods for simultaneous scalar multiplication based on the expansion when multiple bases are fixed in advance. Where the First method can be parallelized easily, and the Second method only requires a half of elliptic points stored of the First method, relatively. In addition, it greatly improves up the implementation speed of simultaneous scalar multiplication when using the vector key in the methods. The theoretical analyses and the implementation results show that our methods are faster than the current fast methods.