Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Enhanced Exhaustive Search Attack on Randomized BSD Type Countermeasure Dong-Guk HAN Katsuyuki OKEYA Tae Hyun KIM Yoon Sung HWANG Beomin KIM Young-Ho PARK Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E89-A No.5 pp.1316-1327 Publication Date: 2006/05/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e89-a.5.1316 Print ISSN: 0916-8508 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: elliptic curve cryptosystem, side channel attacks, SPA, DPA, BSD representation, Ha-Moon countermeasure, Ebeid-Hasan countermeasure, Agagliate et al.'s countermeasure, Full Text: PDF(387.1KB)>>
Summary: 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. | ||||||||||
| ||||||||||
