Abstract
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 with base point . Applying the fault attack on these curves, the discrete logarithm on the curve can be computed in subexponential time of . The runtime bound relies on heuristics conjecture about smooth numbers similar to the ones used by Lenstra, 1987.
Citation
Mingqiang Wang. Tao Zhan. "Analysis of the Fault Attack ECDLP over Prime Field." J. Appl. Math. 2011 1 - 11, 2011. https://doi.org/10.1155/2011/580749
Information