Elliptic periods and primality proving
From MaRDI portal
Publication:1762314
DOI10.1016/J.JNT.2012.07.007zbMATH Open1310.11118arXiv0810.2853OpenAlexW1995625678MaRDI QIDQ1762314FDOQ1762314
Publication date: 23 November 2012
Published in: Journal of Number Theory (Search for Journal in Brave)
Abstract: We define the ring of elliptic periods modulo an integer and give an elliptic version of the AKS primality criterion.
Full work available at URL: https://arxiv.org/abs/0810.2853
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast multiplication of polynomials over fields of characteristic 2
- Fast multiplication of large numbers
- Elliptic curves and their applications to cryptography. An introduction
- PRIMES is in P
- Arithmetic Moduli of Elliptic Curves. (AM-108)
- Four primality testing algorithms
- Optimal normal bases in \(GF(p^ n)\)
- Low complexity normal bases
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Proving primality in essentially quartic random time
- Optimal normal bases
- On some subgroups of the multiplicative group of finite rings
- Elliptic periods for finite fields
- The Function Field Sieve in the Medium Prime Case
- Sharpening ``Primes is in P for a large family of numbers
- Primality proving via one round in ECPP and one iteration in AKS
Cited In (2)
Uses Software
This page was built for publication: Elliptic periods and primality proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762314)
