Analysis of the Xedni calculus attack

The xedni calculus attack on the elliptic curve discrete logarithm problem (ECDLP) involves lifting points from the finite field F-p to the rational n umbers Q and then constructing an elliptic curve over Q that passes through them. If the lifted points are linearly dependent, then the ECDLP is solve d. Our purpose is to analyze the practicality of this algorithm. We find th at asymptotically the algorithm is virtually certain to fail, because of an absolute bound on the size of the coefficients of a relation satisfied by the lifted points. Moreover, even for smaller values of p experiments show that the odds against finding a suitable lifting are prohibitively high.