About this document
Fault Attack on ECDLP in Prime Fields by xevexik699 is a document available to read on EtoBox.
This research article analyzes a refined fault attack method on elliptic curve discrete logarithm problems (ECDLP) over prime fields. The authors demonstrate that an attacker can compute the secret multiplier in subexponential time by exploiting specific properties of elliptic curves defined over prime fields. The paper discusses the efficiency of the attack algorithm and the conditions under which it can be successfully applied, including the density of certain numbers and the isomorphism classes of ellipt
- Author
- xevexik699
- Language
- EN