Very few countermeasures are known to protect an exponentiation against simple side-channel analyses. Moreover, all of them are heuristic. This paper presents a universal exponentiation algorithm. By tying the exponent to a corresponding addition chain, our algorithm can virtually execute any exponentiation method. Our aim is to transfer the security of the exponentiation method being implemented to the exponent itself. As a result, we hopefully tend to reconcile the provable security notions of modern cryptography with real-world implementations of exponentiation-based cryptosystems.
CITATION STYLE
Clavier, C., & Marc, M. J. (2001). Universal exponentiation algorithm a first step towards provable SPA-resistance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2162, pp. 300–308). Springer Verlag. https://doi.org/10.1007/3-540-44709-1_25
Mendeley helps you to discover research relevant for your work.