Analysis of the fault attack ECDLP over prime field (Q410803): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2011/580749 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069132213 / rank | |||
Normal rank |
Revision as of 19:41, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of the fault attack ECDLP over prime field |
scientific article |
Statements
Analysis of the fault attack ECDLP over prime field (English)
0 references
4 April 2012
0 references
Summary: \textit{I. Biehl} et al. [Crypto 2000, Lect. Notes Comput. Sci. 1880, 131--146 (2000; Zbl 0989.94505)] 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 \(\mathbb F_p\) with base point \(P \in E(\mathbb F_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 \textit{H. W. Lenstra jun.} [Ann. Math. (2) 126, 649--673 (1987; Zbl 0629.10006)].
0 references