#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2012

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

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)

- Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong
- Math. Comput.
- 2016

- ‹
- 1
- ›