Elliptic Curves and Primality Proving

DOI10.2307/2152935zbMATH Open0792.11056OpenAlexW4243587538WikidataQ56059200 ScholiaQ56059200MaRDI QIDQ3137447FDOQ3137447

Authors: A. O. L. Atkin, François Morain 

Publication date: 31 July 1994

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

Recommendations

• scientific article; zbMATH DE number 17386
• Primality Testing and Jacobi Sums
• Primality testing using elliptic curves
• scientific article; zbMATH DE number 65932
• Primality testing and Abelian varieties over finite fields

zbMATH Keywords

polynomial complexitycertificateelliptic curves with complex multiplicationprimality proving algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Factoring integers with elliptic curves
• Title not available (Why is that?)
• On distinguishing prime numbers from composite numbers
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Title not available (Why is that?)
• Effective Primality Tests for Some Integers of the Forms A5 n - 1 and A7 n - 1
• Title not available (Why is that?)
• Weber's class invariants
• Factoring Polynomials Over Large Finite Fields
• Special values of the elliptic modular function and factorization formulae.
• Title not available (Why is that?)
• Arithmetic on elliptic curves with complex multiplication. With an appendix by B. Mazur
• Title not available (Why is that?)
• On the `gap' in a theorem of Heegner
• A classical invitation of algebraic numbers and class fields. With two appendices by Olga Taussky: ``Artin's 1932 Göttingen lectures on class field theory and ``Connections between algebraic number theory and integral matrices.
• Diophantine Equations with Special Reference To Elliptic Curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Number of Elliptic Pseudoprimes
• Ramanujans Vermutung über Zerfällungszahlen.
• Elliptic Curves and Primality Proving
• Die singulären Werte der Weberschen Funktionen f, f1, f2, 2, 3.
• Title not available (Why is that?)
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Title not available (Why is that?)
• Title not available (Why is that?)
• AN EXTENSION OF HEILBRONN'S CLASS-NUMBER THEOREM
• Primality Testing and Jacobi Sums
• Small Class Numbers and Extreme Values of L-Functions of Quadratic Fields
• Every Prime Has a Succinct Certificate
• Very Short Primality Proofs
• Seminar on complex multiplication. Seminar held at the Institute for Advanced Study, Princeton, N.J., 1957--58
• Title not available (Why is that?)
• A new cubic character sum
• The Diophantine equationy²= x(x²+ 21Dx+ 112D²)and the conjectures of Birch and Swinnerton-Dyer
• Title not available (Why is that?)
• Certain Classical Congruences Via Elliptic Curves
• Über die praktische Auflösung von Gleichungen höheren Grades. (On the solution of higher degree equations in practice)
• Title not available (Why is that?)
• Modern cryptology. A tutorial
• New Primality Criteria and Factorizations of 2 m ± 1
• Title not available (Why is that?)
• The Primality of R1031
• Implementation of a new primality test
• Title not available (Why is that?)
• Évaluation d'une somme cubique de caractères. (Evaluation of a cubic character sum)
• The generation of random numbers that are probably prime
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simple groups of square order and interesting sequence of primes
• Title not available (Why is that?)
• Finding Suitable Curves for the Elliptic Curve Method of Factorization
• Title not available (Why is that?)
• Primes of the Form n! ± 1 and 2 ⋅3 ⋅5 ⋯p ± 1
• Title not available (Why is that?)
• Elliptic Pseudoprimes
• A Performance Analysis of a Simple Prime-Testing Algorithm
• Title not available (Why is that?)
• Some Primes with Interesting Digit Patterns

Cited In (only showing first 100 items - show all)

• Improvements to RSA key generation and CRT on embedded devices
• On the singular values of Weber modular functions
• Constructing hyperelliptic curves of genus 2 suitable for cryptography
• The complexity of class polynomial computation via floating point approximations
• The structure factor of primes
• Knottedness is in NP, modulo GRH
• Ranks of elliptic curves
• Four primality testing algorithms
• An elliptic curve analogue to the Fermat numbers
• Modularity of Galois traces of class invariants
• Modular curves over number fields and ECM
• Primality testing using elliptic curves
• Coverings of elliptic curves with complex multiplication by hyperelliptic curves and character sums
• Pairing-based cryptography on elliptic curves
• On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
• Title not available (Why is that?)
• Computational Number Theory, Past, Present, and Future
• Title not available (Why is that?)
• Construction of CM Picard curves
• Towards practical key exchange from ordinary isogeny graphs
• Constructing elliptic curves over finite fields using double eta-quotients
• Counting points on elliptic curves over finite fields
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Ramanujan's class invariants and their use in elliptic curve cryptography
• Title not available (Why is that?)
• Implementation of a new primality test
• Checking the odd Goldbach conjecture up to 10²⁰
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• Quantum lattice enumeration and tweaking discrete pruning
• Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
• Elliptic periods and primality proving
• On counting and generating curves over small finite fields
• Computing Hilbert Class Polynomials
• Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two
• Recent developments in primality proving
• Primality Testing and Jacobi Sums
• Kronecker's and Newton's approaches to solving: a first comparison
• Primality testing of large numbers in Maple
• Generalized Repunit Primes
• Generalised Weber functions
• Explicit elliptic units. I
• Huff's model for elliptic curves
• Finding strong pseudoprimes to several bases
• Short effective intervals containing primes
• Constructing pairing-friendly hyperelliptic curves using Weil restriction
• Polynomial generating pairing and its criterion for optimal pairing
• Factorization of the tenth Fermat number
• A taxonomy of pairing-friendly elliptic curves
• A CM construction for curves of genus 2 with \(p\)-rank 1
• A brief history of pairings
• Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• Finding Suitable Curves for the Elliptic Curve Method of Factorization
• Title not available (Why is that?)
• Point counting on reductions of CM elliptic curves
• A strategy for elliptic curve primality proving
• The Factorization of the Ninth Fermat Number
• Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
• Computing Hilbert class polynomials with the Chinese remainder theorem
• Primality proofs with elliptic curves: heuristics and analysis
• Fast group operations on elliptic curves in Maple
• Generalised Mersenne numbers revisited
• Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
• Scalable zero knowledge via cycles of elliptic curves
• Algorithms in Algebraic Number Theory
• Choosing the correct elliptic curve in the CM method
• Prime-number algorithm for public-key systems
• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
• Title not available (Why is that?)
• Elliptic Curves and Primality Proving
• Computing the cardinality of CM elliptic curves using torsion points
• A framework for deterministic primality proving using elliptic curves with complex multiplication
• Primality Proving with Elliptic Curves
• On a conjecture of Yui and Zagier
• Construction of metrics on the set of elliptic curves over a finite field
• Strong pseudoprimes to base 2
• Primality proofs with elliptic curves: experimental data
• Constructing Picard curves with complex multiplication using the Chinese remainder theorem
• On the representation of the number of integral points of an elliptic curve modulo a prime number
• A generalized MSST algorithm for counting points of elliptic curves over \(\mathbb{F}_{p^n}\)
• A variant of the large sieve inequality with explicit constants
• On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
• Producing class numbers for the Atkin-Morain primality test
• Note on families of pairing-friendly elliptic curves with small embedding degree
• Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)
• Primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three
• Title not available (Why is that?)
• On the evaluation of singular invariants for canonical generators of certain genus one arithmetic groups
• An approach for computing generators of class fields of imaginary quadratic number fields using the Schwarzian derivative
• On the efficient generation of prime-order elliptic curves
• Certifying giant nonprimes
• Advances in Cryptology - CRYPTO 2003
• Notes on an elliptic curve test for Mersenne primes
• A primality test algorithm using supersingular elliptic curves
• FastECPP over MPI
• ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS
• Title not available (Why is that?)
• Families of prime-order endomorphism-equipped embedded curves on pairing-friendly curves
• Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field
• Some remarks on primality proving and elliptic curves

Uses Software

• ECPP
• BIGNUM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137447)