Abstract
The problem of constructing pairing-friendly elliptic curves is the key ingredients for implementing pairing-based cryptographic systems. In this paper, we aim at constructing such curves with \(\rho =1\). By offering a more generalized concept “parameterized families”, we propose a method for constructing parameterized families of pairing-friendly elliptic curves which can naturally include many existent (and even more new) families of curves without exhaustive survey. We demonstrate the utility of the method by constructing concrete parameterized family in the cases of embedding degree 3, 4 and 6. An interesting result is proved that all the possible quadratic families of pairing-friendly elliptic curves of desired embedding degrees satisfying \(\rho =1\) have been covered in our parameterized families. As a by-product, we also revisit the supersingular elliptic curves from a new perspective.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
