Improved Algorithm for Tate Pairing Computation

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Jan 2008Publisher:IEEEJournal:2008 International Symposium on Electronic Commerce and Security

Authors: Ting Wu 0001; Min Zhang; Xiaoliang Xu; Rongbo Wang;

doi: 10.1109/isecs.2008.34

Improved Algorithm for Tate Pairing Computation

- Summary
- Metrics

Abstract

In this paper, an efficient algorithm for the computation of Tate pairing on general curves is presented. Our approach is to change the binary representation of the involved integer to its non-adjacent form at first, and then pre-organize this form to make further improvement on its efficiency. We also show this algorithm has better performance than BMX and LHC algorithms.

Related Organizations

Hangzhou Dianzi University
China (People's Republic of)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average