Pairing inversion for finding discrete logarithms
Fundamentalʹnaâ i prikladnaâ matematika, Tome 18 (2013) no. 4, pp. 185-195
Voir la notice de l'article provenant de la source Math-Net.Ru
This paper proposes an inversion algorithm for pairings. This technique can be used for breaking the Diffie–Hellman protocol on elliptic curves and for solving the discrete logarithm problem on some curves that satisfy GOST P.34.10-2012.
@article{FPM_2013_18_4_a12,
author = {M. A. Cherepniov},
title = {Pairing inversion for finding discrete logarithms},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {185--195},
publisher = {mathdoc},
volume = {18},
number = {4},
year = {2013},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2013_18_4_a12/}
}
M. A. Cherepniov. Pairing inversion for finding discrete logarithms. Fundamentalʹnaâ i prikladnaâ matematika, Tome 18 (2013) no. 4, pp. 185-195. http://geodesic.mathdoc.fr/item/FPM_2013_18_4_a12/