On the elliptic curves y2=x3−c with embedding degree one

作者:

Highlights:

摘要

In this paper, we give a family of elliptic curves E in the form y2=x3−c over the prime field Fp with embedding degree k=1. This was carried out by computing the explicit formula of the number of points #E(Fp) of the elliptic curve y2=x3−c. Using this computation, we show that the elliptic curve y2=x3−1 over Fp for the primes p of the form 27A2+1 has an embedding degree k=1. Finally, we give examples of those primes p for which the security level of the pairing-based cryptographic protocols on the curve y2=x3−1 over Fp is equivalent to 128-, 192-, or 256-bit AES keys.

论文关键词:Elliptic curves,Pairing-based cryptography,Embedding degree,Characters,Jacobi sums

论文评审过程:Received 13 October 2009, Revised 17 August 2010, Available online 31 August 2010.

论文官网地址:https://doi.org/10.1016/j.cam.2010.08.020