Constructing elliptic curves of prime order

zbMath1162.11028arXiv0712.2022MaRDI QIDQ3533255

Peter Stevenhagen, Reinier Bröker

Publication date: 23 October 2008

Full work available at URL: https://arxiv.org/abs/0712.2022

zbMATH Keywords

elliptic curvescryptographycomplex multiplicationclass invariantsHasse-Weil bound

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Complex multiplication and moduli of abelian varieties (11G15)

Related Items

Explicit computations in Iwasawa theory ⋮ Isomorphic transformations of an elliptic curve over a finite field ⋮ Modular polynomials via isogeny volcanoes ⋮ What is your ``birthday elliptic curve? ⋮ Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography ⋮ The complexity of class polynomial computation via floating point approximations ⋮ Computing modular polynomials in quasi-linear time ⋮ Ramanujan's class invariants and their use in elliptic curve cryptography ⋮ The Diffie-Hellman problem and generalization of Verheul's theorem ⋮ Distributed key agreement for group communications based on elliptic curves. An application to sensor networks. ⋮ Generalized class polynomials