Login / Signup

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm.

François Morain
Published in: Math. Comput. (2007)
Keyphrases
  • computational complexity
  • computationally efficient
  • np hard
  • worst case
  • low cost
  • computational efficiency
  • similarity measure
  • elliptic curve