Welcome to the resource topic for 2011/283
Title:
The Fault Attack ECDLP Revisited
Authors: Mingqiang Wang, Xiaoyun Wang, Tao Zhan
Abstract:Biehl et al.\cite{BMM} 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 \mathbb{F}_p with base point P\in E(\mathbb{F}_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 in \cite{Lens}.
ePrint: https://eprint.iacr.org/2011/283
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .