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: | , |
|---|---|
| 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!
|
| _version_ | 1832566728034353152 |
|---|---|
| author | Mingqiang Wang Tao Zhan |
| author_facet | Mingqiang Wang Tao Zhan |
| author_sort | Mingqiang Wang |
| collection | DOAJ |
| description | 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 Lp(1/2,1+o(1)). The runtime bound relies on heuristics conjecture about smooth numbers similar to the ones used by Lenstra, 1987. |
| format | Article |
| id | doaj-art-fa8ccb6e58f34e6e921495f4ae2329f2 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2011-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-fa8ccb6e58f34e6e921495f4ae2329f22025-02-03T01:03:29ZengWileyJournal of Applied Mathematics1110-757X1687-00422011-01-01201110.1155/2011/580749580749Analysis of the Fault Attack ECDLP over Prime FieldMingqiang Wang0Tao Zhan1School of Mathematics, Shandong University, Jinan 250100, ChinaSchool of Mathematics, Shandong University, Jinan 250100, ChinaIn 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 Lp(1/2,1+o(1)). The runtime bound relies on heuristics conjecture about smooth numbers similar to the ones used by Lenstra, 1987.http://dx.doi.org/10.1155/2011/580749 |
| spellingShingle | Mingqiang Wang Tao Zhan Analysis of the Fault Attack ECDLP over Prime Field Journal of Applied Mathematics |
| title | Analysis of the Fault Attack ECDLP over Prime Field |
| title_full | Analysis of the Fault Attack ECDLP over Prime Field |
| title_fullStr | Analysis of the Fault Attack ECDLP over Prime Field |
| title_full_unstemmed | Analysis of the Fault Attack ECDLP over Prime Field |
| title_short | Analysis of the Fault Attack ECDLP over Prime Field |
| title_sort | analysis of the fault attack ecdlp over prime field |
| url | http://dx.doi.org/10.1155/2011/580749 |
| work_keys_str_mv | AT mingqiangwang analysisofthefaultattackecdlpoverprimefield AT taozhan analysisofthefaultattackecdlpoverprimefield |