|
Fundamentalnaya i Prikladnaya Matematika, 2013, Volume 18, Issue 4, Pages 185–195
(Mi fpm1537)
|
|
|
|
Pairing inversion for finding discrete logarithms
M. A. Cherepniov Lomonosov Moscow State University, Moscow, Russia
Abstract:
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.
Citation:
M. A. Cherepniov, “Pairing inversion for finding discrete logarithms”, Fundam. Prikl. Mat., 18:4 (2013), 185–195; J. Math. Sci., 206:6 (2015), 734–741
Linking options:
https://www.mathnet.ru/eng/fpm1537 https://www.mathnet.ru/eng/fpm/v18/i4/p185
|
Statistics & downloads: |
Abstract page: | 314 | Full-text PDF : | 198 | References: | 45 |
|