On the evaluation of modular polynomials

Details On the evaluation of modular polynomials On the evaluation of modular polynomials

2012-02-17

arxiv.org/abs/1202.3985v1

Mathematics

Number Theory

17 pages

Scientific paper

We present two algorithms that, given a prime ell and an elliptic curve E/Fq, directly compute the polynomial Phi_ell(j(E),Y) in Fq[Y] whose roots are the j-invariants of the elliptic curves that are ell-isogenous to E. We do not assume that the modular polynomial Phi_ell(X,Y) is given. The algorithms may be adapted to handle other types of modular polynomials, and we consider applications to point counting and the computation of endomorphism rings. We demonstrate the practical efficiency of the algorithms by setting a new point-counting record, modulo a prime q with more than 5,000 decimal digits, and by evaluating a modular polynomial of level ell = 100,019.

Affiliated with

Also associated with

No associations

Rating

On the evaluation of modular polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the evaluation of modular polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the evaluation of modular polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36621