Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method

This publication has 12 references indexed in Scilit:

• Speeding up the computations on an elliptic curve using addition-subtraction chains
  RAIRO - Theoretical Informatics and Applications, 1990
• Minimum weight modified signed-digit representations and fast exponentiation
  Electronics Letters, 1989
• Factoring Integers with Elliptic Curves
  Annals of Mathematics, 1987
• Speeding the Pollard and Elliptic Curve Methods of Factorization
  Mathematics of Computation, 1987
• A Course in Number Theory and Cryptography
  Published by Springer Nature ,1987
• Almost all primes can be quickly certified
  Published by Association for Computing Machinery (ACM) ,1986
• A public key cryptosystem and a signature scheme based on discrete logarithms
  IEEE Transactions on Information Theory, 1985
• Computing Sequences with Addition Chains
  SIAM Journal on Computing, 1981
• A method for obtaining digital signatures and public-key cryptosystems
  Communications of the ACM, 1978
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976