Abstract | ||
---|---|---|
We propose a new analysis technique against a class of countermeasure using randomized binary signed digit (BSD) representations. We also introduce some invariant properties between BSD representations. The proposed analysis technique can directly recover the secret key from power measurements without information for algorithm because of the invariant properties of BSD representation. Thus the proposed attack is applicable to all countermeasures using BSD representations. Finally, we give the simulation results against some countermeasures using BSD representation such as Ha-Moon method, Ebeid-Hasan method, and the method of Agagliate et al. The results show that the proposed attack is practical analysis method. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1093/ietfec/e89-a.5.1316 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
elliptic curve cryptosystem, side channel attacks, SPA, DPA, BSD representation, Ha-Moon countermeasure, Ebeid-Hasan countermeasure, Agagliate et al.'s countermeasure | Countermeasure,Brute-force search,Binary signed digit,Elliptic curve cryptosystem,Theoretical computer science,Side channel attack,Invariant (mathematics),Mathematics | Journal |
Volume | Issue | ISSN |
E89A | 5 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dong-guk Han | 1 | 124 | 24.94 |
Katsuyuki Okeya | 2 | 447 | 38.47 |
Taehyun Kim | 3 | 234 | 30.74 |
Yoon Sung Hwang | 4 | 2 | 1.06 |
Beomin Kim | 5 | 0 | 0.68 |
Young-Ho Park | 6 | 137 | 16.79 |