Speeding up the computations on an elliptic curve using addition-subtraction chains
Open Access
- 1 January 1990
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 24 (6), 531-543
- https://doi.org/10.1051/ita/1990240605311
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 16 references indexed in Scilit:
- Addition chains using continued fractionsJournal of Algorithms, 1989
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- Elliptic Curve CryptosystemsMathematics of Computation, 1987
- Implementation of a new primality testMathematics of Computation, 1987
- Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition ChainsMathematics of Computation, 1986
- Almost all primes can be quickly certifiedPublished by Association for Computing Machinery (ACM) ,1986
- The Optimal Algorithm to Evaluate x n Using Elementary Multiplication MethodsMathematics of Computation, 1977
- Diophantine Equations with Special Reference To Elliptic CurvesJournal of the London Mathematical Society, 1966
- Remarks on number theory III. On addition chainsActa Arithmetica, 1960
- On addition chainsBulletin of the American Mathematical Society, 1939