Analysis of the fault attack ECDLP over prime field

In 2000,biehl et al. 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 p with base point p ∈ e( p). applying the fault attack on these curves,the discrete logarithm on the curve can be computed in subexponential time of l p(1/2,1 + o (1)). the runtime bound relies on heuristics conjecture about smooth numbers similar to the ones used by lenstra,1987. © copyright 2011 mingqiang wang and tao zhan.