A comment on "Comparing the MOV and FR reductions in elliptic curve cryptography" from EUROCRYPT'99

ePrint Report: A comment on "Comparing the MOV and FR reductions in elliptic curve cryptography" from EUROCRYPT'99

Qiping Lin, Fengmei Liu

In general the discrete logarithm problem is a hard problem in the elliptic curve cryptography, and the best known solving algorithm have exponential running time. But there exists a class of curves, i.e. supersingular elliptic curves, whose discrete logarithm problem has a subexponential solving algorithm called the MOV attack. In 1999, the cost of the MOV reduction is still …

algorithm cryptography curve elliptic elliptic curve cryptography eprint report eurocrypt general hard mov problem report running