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
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
Analysis of linear combination algorithms in cryptography
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
A note on the signed sliding window integer recoding and a left-to-right analogue
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Fractional windows revisited: improved signed-digit representations for efficient exponentiation
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Calculating average joint hamming weight for minimal weight conversion of d integers
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Fast elliptic curve cryptography using minimal weight conversion of d integers
AISC '12 Proceedings of the Tenth Australasian Information Security Conference - Volume 125
| Hi-index | 0.00 |
The most time consuming operation to verify a signature with the Elliptic Curve Digital Signature Algorithm is a multi-scalar multiplication with two scalars. Efficient methods for its computation are the Shamir method and the Interleave method, whereas the performance of those methods can be improved by using general base-2 representations of the scalars. In exchange for the speed-up, those representations require the precomputation of several points that must be stored. In the case of two precomputed points, the Interleave method and the Shamir method provide the same, optimal efficiency. In the case of more precomputed points, only the Interleave method can be sped-up in an optimal way and is currently more efficient than the Shamir method. This paper proposes a new general base-2 representation of the scalars that can be used to speed up the Shamir method. It requires the precomputation of ten points and is more efficient than any other representation that also requires ten precomputed points. Therefore, the proposed method is the first to improve the Shamir method such that it is faster than the Interleave method.