The Improved Montgomery Scalar Multiplication Algorithm with DPA Resistance

DOI

10.2991/icecee-15.2015.110How to use a DOI?

Keywords

ECC; DPA; Montgomery scalar multiplication algorithm; security system

Abstract

With Montgomery scalar multiplication algorithm being widely used in elliptic curve cryptography systems, the researches on DPA attacks against Montgomery scalar multiplication algorithm become more extensive, but few researches are about the DPA resistance algorithm. This paper analyzed the DPA resistance capability of the Montgomery scalar multiplication algorithm firstly, and on this basis, proposed an improved algorithm with random Z coordinate to resist the DPA attacks with the characteristics that the parameter Z only participates in the intermediate operations without affecting the final results. This paper described the original algorithm and the improved algorithm using Verilog HDL targeting on the 65 nm standard cell library. Results show that the improved Montgomery Scalar Multiplication algorithm can dramatically improve the anti-DPA attack property with only 0.36% performance and area 9.60% area penalty.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yanqi Xu
AU  - Lin Chen
AU  - Moran Li
PY  - 2015/06
DA  - 2015/06
TI  - The Improved Montgomery Scalar Multiplication Algorithm with DPA Resistance
BT  - Proceedings of the 2015 International Conference on Electrical, Computer Engineering and Electronics
PB  - Atlantis Press
SP  - 533
EP  - 538
SN  - 2352-538X
UR  - https://doi.org/10.2991/icecee-15.2015.110
DO  - 10.2991/icecee-15.2015.110
ID  - Xu2015/06
ER  -