Paper 2024/538
A comment on "Comparing the MOV and FR reductions in elliptic curve cryptography" from EUROCRYPT'99
Abstract
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 computationally expensive due to the power of computers. We analysis the cost of the MOV reduction and the discrete logarithm problem of the curves in \cite{HSSI99} using Magma with an ordinary computer.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- MOV reductiondiscrete logarithm problemsupersingular elliptic curves
- Contact author(s)
- linqp @ 126 com
- History
- 2024-04-08: approved
- 2024-04-07: received
- See all versions
- Short URL
- https://ia.cr/2024/538
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/538,
author = {Qiping Lin and Fengmei Liu},
title = {A comment on "Comparing the {MOV} and {FR} reductions in elliptic curve cryptography" from {EUROCRYPT}'99},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/538},
year = {2024},
url = {https://eprint.iacr.org/2024/538}
}
