The Fault Attack ECDLP Revisited.
Mingqiang Wang, Xiaoyun Wang, Tao Zhan · 2011
Biehl et al.[2] proposed a fault-based attack on elliptic curve cryptography. In this paper, we refined the fault attack method. An elliptic curve E is defined over prime field Fp with base point P ∈ E(Fp). Applying the fault attack on these curves, the discrete logarithm on the curve can be computed in subexponential time of Lp(1/2, 1+o(1)). The runtime bound relies on heuristics conjecture about smooth numbers similar to the ones used in [9].