Comparing the MOV and FR Reductions in Elliptic Curve Cryptography

DOI10.1007/3-540-48910-X_14zbMath0938.94009OpenAlexW1569862725MaRDI QIDQ4250762

Joe Suzuki, Ryuichi Harasawa, Junji Shikata, Hiroshi Imai

Publication date: 7 June 2000

Published in: Advances in Cryptology — EUROCRYPT ’99 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-48910-x_14

zbMATH Keywords

algorithmselliptic curvesgroup of rational pointsdiscrete logarithmcryptosystemspractical implementationselliptic curve over a finite fieldrunning times

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

The generalized Weil pairing and the discrete logarithm problem on elliptic curves

This page was built for publication: Comparing the MOV and FR Reductions in Elliptic Curve Cryptography