On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant

DOI10.1007/978-3-642-25578-6_22zbMath1291.94075OpenAlexW46603875MaRDI QIDQ3104749

Robert Dryło

Publication date: 16 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25578-6_22

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) 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

Cites Work

• A taxonomy of pairing-friendly elliptic curves
• Ordinary Abelian varieties having small embedding degree
• Generating more MNT elliptic curves
• Elliptic curves suitable for pairing based cryptography
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• An Identity-Based Signature from Gap Diffie-Hellman Groups
• Pairing-Friendly Elliptic Curves of Prime Order
• More Discriminants with the Brezing-Weng Method
• Algorithmic Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant