caa a22 4500 475807294 CHVBK 20180406123750.0 cr unu---uuuuu 170329e20000401xx s 000 0 eng 10.1023/A:1008319518035 doi (NATIONALLICENCE)springer-10.1023/A:1008319518035 Silverman Joseph Mathematics Department, Brown University, Box 1917, 02912, Providence, RI aut The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem [Elektronische Daten] [Joseph Silverman] 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. Kluwer Academic Publishers, 2000 Elliptic curve nationallicence discrete logarithm nationallicence Xedni calculus nationallicence Designs, Codes and Cryptography Kluwer Academic Publishers 20/1(2000-04-01), 5-40 0925-1022 20:1<5 2000 20 10623 https://doi.org/10.1023/A:1008319518035 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1023/A:1008319518035 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Silverman Joseph Mathematics Department, Brown University, Box 1917, 02912, Providence, RI aut NATIONALLICENCE 773 0- Designs, Codes and Cryptography Kluwer Academic Publishers 20/1(2000-04-01), 5-40 0925-1022 20:1<5 2000 20 10623 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer