On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with \(\rho =1\)

详细信息    查看全文

• 关键词：Elliptic curves ; Pairing based cryptography ; Cyclotomic polynomials ; Parameterized families
• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10143
• 期：1
• 页码：403-415
• 丛书名：Information Security and Cryptology
• ISBN：978-3-319-54705-3
• 卷排序：10143

文摘

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.