Elliptic Curves and Primality Proving

DOI10.2307/2152935zbMath0792.11056OpenAlexW4243587538WikidataQ56059200 ScholiaQ56059200MaRDI QIDQ3137447

Publication date: 31 July 1994

Full work available at URL: https://doi.org/10.2307/2152935

elliptic curves with complex multiplication polynomial complexity certificate primality proving algorithm

Elliptic curves (14H52) Holomorphic modular forms of integral weight (11F11) Class field theory (11R37) Primality (11Y11)

Related Items (82)

Constructing hyperelliptic curves of genus 2 suitable for cryptography ⋮ Pairing-based cryptography on elliptic curves ⋮ Improvements to RSA key generation and CRT on embedded devices ⋮ Quantum lattice enumeration and tweaking discrete pruning ⋮ Hidden multiscale order in the primes ⋮ Compositeness test with nodal curves ⋮ Coverings of elliptic curves with complex multiplication by hyperelliptic curves and character sums ⋮ Primality testing of large numbers in Maple ⋮ Construction of CM Picard curves ⋮ Counting points on elliptic curves over finite fields ⋮ Algorithms in Algebraic Number Theory ⋮ Explicit elliptic units. I ⋮ Generalised Mersenne numbers revisited ⋮ ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Certifying giant nonprimes ⋮ On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6 ⋮ Computational Number Theory, Past, Present, and Future ⋮ Constructing Picard curves with complex multiplication using the Chinese remainder theorem ⋮ Modularity of Galois traces of class invariants ⋮ Simple and exact formula for minimum loop length in $\mathrm{Ate}_{i }$ pairing based on Brezing-Weng curves ⋮ Computing the endomorphism ring of an ordinary elliptic curve over a finite field ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ A CM construction for curves of genus 2 with $p$-rank 1 ⋮ Constructing pairing-friendly hyperelliptic curves using Weil restriction ⋮ An exploration of Nathanson's $g$-adic representations of integers ⋮ A strategy for elliptic curve primality proving ⋮ Finding strong pseudoprimes to several bases ⋮ Towards practical key exchange from ordinary isogeny graphs ⋮ On a conjecture of Yui and Zagier ⋮ On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ ⋮ Knottedness is in NP, modulo GRH ⋮ Computing Hilbert Class Polynomials ⋮ Unnamed Item ⋮ Computing the cardinality of CM elliptic curves using torsion points ⋮ An elliptic curve analogue to the Fermat numbers ⋮ The Factorization of the Ninth Fermat Number ⋮ Elliptic Curves and Primality Proving ⋮ Generalized Repunit Primes ⋮ On the singular values of Weber modular functions ⋮ The structure factor of primes ⋮ Compression on the Twisted Jacobi Intersection ⋮ Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two ⋮ Efficient randomized generation of optimal algorithms for multiplication in certain finite fields ⋮ Checking the odd Goldbach conjecture up to 10²⁰ ⋮ Finding Suitable Curves for the Elliptic Curve Method of Factorization ⋮ Constructing elliptic curves over finite fields using double eta-quotients ⋮ Choosing the correct elliptic curve in the CM method ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ Computing the order of points on an elliptic curve modulo $N$ is as difficult as factoring $N$ ⋮ Huff’s Model for Elliptic Curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ On the representation of the number of integral points of an elliptic curve modulo a prime number ⋮ A variant of the large sieve inequality with explicit constants ⋮ Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials ⋮ The complexity of class polynomial computation via floating point approximations ⋮ Ramanujan's class invariants and their use in elliptic curve cryptography ⋮ A framework for deterministic primality proving using elliptic curves with complex multiplication ⋮ On the efficient generation of prime-order elliptic curves ⋮ Some remarks on primality proving and elliptic curves ⋮ On the Evaluation of Singular Invariants for Canonical Generators of Certain Genus One Arithmetic Groups ⋮ Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm ⋮ Polynomial generating pairing and its criterion for optimal pairing ⋮ Fast group operations on elliptic curves in Maple ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem ⋮ Prime-number algorithm for public-key systems ⋮ Construction of metrics on the set of elliptic curves over a finite field ⋮ Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001 ⋮ On counting and generating curves over small finite fields ⋮ Point counting on reductions of CM elliptic curves ⋮ Unnamed Item ⋮ Implementing the asymptotically fast version of the elliptic curve primality proving algorithm ⋮ Recent developments in primality proving ⋮ Note on families of pairing-friendly elliptic curves with small embedding degree ⋮ Factorization of the tenth Fermat number ⋮ Strong pseudoprimes to base 2 ⋮ Modular curves over number fields and ECM ⋮ An approach for computing generators of class fields of imaginary quadratic number fields using the Schwarzian derivative ⋮ A Brief History of Pairings ⋮ Generalised Weber functions ⋮ Ranks of elliptic curves ⋮ Short effective intervals containing primes

Uses Software

Cites Work

This page was built for publication: Elliptic Curves and Primality Proving