Constructing polynomials for generating pairing-friendly elliptic curves

MaRDI QIDQ3169520zbMATH OpenFDO

Authors Zhitu Su, Hui Li, Jian-Feng Ma

Publication date 29 September 2011

zbMATH Keywords

elliptic curvenumber fieldpairingpolynomial

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
• Generating pairing-friendly elliptic curve parameters using sparse families
• Generating Pairing-Friendly Curves with the CM Equation of Degree 1
• Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
• Note on families of pairing-friendly elliptic curves with small embedding degree

Cited in

(2)

• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
• Revisiting cycles of pairing-friendly elliptic curves

This page was built for publication: Constructing polynomials for generating pairing-friendly elliptic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169520)