Analysis of the Fault Attack ECDLP over Prime Field

Mingqiang Wang and Tao Zhan

Journal of Applied Mathematics, 2011, vol. 2011, 1-11

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 𝔽 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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2011/580749.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2011/580749.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:580749

DOI: 10.1155/2011/580749

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().