Generating Pairing-Friendly Curves with the CM Equation of Degree 1

DOI10.1007/978-3-642-03298-1_5MaRDI QIDQ3392903zbMATH OpenOpenAlexFDO

Authors Hyang-Sook Lee, Cheol-Min Park

Publication date 18 August 2009

Published in Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03298-1_5

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• More Discriminants with the Brezing-Weng Method
• Constructing pairing-friendly curves with variable CM discriminant
• A new method of choosing primitive elements for Brezing-Weng families of pairing-friendly elliptic curves
• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials

Cites work

• A taxonomy of pairing-friendly elliptic curves
• Algorithmic Number Theory
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Elliptic curves suitable for pairing based cryptography
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Ordinary Abelian varieties having small embedding degree
• Pairing-Friendly Elliptic Curves of Prime Order
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• The Magma algebra system. I: The user language

Cited in

(9)

• Generating pairing-friendly elliptic curve parameters using sparse families
• A new method of choosing primitive elements for Brezing-Weng families of pairing-friendly elliptic curves
• TNFS resistant families of pairing-friendly elliptic curves
• Constructing polynomials for generating pairing-friendly elliptic curves
• Constructing pairing-friendly curves with variable CM discriminant
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
• More Discriminants with the Brezing-Weng Method
• Polynomial generating pairing and its criterion for optimal pairing

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Generating Pairing-Friendly Curves with the CM Equation of Degree 1

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