The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm

DOI10.1007/s001459900040zbMath0978.94038MaRDI QIDQ1126894

R. Balasubramanian, Neal Koblitz

Publication date: 25 October 1998

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001459900040

zbMATH Keywords

discrete logarithm; elliptic curve cryptosystem; MOV algorithm

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11Y16: Number-theoretic algorithms; complexity

11G20: Curves over finite and local fields

14Q05: Computational aspects of algebraic curves

Related Items

An Analysis of the Vector Decomposition Problem, Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction, Algebraic curves and cryptography, Closed formulae for the Weil pairing inversion, Using abelian varieties to improve pairing-based cryptography, Ordinary Abelian varieties having small embedding degree, Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order, Elliptic curves suitable for pairing based cryptography, Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax, Families of genus 2 curves with small embedding degree