The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
From MaRDI portal
Publication:1126894
DOI10.1007/s001459900040zbMath0978.94038OpenAlexW2071680489MaRDI QIDQ1126894
Neal Koblitz, R. Balasubramanian
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05)
Related Items (35)
Pairing-based cryptography on elliptic curves ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ On the near prime-order MNT curves ⋮ A relation between embedding degrees and class numbers of binary quadratic forms ⋮ Isolated elliptic curves and the MOV attack ⋮ Heuristics on pairing-friendly abelian varieties ⋮ On Near Prime-Order Elliptic Curves with Small Embedding Degrees ⋮ Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves ⋮ Elliptic curves withj= 0,1728 and low embedding degree ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists ⋮ Computing bilinear pairings on elliptic curves with automorphisms ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields ⋮ On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ Closed formulae for the Weil pairing inversion ⋮ On the \({\ell}\)-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\) ⋮ Ordinary Abelian varieties having small embedding degree ⋮ Algebraic curves and cryptography ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax ⋮ On the embedding degree of reductions of an elliptic curve ⋮ Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order ⋮ An Analysis of the Vector Decomposition Problem ⋮ Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction ⋮ Polynomial generating pairing and its criterion for optimal pairing ⋮ Families of genus 2 curves with small embedding degree ⋮ Generating Pairing-Friendly Curves with the CM Equation of Degree 1 ⋮ Using abelian varieties to improve pairing-based cryptography ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 ⋮ Heuristic counting of Kachisa-Schaefer-Scott curves ⋮ Elliptic curves suitable for pairing based cryptography
This page was built for publication: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
