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

DOI10.1007/978-3-642-03298-1_5zbMath1250.14017OpenAlexW1550380804MaRDI QIDQ3392903

Cheol-Min Park, Hyang-Sook Lee

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

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

Related Items (2)

Generating pairing-friendly elliptic curve parameters using sparse families ⋮ TNFS resistant families of pairing-friendly elliptic curves

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A taxonomy of pairing-friendly elliptic curves
• Ordinary Abelian varieties having small embedding degree
• Elliptic curves suitable for pairing based cryptography
• 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
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Pairing-Friendly Elliptic Curves of Prime Order
• Algorithmic Number Theory

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