Published in

Springer, Lecture Notes in Computer Science, p. 551-563, 2003

DOI: 10.1007/3-540-36400-5_40

Links

Tools

Export citation

Search in Google Scholar

Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks

Proceedings article published in 2002 by JaeCheol Ha, Sang-Jae Moon
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Recently it has been shown that smart cards as crypto- graphic devices are vulnerable to power attacks if they have no defence against them. Randomization on ECC scalar multiplication is one of the fundamental concepts in methods of defence against side-channel attacks. In this paper by using the randomization concept together with the NAF recoding algorithm, we propose an efficient countermeasure for ECCs against power attacks. The countermeasure provides a randomized signed-scalar representation at every scalar multiplication to resist DPA. To protect against SPA it additionally employs a simple SPA-immune addition-subtraction multiplication algorithm. Our analysis shows that it needs no additional computation load compared to the ordinary binary scalar multiplication, where the av- erage number of doublings plus additions for a bit length n is 1.5n+O(1).