A fast parallel scalar multiplication against side-channel analysis for elliptic curve cryptosystem over prime fields
The scalar multiplication is the dominant operation in Elliptic Curve Cryptosystems (ECC). In this paper, we propose a modified width?Cw window method to compute the scalar multiplication efficiently and securely against side?Cchannel analysis, based on the side?Cchannel atomicity introduced by Benoit Chevallier?CMames. Utilizing this window method, we propose a new parallel scalar multiplication algorithm, which is secure against side?Cchannel analysis and more efficient than existing ones.
- Dongdai Lin (1)