Pages that link to "Item:Q1126894"
From MaRDI portal
The following pages link to The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm (Q1126894):
Displaying 36 items.
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) (← links)
- On the \({\ell}\)-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\) (Q501160) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
- Closed formulae for the Weil pairing inversion (Q938771) (← links)
- On the embedding degree of reductions of an elliptic curve (Q989443) (← links)
- Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
- Pairing-based cryptography on elliptic curves (Q1616164) (← links)
- Isolated elliptic curves and the MOV attack (Q1676235) (← links)
- MOV attack in various subgroups on elliptic curves (Q1766871) (← links)
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields (Q1949237) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
- Ordinary Abelian varieties having small embedding degree (Q2467316) (← links)
- Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order (Q2505361) (← links)
- Elliptic curves suitable for pairing based cryptography (Q2572982) (← links)
- On the near prime-order MNT curves (Q2631924) (← links)
- A new attack on the KMOV cryptosystem (Q2925719) (← links)
- Heuristics on pairing-friendly abelian varieties (Q2942134) (← links)
- On Near Prime-Order Elliptic Curves with Small Embedding Degrees (Q2947154) (← links)
- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree (Q2947157) (← links)
- Elliptic curves with<i>j</i>= 0,1728 and low embedding degree (Q2958273) (← links)
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Heuristic counting of Kachisa-Schaefer-Scott curves (Q3121368) (← links)
- A relation between embedding degrees and class numbers of binary quadratic forms (Q3189461) (← links)
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1 (Q3392903) (← links)
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax (Q3600501) (← links)
- Families of genus 2 curves with small embedding degree (Q3632750) (← links)
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves (Q5389447) (← links)
- An Analysis of the Vector Decomposition Problem (Q5445460) (← links)
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction (Q5448547) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves (Q6074017) (← links)
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)
