New Fault Attack on Elliptic Curve Scalar Multiplication.
Alexey A. Chilikov, Oleg Taraskin · 2009
In this report we present a new fault attack that applies to some implementations of elliptic curve scalar multiplication (ECSM). We consider the fault model with 'precise control of time', 'loose control of fault location' and 'random number of faulty bits'. We show that in this fault model the secret key can be revealed with polynomial time complexity and linear number of faults. In addition, we discuss di erent countermeasures to resist this attack. 1 Fault Attacks Fault attacks are a type of attacks that are based on hardware error analysis. In this case an adversary can actively in uence the target device and induce faults during the computation process. After that faulty output can be analyzed and secret information (or some part of it) can be revealed. Fault attacks were introduced by Boneh at al. in [BDL97]. In further works there were presented many types of physical in uence that implement di erent