Polynomial generating pairing and its criterion for optimal pairing
From MaRDI portal
(Redirected from Publication:744018)
Recommendations
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1
- Optimal pairing computation over families of pairing-friendly elliptic curves
- Generating pairing-friendly elliptic curve parameters using sparse families
- A taxonomy of pairing-friendly elliptic curves
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- A taxonomy of pairing-friendly elliptic curves
- Advances in Cryptology - ASIACRYPT 2003
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Efficient pairing computation on supersingular abelian varieties
- Elliptic Curves and Primality Proving
- Elliptic curves suitable for pairing based cryptography
- Optimal Pairings
- Pairing Lattices
- Pairing-Friendly Elliptic Curves of Prime Order
- The Eta Pairing Revisited
- The Magma algebra system. I: The user language
- The Weil pairing, and its efficient calculation
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
This page was built for publication: Polynomial generating pairing and its criterion for optimal pairing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744018)