Learn More
We give a deterministic algorithm that very quickly proves the pri-mality or compositeness of the integers N in a certain sequence, using an ellip-tic curve E/Q with complex multiplication by the ring of integers of Q(√ −7). The algorithm uses O(log N) arithmetic operations in the ring Z/N Z, implying a bit complexity that is quasi-quadratic in log N.(More)
  • 1