We consider the problem of computing large prime degree isogenies on elliptic curves and show that in some cases one can do this in polynomial time (i.e., polynomial in log of the degree of the isogeny).