By Topic

An Efficient Generation Method of Elliptic Curve for Pairing-Based Cryptosystems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Maocai Wang ; Sch. of Comput., China Univ. of Geosicences, Wuhan, China ; Guangming Dai ; Hanping Hu

Efficient computation of Tate pairing is a crucial factor for practical applications of pairing-based cryptosystems. Recently, there have been many improvements for the computation of Tate pairing, which focuses on the arithmetical operations above the finite field. In this paper, we analyze the structure of Miller’s algorithm firstly, which is used to implement Tate pairing. Then, according to the characteristics that Miller’s algorithm will be improved tremendous if the order of the subgroup of elliptic curve group is low hamming prime, we present an effective generation method of elliptic curve using the Fermat number, which enable it feasible that there is certain some subgroup of low hamming prime order in the elliptic curve group generated. Finally, we give an example to generate elliptic curve, which includes the subgroup with low hamming prime order. It is clear that the computation of Tate pairing above elliptic curve group generating by our method can be improved tremendously.

Published in:

Machine Vision and Human-Machine Interface (MVHI), 2010 International Conference on

Date of Conference:

24-25 April 2010