Alexander Abatzoglou

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