Ordinary Abelian varieties having small embedding degree
From MaRDI portal
(Redirected from Publication:2467316)
Recommendations
- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
- Using abelian varieties to improve pairing-based cryptography
- Elliptic curves suitable for pairing based cryptography
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
- Generating more MNT elliptic curves
Cites work
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 8542 (Why is no real title available?)
- scientific article; zbMATH DE number 706265 (Why is no real title available?)
- scientific article; zbMATH DE number 1942430 (Why is no real title available?)
- scientific article; zbMATH DE number 1942431 (Why is no real title available?)
- scientific article; zbMATH DE number 2081083 (Why is no real title available?)
- scientific article; zbMATH DE number 2086895 (Why is no real title available?)
- scientific article; zbMATH DE number 233957 (Why is no real title available?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Advances in Cryptology - ASIACRYPT 2003
- Efficient pairing computation on supersingular abelian varieties
- Elliptic curves suitable for pairing based cryptography
- Generating more MNT elliptic curves
- The Magma algebra system. I: The user language
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
Cited in
(28)- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- On near prime-order elliptic curves with small embedding degrees
- Elliptic curves with j=0,1728 and low embedding degree
- Constructing families of pairing-friendly elliptic curves with small -value and rational solutions of some systems of polynomial equations
- Abelian Varieties with Prescribed Embedding Degree
- Heuristics on pairing-friendly abelian varieties
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
- On the near prime-order MNT curves
- On constructing parameterized families of pairing-friendly elliptic curves with =1
- Generating pairing-friendly elliptic curve parameters using sparse families
- Note on families of pairing-friendly elliptic curves with small embedding degree
- On constructing families of pairing-friendly elliptic curves with variable discriminant
- A survey of elliptic curves for proof systems
- Revisiting cycles of pairing-friendly elliptic curves
- A taxonomy of pairing-friendly elliptic curves
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- Faster computation of the Tate pairing
- MNT elliptic curves with non-prime order
- Families of prime-order endomorphism-equipped embedded curves on pairing-friendly curves
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
- Abelian varieties with prescribed embedding and full embedding degrees
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
This page was built for publication: Ordinary Abelian varieties having small embedding degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467316)
