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/}
}
TY  - JOUR
AU  - M. A. Cherepniov
TI  - Pairing inversion for finding discrete logarithms
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2013
SP  - 185
EP  - 195
VL  - 18
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_2013_18_4_a12/
LA  - ru
ID  - FPM_2013_18_4_a12
ER  - 
%0 Journal Article
%A M. A. Cherepniov
%T Pairing inversion for finding discrete logarithms
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2013
%P 185-195
%V 18
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_2013_18_4_a12/
%G ru
%F 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/