An isogeny between elliptic curves is an algebraic morphism which is a group
homomorphism. Many applications in cryptography require evaluating large degree
isogenies between elliptic curves efficiently. For ordinary curves of the same
endomorphism ring, the previous best known algorithm has a worst case running
time which is exponential in the length of the input.