Autosoft Journal

Online Manuscript Access


Implementation And Optimization For Tate Pairing



Abstract

Tate pairings has found several new applications in cryptography. However, how to compute Tate pairing is a research focus in all kinds of applications of pairing-based cryptosysterns (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. Moreover, an optimization implementation of Miller's algorithm for computing Tate pairing is given. Finally, the computation efficiency of Tate pairing using the new parameters for PBC is analyzed, which saves 25.4 of the time to compute the Tate pairing.


Keywords


Pages

Total Pages: 11
Pages: 607-617

DOI
10.1080/10798587.2011.10643174


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways


Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Published

Volume: 17
Issue: 5
Year: 2011

Cite this document


References

X.A. Boyen. Promenade through the new cryptography of bilinear pairings// Proceedings of IEEE Information Theory Workshop. Washington, USA: IEEE Press, 2006:19–23.

S.D. Galbraith, K Harrison, D. Solders. Implementing the fate pairing// Proceedings of the Fifth Symposium on Algorithmic Number Theory, LNCS 2369, Springer-Verlag, 2002:324–337.

B. Lynn. On the implementation of pairing-based cryptosystems. USA: Stanford University, 2007.

M. Stogbauer. Efficient Algorithms for pairing-based cryptosystems. Germany: Darmstadt University of Technology, 2004.

M. Scott, N. Costigan, W. Abdulwahab. Implementing Cryptographic Pairings on Smartcards//Proceedings of Cryptographic Hardware and Embedded Systems, LNCS 4249, Springer-Verlag, 2006:134–147.

S. Kwon. Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields//Proceedings of Australasian Conference on Information Security and Privacy, LNCS 3574, Springer-Verlag, 2005:134–145.

L Duursma I, H. Lee. Tate pairing implementation for hyperelliptic curves y

M.C. Wang, G.M. Dai, H.P. Hu, et al. Selection of Security Elliptic Curve Based on Evolution Algorithm// Proceedings of international conference on Computational Intelligence and Natural Computing, IEEE Press, 2009:55–57.

V.S. Miller. Short Programs for Functions on Curves. New York: Exploratory Computer Science IBM,1986.

Atkin A.O.L. AND E Morain F. Elliptic curves and primality proving. Research Report 1256, INRIA, Juin 1990. Submitted to Math. Comp.

IEEE-SA Standards Board. IEEE standard specifications for public-key cryptography.2000–1–30.

K.C. Lu, H.M. Lu. Algorithms Introduce of elliptic curve cryptosystems]. Beijing: Tsinghua University Press, 2008:22–22. (in Chinese).

K. Eisentrager, K Lauter, P.L. Montgomery. Fast elliptic curve arithmetic and improved Weil pairing evaluation// Proceedings of the 2003 RSA conference on The cryptographers’ track, LNCS 2612, Springer-Verlag, 2003: 343–354.

D. Boneh, M. Franklin. Identity-Based encryption from the Weil pairing. In Advances in Cryptology’01, Springer-Verlag, 2001, 213–229.

JOURNAL INFORMATION


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)
Journal: 1995-Present

SCImago Journal & Country Rank


CONTACT INFORMATION


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048
EMAIL: tsiepress@gmail.com
WEB: http://www.wacong.org/tsi/