DocumentCode :
1575275
Title :
Constructing pairing-friendly elliptic curve
Author :
Dai, Guangming ; Wang, Maocai ; Pen, Lei ; Hu, Hanping
Author_Institution :
School of Computer, China University of Geosciences, Wuhan, 430074, China
fYear :
2012
Firstpage :
499
Lastpage :
502
Abstract :
How to compute Tate pairing is a research focus in all kinds of applications of pairing-based cryptosystems (PBC). In the paper, the structure of Miller´s algorithm is firstly analyzed, which is used to implement Tate pairing. Based on the characteristics that Miller´s algorithm will be improved tremendous if the order of the subgroup of elliptic curve group is low hamming prime, a method of generating primes with low hamming is presented. Then, a new method for generating parameters for PBC is put forward, which enable it feasible that there is certain some subgroup of low hamming prime order in the elliptic curve group generated. Finally, the computation efficiency of Tate pairing using the new parameters for PBC is analyzed, which saves 25% of the time to compute the Tate pairing.
Keywords :
Elliptic Curve; Low hamming; Miller´s algorithm; Pairing-based cryptosystems; Tate pairing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
World Automation Congress (WAC), 2012
Conference_Location :
Puerto Vallarta, Mexico
ISSN :
2154-4824
Print_ISBN :
978-1-4673-4497-5
Type :
conf
Filename :
6321101
Link To Document :
بازگشت