Simple Power Analysis on Elliptic Curve Cryptosystems and Countermeasures: Practical Work

被引:6
|
作者
Wu, Keke [1 ]
Li, Huiyun [2 ]
Chen, Tingding [2 ]
Yu, Fengqi [2 ]
机构
[1] Chinese Acad Sci, Grad Univ, Shenzhen Inst Adv Technol, Inst Comp Technol, Beijing, Peoples R China
[2] Chinese Acad Sci, Shenzhen Inst Adv Technol, Dept Integrated Elect, Shenzhen, Peoples R China
关键词
Simple power analysis; Differential power analysis; Side channel; Elliptic curve cryptosystems;
D O I
10.1109/ISECS.2009.7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Simple Power Analysis (SPA), first introduced by Kocher et al. in [1], is a technique that involves directly interpreting power consumption measurements collected during cryptographic operations. Although the possibility of attacking elliptic curve cryptosystems (ECC) by SPA repeatedly appears in research papers, all accessible references evade the essence of reporting conclusive experiments where actual elliptic curve cryptosystems were successfully attacked and prevented. In this paper we describe power analysis experiments conducted on 3 implementations of elliptic curve cryptosystems. They are respectively binary, double-and-add-always and Montgomery methods of point multiplication. The experimental results indicate that using SPA analysis, the complete key material could be successfully retrieved from binary method, but not from double-and-add-always and Montgomery method.
引用
收藏
页码:21 / +
页数:2
相关论文
共 50 条
  • [41] Voting protocol based on elliptic curve cryptosystems
    Liu, Shengli
    Yang, Bo
    Wang, Yumin
    Dianzi Kexue Xuekan/Journal of Electronics, 2000, 22 (01): : 84 - 89
  • [42] Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems
    Schmidt-Samoa, K
    Semay, O
    Takagi, T
    IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (01) : 48 - 57
  • [43] Multi-threading elliptic curve cryptosystems
    Kanniah, Uma S.
    Samsudin, Azman
    ICT-MICC: 2007 IEEE INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1 AND 2, PROCEEDINGS, 2007, : 134 - 139
  • [44] Parallel scalar multiplication for elliptic curve cryptosystems
    Ansari, B
    Wu, HP
    2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2005, : 71 - 73
  • [45] A short course to introduce Elliptic Curve Cryptosystems
    Takagi, K
    Murayama, JK
    ADVANCED RESEARCH IN COMPUTERS AND COMMUNICATIONS IN EDUCATION, VOL 2: NEW HUMAN ABILITIES FOR THE NETWORKED SOCIETY, 1999, 55 : 874 - 875
  • [46] Implementation and Analysis of Elliptic Curve Cryptosystems over Polynomial basis and ONB
    Choi, Yong-Je
    Kim, Moo-Seop
    Lee, Hang-Rok
    Kim, Ho-Won
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 10, 2005, 10 : 130 - 134
  • [47] Implementation of elliptic curve cryptosystems on a reconfigurable computer
    Nguyen, N
    Gaj, K
    Caliga, D
    El-Ghazawi, T
    2003 IEEE INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (FPT), PROCEEDINGS, 2003, : 60 - 67
  • [48] A PRACTICAL ANALYSIS OF THE ELLIPTIC CURVE FACTORING ALGORITHM
    SILVERMAN, RD
    WAGSTAFF, SS
    MATHEMATICS OF COMPUTATION, 1993, 61 (203) : 445 - 462
  • [49] Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem
    Byrne, A.
    Meloni, N.
    Tisserand, A.
    Popovici, E. M.
    Marnane, W. P.
    JOURNAL OF COMPUTERS, 2007, 2 (10) : 52 - 62
  • [50] A new elliptic curve scalar multiplication algorithm to resist simple power analysis
    Hitchcock, Y
    Montague, P
    INFORMATION SECURITY AND PRIVACY, 2002, 2384 : 214 - 225