Heuristics on pairing-friendly elliptic curves
We present a heuristic asymptotic formula as for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree , with fixed discriminant, with rho-value bounded by a fixed such that , and with prime subgroup order at most x.
Main Author: | Boxall John |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2012-10-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2011-0004 |
Similar Items
-
On the ρ-values of complete families of pairing-friendly elliptic curves
by: Okano Keiji
Published: (2012-12-01) -
High-Speed Elliptic Curve and Pairing-Based Cryptography
by: Longa, Patrick
Published: (2011) -
High-Speed Elliptic Curve and Pairing-Based Cryptography
by: Longa, Patrick
Published: (2011) -
Efficient Algorithms for Elliptic Curve Cryptosystems
by: Guajardo, Jorge
Published: (2000) -
A new method of choosing primitive elements for Brezing–Weng families of pairing-friendly elliptic curves
by: Yoon Kisoon
Published: (2015-03-01)