On the ρ-values of complete families of pairing-friendly elliptic curves
The parameter ρ of a complete family of pairing-friendly elliptic curves represents how suitable some given elliptic curves are in pairing-based cryptographic schemes. The superiority of the curves depends on how close ρ is to 1. Especially, the situation is ideal. We study whether a complete famil...
Main Author: | Okano Keiji |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2012-12-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2012-0011 |
Similar Items
-
Heuristics on pairing-friendly elliptic curves
by: Boxall John
Published: (2012-10-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) -
An attack on disguised elliptic curves
by: Morales David J. Mireles
Published: (2008-04-01) -
Generating pairing-friendly elliptic curve parameters using sparse families
by: Fotiadis Georgios, et al.
Published: (2018-06-01)