Abstract
The Simple Power Analysis (SPA) attack against an elliptic curve cryptosystem distinguishes between point doubling and point addition in a single execution of scalar multiplication. Although many SPA-resistant scalar multiplication algorithms have been proposed, few countermeasures for multi-scalar multiplications are known. In this paper,we propose a new SPA-resistant multi-scalar multiplication for a pair of integers combing the Joint Sparse Form (JSF) representation technique for pair of integers, point randomization, and uniform operation sequence. The new method requires about 8.5% less multiplications in the field compared to the known counter measures.
Cite
CITATION STYLE
Liu, D., Tan, Z., & Dai, Y. (2009). New elliptic curve multi-scalar multiplication algorithm for a pair of integers to resist SPA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5487, pp. 253–264). https://doi.org/10.1007/978-3-642-01440-6_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
