Analysis of the Fault Attack ECDLP over Prime Field

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

Full description

Saved in:
Bibliographic Details
Main Authors: Mingqiang Wang, Tao Zhan
Format: Article
Language:English
Published: Wiley 2011-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2011/580749
Tags: Add Tag
No Tags, Be the first to tag this record!