Constructing elliptic curves of prime order
From MaRDI portal
Publication:3533255
Abstract: We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((log N)^3), and it is so fast that it may profitably be used to tackle the related problem of finding elliptic curves with point groups of prime order of prescribed size. We also discuss the impact of the use of high level modular functions to reduce the run time by large constant factors and show that recent gonality bounds for modular curves imply limits on the time reduction that can be obtained.
Recommendations
Cited in
(43)- Constructions of elliptic curves endomorphisms
- Construction of elliptic curves over finite fields with a point of given order
- Isomorphic transformations of an elliptic curve over a finite field
- Elliptic Curves with a Given Number of Points
- Computing modular polynomials in quasi-linear time
- scientific article; zbMATH DE number 6382357 (Why is no real title available?)
- Efficient CM-constructions of elliptic curves over finite fields
- Explicit computations in Iwasawa theory
- Ramanujan's class invariants and their use in elliptic curve cryptography
- scientific article; zbMATH DE number 1878329 (Why is no real title available?)
- The Diffie-Hellman problem and generalization of Verheul's theorem
- Constructing elliptic curves over finite fields using double eta-quotients
- Progress in Cryptology - INDOCRYPT 2003
- Choosing the correct elliptic curve in the CM method
- scientific article; zbMATH DE number 799785 (Why is no real title available?)
- \(N\)-systems, class polynomials of double eta-quotients and singular values of \(j\)-invariant function
- On finite fields for pairing based cryptography
- Constructing elliptic curves over finite fields with prescribed torsion
- Compact elliptic curve representations
- scientific article; zbMATH DE number 2154267 (Why is no real title available?)
- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
- Building Cyclic Elliptic Curves Modulo Large Primes
- Building curves with arbitrary small MOV degree over finite prime fields
- Construction of elliptic curves with cyclic groups over prime fields
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- scientific article; zbMATH DE number 1588468 (Why is no real title available?)
- An algorithmic construction of finite elliptic curves of order divisible by a large prime
- Modular polynomials via isogeny volcanoes
- Efficient isogeny proofs using generic techniques
- The complexity of class polynomial computation via floating point approximations
- What is your ``birthday elliptic curve?
- Constructing supersingular elliptic curves
- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
- Finding elliptic curves with a subgroup of prescribed size
- Generalized class polynomials
- Concurrently secure blind Schnorr signatures
- Constructing elliptic curves and curves of genus 2 over finite fields
- On counting and generating curves over small finite fields
- On the efficient generation of prime-order elliptic curves
- Constructing elliptic curves from Galois representations
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- scientific article; zbMATH DE number 1857518 (Why is no real title available?)
- Distributed key agreement for group communications based on elliptic curves. An application to sensor networks.
This page was built for publication: Constructing elliptic curves of prime order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533255)
