On remarks of lifting problems for elliptic curves (Q2729682)

The fact that there is no subexponential algorithm known to compute discrete logarithms in the group of points of an elliptic curve over a finite field is the basis of most elliptic cryptographic systems. NEWLINENEWLINENEWLINEThe authors study the problem of lifting an elliptic curve over a finite field together with one or more points to an elliptic curve over a number field or a function field. They show that efficient algorithms to do this may be used to compute discrete logarithms. Unfortunately, as the authors point out, the lifting problem may well be substantially harder than computing discrete logarithms.