Fast Parallel Computation of Tate Pairing

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Nov 2011Publisher:IEEEJournal:2011 Third International Conference on Intelligent Networking and Collaborative Systems

Authors: Zhitu Su; Chunhui Sun; Hui Li 0006; Jianfeng Ma 0001; Kai Fan 0001;

doi: 10.1109/incos.2011.93

Fast Parallel Computation of Tate Pairing

- Summary
- Metrics

Abstract

In pairing-based cryptography, Miller's algorithm plays a key role in the calculation of pairing. Currently, most of the optimizations of Miller's algorithm are of serial structure. In this paper, we propose a parallel method for efficiently computing pairing. Our method can be applied to super singular elliptic curves and ordinary elliptic curves which are suitable for pairing-based cryptography. Compared with general version of Miller's algorithm, our method has a gain of around 50.0\%.

Related Organizations

Xidian 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).	1
	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