Construction of Pairing-Friendly Elliptic Curves
نویسنده
چکیده
The aim of this paper is to construct pairing friendly elliptic curves. In this paper, we explain a method of finding the polynomials representing √−D and ζk over the field containing √−D and ζk and how to construct a pairing friendly elliptic curves over the cyclotomic fields containing Q(ζk, √−D) for arbitrary k and D by CP method. By using the factorization of the cyclotomic polynomial combined some polynomial, we extend the construction over cyclotomic fields to the construction over some extensions of the cyclotomic fields containing Q(ζk, √−D). We explain the limitation of finding more families of pairing friendly elliptic curves with embedding degree 10. For all computation, we use the PARI-GP [13].
منابع مشابه
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
We describe a new method for constructing Brezing-Wenglike pairing-friendly elliptic curves. The new construction uses the minimal polynomials of elements in a cyclotomic field. Using this new construction we present new “record breaking” families of pairing-friendly curves with embedding degrees of k ∈ {16, 18, 36, 40}, and some interesting new constructions for the cases k ∈ {8, 32}.
متن کاملA new method of choosing primitive elements for Brezing-Weng families of pairing-friendly elliptic curves
In this paper we present a new method of choosing primitive elements for BrezingWeng families of pairing friendly elliptic curves with small rho-value, and we improve on previously-known best rho-values of families [10] for the cases k = 16, 22, 28 and 46. Our construction uses xed discriminants.
متن کاملPairing-friendly Elliptic Curves of Embedding Degree 1 and Applications to Cryptography
Recently, Wang et al. [1] proposed a new method for constructing pairingfriendly elliptic curves of embedding degree 1. Authors claim that this method significantly improves the efficiency of generating elliptic curves. In this paper, we give the arithmetic of pairing-friendly elliptic curves of embedding degree 1. We prove that conventional classification of pairings into Type 1, 2, 3 and 4 is...
متن کاملConstructing Pairing-friendly Curves with Variable Cm Discriminant
A new algorithm is proposed for the construction of BrezingWeng-like elliptic curves such that polynomials defining the CM discriminant are linear. Using this construction, new families of curves with variable discriminants and embedding degrees of k ∈ {8, 16, 20, 24}, which were not covered by Freeman, Scott, and Teske [9], are presented. Our result is useful for constructing elliptic curves w...
متن کاملEffective Polynomial Families for Generating More Pairing-Friendly Elliptic Curves
Finding suitable non-supersingular elliptic curves becomes an important issue for the growing area of pairing-based cryptosystems. For this purpose, many methods have been proposed when embedding degree k and cofactor h are taken different values. In this paper we propose a new method to find pairing-friendly elliptic curves without restrictions on embedding degree k and cofactor h. We propose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007