Primality testing using elliptic curves
From MaRDI portal
Recommendations
Cited in
(18)- Primality testing and Abelian varieties over finite fields
- Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two
- A faster pseudo-primality test
- Knottedness is in NP, modulo GRH
- Some remarks on primality proving and elliptic curves
- Arithmetic of the level four theta model of elliptic curves
- A framework for deterministic primality proving using elliptic curves with complex multiplication
- A primality test algorithm using supersingular elliptic curves
- Elliptic Curves and Primality Proving
- Prime Number Generation Based On Pocklington's Theorem
- Ranks of elliptic curves
- Proving primality in essentially quartic random time
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Primality Proving with Elliptic Curves
- Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
- Primality Tests Using Algebraic Groups
- Huff's model for elliptic curves
- Spreading alerts quietly and the subgroup escape problem
This page was built for publication: Primality testing using elliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158545)