学术
An efficient algorithms for Tate pairing computation
WANG Mao-cai[1,2] HU Han-ping[1] DAI Guang-ming[2]
[1]Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan 430074, China; [2]School of Computer, China University of Geosciences, Wuhan 430074, China
文章出处:
《通讯和计算机》-2007年4卷8期 -20-23页
分 类 号:
相关文章:
An efficient algorithms for Tate pairing computation
Abstract:
The Weil and Tate pairings have found several new applications in cryptography. In most of these applications, the Weil pairing or Tate pairing of supersingular elliptic curves are essential tools. Therefore efficient computation of the Weil or Tate pairings are crucial factors for practical applications of the cryptographic protocols based pairings. The Weil pairing is thought one of two applications of the Tate pairing. Thus to compute the Weil pairing is more slow than the Tate pairing. To efficiently implement these cryptosystems it is necessary to optimize the computation time for the Tate pairing. This paper presents a new algorithm for computing Tate pairing, which is faster than Miller＇s algorithm that is the best-known general method. Finally, the computation cost of the new algorithm is compared with Miller＇s algorithm.[著者文摘]
Key words:
Tate pairing computation; Miller＇s algoritlm; cryptography
基金资助:
Acknowledgements： This work is supported by National 863 High Tech. Foundation in Information Security （No. 2006AA01Z426） and the Research Foundation for Outstanding Young Teachers, China University of Geosciences （Wuhan） （No. CUGQNL0727）.
更多>>免费文章
cqvip.com