Randomization of Elliptic Curve Secret Key to Efficiently Resist Power Analysis

    , , ,
Vol. 13, No. 5, pp. 169-178, Oct. 2003
10.13089/JKIISC.2003.13.5.169, Full Text:
Keywords: 타원곡선, 랜덤 스칼라 곱셈, SPA, DPA
Abstract

We establish the security requirements and derive a generic condition of elliptic curve scalar multiplication to resist against DPA and Goubin’s attack. Also we show that if a scalar multiplication algorithm satisfies our generic condition, then both attacks are infeasible. Showing that the randomized signed scalar multiplication using Ha-Moon's receding algorithm satisfies the generic condition, we recommend the randomized signed scalar multiplication using Ha-Moon's receding algorithm to be protective against both attacks. Also we newly design a random recoding method to Prevent two attacks. Finally, in efficiency comparison, it is shown that the recommended method is a bit faster than Izu-Takagi’s method which uses Montgomery-ladder without computing y-coordinate combined with randomized projective coordinates and base point blinding or isogeny method. Moreover. Izu-Takagi’s method uses additional storage, but it is not the case of ours.

Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
장상운, 정석원, 박영호, "Randomization of Elliptic Curve Secret Key to Efficiently Resist Power Analysis," Journal of The Korea Institute of Information Security and Cryptology, vol. 13, no. 5, pp. 169-178, 2003. DOI: 10.13089/JKIISC.2003.13.5.169.

[ACM Style]
장상운, 정석원, and 박영호. 2003. Randomization of Elliptic Curve Secret Key to Efficiently Resist Power Analysis. Journal of The Korea Institute of Information Security and Cryptology, 13, 5, (2003), 169-178. DOI: 10.13089/JKIISC.2003.13.5.169.