More Discriminants with the Brezing-Weng Method

Authors:
Gaetan Bisson;Takakazu Satoh
Affiliations:
LORIA, Vandoeuvre-lès-Nancy, France 54506 and Technische Universiteit Eindhoven, Eindhoven, The Netherlands 5600;Tokyo Institute of Technology, Tokyo, Japan 152-8551
Venue:
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Year:
2008

Citing 4
Cited 1

Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Elliptic Curves Suitable for Pairing Based Cryptography

Designs, Codes and Cryptography
Pairing-Friendly elliptic curves of prime order

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography

On constructing families of pairing-friendly elliptic curves with variable discriminant

INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Brezing-Weng method is a general framework to generate families of pairing-friendly elliptic curves. Here, we introduce an improvement which can be used to generate more curves with larger discriminants. Apart from the number of curves this yields, it provides an easy way to avoid endomorphism rings with small class number.