Constructing elliptic curves of prime order
From MaRDI portal
Publication:3533255
zbMATH Open1162.11028arXiv0712.2022MaRDI QIDQ3533255FDOQ3533255
Authors: Reinier Bröker, Peter Stevenhagen 
Publication date: 23 October 2008
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.
Full work available at URL: https://arxiv.org/abs/0712.2022
Recommendations
Elliptic curves over global fields (11G05) Complex multiplication and moduli of abelian varieties (11G15)
Cited In (43)
- \(N\)-systems, class polynomials of double eta-quotients and singular values of \(j\)-invariant function
- On finite fields for pairing based cryptography
- Modular polynomials via isogeny volcanoes
- The complexity of class polynomial computation via floating point approximations
- What is your ``birthday elliptic curve?
- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
- Title not available (Why is that?)
- Constructing elliptic curves over finite fields with prescribed torsion
- Constructing elliptic curves over finite fields using double eta-quotients
- Building Cyclic Elliptic Curves Modulo Large Primes
- Construction of elliptic curves over finite fields with a point of given order
- Ramanujan's class invariants and their use in elliptic curve cryptography
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- On counting and generating curves over small finite fields
- Computing modular polynomials in quasi-linear time
- Title not available (Why is that?)
- Constructions of elliptic curves endomorphisms
- Explicit computations in Iwasawa theory
- Progress in Cryptology - INDOCRYPT 2003
- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Construction of elliptic curves with cyclic groups over prime fields
- On the efficient generation of prime-order elliptic curves
- Title not available (Why is that?)
- An algorithmic construction of finite elliptic curves of order divisible by a large prime
- Efficient isogeny proofs using generic techniques
- Isomorphic transformations of an elliptic curve over a finite field
- Constructing elliptic curves and curves of genus 2 over finite fields
- Concurrently secure blind Schnorr signatures
- Constructing supersingular elliptic curves
- Distributed key agreement for group communications based on elliptic curves. An application to sensor networks.
- Elliptic Curves with a Given Number of Points
- Finding elliptic curves with a subgroup of prescribed size
- Efficient CM-constructions of elliptic curves over finite fields
- Choosing the correct elliptic curve in the CM method
- Title not available (Why is that?)
- Generalized class polynomials
- Compact elliptic curve representations
- Title not available (Why is that?)
- Building curves with arbitrary small MOV degree over finite prime fields
- Constructing elliptic curves from Galois representations
- The Diffie-Hellman problem and generalization of Verheul's theorem
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)
