Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks
- Cite this paper as:
- Oswald E., Aigner M. (2001) Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks. In: Koç Ç.K., Naccache D., Paar C. (eds) Cryptographic Hardware and Embedded Systems — CHES 2001. CHES 2001. Lecture Notes in Computer Science, vol 2162. Springer, Berlin, Heidelberg
Power Analysis attacks on elliptic curve cryptosystems and various countermeasures against them, have been first discussed by Coron (). All proposed countermeasures are based on the randomization or blinding of the inputparameters 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.