On conditions for ρ-value is 1 or not of complete family of pairing-friendly elliptic curves
arXiv:1205.1646v11 citations
Originality Synthesis-oriented
AI Analysis
This addresses a theoretical problem in cryptography for researchers, but appears incremental as it focuses on specific conditions without broad new methods.
The paper tackled the problem of determining when a complete family of pairing-friendly elliptic curves has a ρ-value of 1, and found that in some cases, ρ-values are not equal to 1.
We study whether a complete family of pairing friendly elliptic curves has a ρ-value 1 or not. We show that, in some cases, ρ-values are not to be 1.