Abstract
We propose several new methods to protect the scalar multiplication on an elliptic curve against Differential Analysis. The basic idea consists in transforming the curve through various random morphisms to provide a non-deterministic execution of the algorithm. The solutions we suggest complement and improve the state-of-the-art, but also provide a practical toolbox of efficient countermeasures. These should suit most of the needs for protecting implementations of cryptoalgorithms based on elliptic curves.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Joye, M., & Tymen, C. (2001). Protections against differential analysis for elliptic curve cryptography: An algebraic approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2162, pp. 377–390). Springer Verlag. https://doi.org/10.1007/3-540-44709-1_31
Readers' Seniority
Readers' Discipline
