Retrieving Lost Efficiency of Scalar Multiplications for Resisting against Side-Channel Attacks
|
| Title | Retrieving Lost Efficiency of Scalar Multiplications for Resisting against Side-Channel Attacks |
| Authors | |
| Abstract | At the elliptic curve cryptosystems (ECC) implementation stage, a major concern is securing scalar multiplications against so-called side-channel attacks (SCA). Existing solutions reach the goal by inserting dummy operations (typically increase 33% computational costs) based on commonly-used binary method, which largely increases the computational costs and prohibits the deployment of ECC in computation resource-restricted devices. In this paper, we for the first time propose a secure scalar multiplication method that does not penalise the computational cost compared to binary method. We partition the bit string of the scalar in half and extracting the common substring from the two parts based on bit-wise logical operations, so as to save the number of point additions required for the computation of the common substring. Computational results demonstrate the proposed method remains approximately the same computational cost as binary method. The side-channel experiments prove that the proposed method is secure against SSCA. Also, we use the randomization technique to secure our method against differential SCA (DSCA). |
| Publisher | ACADEMY PUBLISHER |
| Date | 2010-12-01 |
| Source | Journal of Computers Vol 5, No 12 (2010): Special Issue: Selected Papers of the IEEE International Conference on Compute |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |