Thumbnail
Access Restriction
Open

Author Wang, Mingqiang ♦ Wang, Xiaoyun ♦ Zhan, Tao
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Fault Attack Ecdlp ♦ Fault Attack Method ♦ Heuristic Conjecture ♦ Elliptic Curve ♦ Base Point ♦ Elliptic Curve Cryptography ♦ Discrete Logarithm ♦ Prime Field Fp ♦ Smooth Number ♦ Fault Attack ♦ Subexponential Time ♦ Fault-based Attack ♦ Runtime Bound Relies
Abstract 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].
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2011-01-01