Open Access
Translator Disclaimer
2011 Analysis of the Fault Attack ECDLP over Prime Field
Mingqiang Wang, Tao Zhan
J. Appl. Math. 2011: 1-11 (2011). DOI: 10.1155/2011/580749


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.


Download Citation

Mingqiang Wang. Tao Zhan. "Analysis of the Fault Attack ECDLP over Prime Field." J. Appl. Math. 2011 1 - 11, 2011.


Published: 2011
First available in Project Euclid: 15 March 2012

zbMATH: 1235.94052
MathSciNet: MR2846446
Digital Object Identifier: 10.1155/2011/580749

Rights: Copyright © 2011 Hindawi


Vol.2011 • 2011
Back to Top