Computing the endomorphism ring of an ordinary elliptic curve over a finite field
Authors:
- Gaetan BissonGBGaetan Bisson
- Andrew V. SutherlandASAndrew V. Sutherland
- 1 May 2011
- journal article
- Published by Elsevier in Journal of Number Theory
- Vol. 131 (5) , 815-831
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Computing modular polynomials in quasi-linear timeMathematics of Computation, 2009
- A 𝑝-adic algorithm to compute the Hilbert class polynomialMathematics of Computation, 2008
- PRIMES is in PAnnals of Mathematics, 2004
- Counting points on elliptic curves over finite fieldsJournal de Théorie des Nombres de Bordeaux, 1995
- Elliptic curves and primality provingMathematics of Computation, 1993
- A rigorous time bound for factoring integersJournal of the American Mathematical Society, 1992
- A rigorous subexponential algorithm for computation of class groupsJournal of the American Mathematical Society, 1989
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- On the number of positive integers ≦ x and free of prime factors > yJournal of Number Theory, 1986
- On the coefficients of the transformation polynomials for the elliptic modular functionMathematical Proceedings of the Cambridge Philosophical Society, 1984