ISSN:
1573-7586
Keywords:
Elliptic curve
;
discrete logarithm
;
Xedni calculus
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Let $$E/{\mathbb{F}}_P$$ be an elliptic curve defined over a finite field, and let $$S,T \in E({\mathbb{F}}_P )$$ be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks that an integer m be found so that S=mT in $$E({\mathbb{F}}_P )$$ . In this note we give a new algorithm, termed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete logarithm problem for $${\mathbb{F}}_p^*$$ and to the integer factorization problem.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008319518035
Permalink