FAQ

Elliptic curve primality

Known as: Elliptic Curve Primality Testing, Elliptic curve primality proving, Elliptic curve primality test 
In mathematics elliptic curve primality testing techniques are among the quickest and most widely used methods in primality proving. It is an idea… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2014
01219902014

Related topics

Related topics

14 relations
AlgorithmBaillie–PSW primality testC++Cornacchia's algorithm
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Elliptic curve primality
Algorithm
Discriminant
C++
Recursion
Worst-case execution time

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2011
Review
2011
An Overview of Elliptic Curve Primality Proving
Primes are of fundamental importance in number theory, and primality testing is one of the oldest problems in mathematics… (More)
Is this relevant?
2007
2007
Elliptic curve primality tests for Fermat and related primes
We use elliptic curves with complex multiplication to develop primality tests for Fermat primes and for primes of the form 32… (More)
Is this relevant?
2007
2007
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2004
2004
Computing the cardinality of CM elliptic curves using torsion points
Let E/Q be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The… (More)
  • table 1
  • table 2
Is this relevant?
2003
2003
Primality Proving via One Round in ECPP and One Iteration in AKS
In August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial-time primality-testing algorithm. For… (More)
  • table 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Elliptic Curves and Primality Proving
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. Problema, n… (More)
Is this relevant?
1992
1992
Easy Numbers for the Elliptic Curve Primality Proving Algorithm
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm… (More)
Is this relevant?
1991
1991
DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2353g
  • Fransois Morain
  • 1991
We esplain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1990
1990
Constructing Elliptic Curve Cryptosystems in Characteristic 2
 
Is this relevant?
1990
1990
Distributed Primality Proving and the Primality of (23539+1)/3
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?