Enhanced exhaustive search attack on randomized BSD type countermeasure
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.
bsd representation elliptic curve cryptosystem side channel attacks spa dpa ha-moon countermeasure ebeid-hasan countermeasure agagliate et al.'s countermeasure