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

    Research output: Contribution to journalArticlepeer-review

    1 Citation (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)1316-1326
    Number of pages11
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE89-A
    Issue number5
    DOIs
    Publication statusPublished - 2006 May

    Keywords

    • Agagliate et al.'s countermeasure
    • BSD representation
    • DPA
    • Ebeid-Hasan countermeasure
    • Elliptic curve cryptosystem
    • Ha-Moon countermeasure
    • SPA
    • Side channel attacks

    ASJC Scopus subject areas

    • Signal Processing
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering
    • Applied Mathematics

    Fingerprint

    Dive into the research topics of 'Enhanced exhaustive search attack on randomized BSD type countermeasure'. Together they form a unique fingerprint.

    Cite this