FastECPP over MPI
From MaRDI portal
Publication:6637785
DOI10.1007/978-3-031-64529-7_4MaRDI QIDQ6637785
Publication date: 13 November 2024
Cites Work
- Constructing elliptic curves over finite fields using double eta-quotients
- Approximate formulas for some functions of prime numbers
- Generalised Weber functions
- The complexity of class polynomial computation via floating point approximations
- Elliptic Curves and Primality Proving
- Proving primality in essentially quartic random time
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Die singulären Werte der Weberschen Funktionen f, f1, f2, 2, 3.
- Fast Decomposition of Polynomials with Known Galois Group
- Short addition sequences for theta functions
- Singular values of multiple eta-quotients for ramified primes
- Algorithmic Number Theory
This page was built for publication: FastECPP over MPI
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637785)
