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...
Saved in:
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!
|
Similar Items
-
A high speed processor for elliptic curve cryptography over NIST prime field
by: Xianghong Hu, et al.
Published: (2022-07-01) -
Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field
by: Jinwang Liu, et al.
Published: (2018-01-01) -
Dirichlet summations and products over primes
by: Geoffrey B. Campbell
Published: (1993-01-01) -
Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
by: Aleksėjus Michalkovič, et al.
Published: (2023-11-01) -
Prime valued polynomials and class numbers of quadratic fields
by: Richard A. Mollin
Published: (1990-01-01)