Effective multi-base scalar multiplication algorithm with side-channel attack resistance
Yin Hen · Journal of Computer Applications · 2014
To raise the safety and efficiency of algorithm on Elliptic Curve Cryptography( ECC), a new multi-base scalar multiplication algorithm was presented based on original side-channel attack and scalar multiplication algorithm. In order to enhance the algorithm's security, random number and the masking technology of base point were introduced to hide the related side-channel informations of the algorithm. Meanwhile, fast point halving and the multi-base representation of scalar were conbined to improve the algorithm's efficiency. According to security analysis, the algorithm can resist various side-channel attacks well. Results of the actual experiments also show that the efficiency of the new method was improved about 36%-42% over the Purohit's method and about 8%- 11% over the Lai's method( LAI Z, ZHANG Z, TAO D. Algorithm for directly computing 7P elliptic curves and its application[J]. Journal of Computer Applications, 2013,33( 7) : 1870- 1874.)on the elliptic curves recommended by National Institute of Standards and Technology( NIST) including NIST B-163, NIST B-233, NIST B-283, when the number of pre-computation points were 2 and 5 respectively. The new algorithm can be applied to the domains of smart cards and other limited storage resources, making it more secure and efficient to the encryption and decryption of sensitive data.