Randomized addition-subtraction chains as a countermeasure against power attacks. (English) Zbl 1012.94549
Koç, Çetin K. (ed.) et al., Cryptographic hardware and embedded systems - CHES 2001. 3rd international workshop, Paris, France, May 14-16, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2162, 39-50 (2001).
Summary: Power analysis attacks on elliptic curve cryptosystems and various countermeasures against them were first discussed by J.-S. Coron
[Lect. Notes Comput. Sci. 1560, 29-42 (1999; Zbl 0964.94018
)]. All proposed countermeasures are based on the randomization or blinding of the input parameters of the binary algorithm. We propose a countermeasure that randomizes the binary algorithm itself. Our algorithm needs approximately 9% more additions than the ordinary binary algorithm, but makes power analysis attacks really difficult.
|14G50||Applications of algebraic geometry to coding theory and cryptography|