Efficient algorithms for elliptic curve cryptosystems

This publication has 11 references indexed in Scilit:

• Public-Key Cryptosystems with Very Small Key Lengths
  Published by Springer Nature ,2001
• Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)
  Published by Springer Nature ,1997
• A new architecture for a parallel finite field multiplier with low complexity based on composite fields
  IEEE Transactions on Computers, 1996
• A fast software implementation for arithmetic operations in GF(2n)
  Published by Springer Nature ,1996
• Analysis of sliding window techniques for exponentiation
  Computers & Mathematics with Applications, 1995
• A Course in Computational Algebraic Number Theory
  Published by Springer Nature ,1993
• Elliptic Curve Public Key Cryptosystems
  Published by Springer Nature ,1993
• A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
  Information and Computation, 1988
• Elliptic curve cryptosystems
  Mathematics of Computation, 1987
• Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments
  SIAM Journal on Computing, 1974