Presentation	2003/3/20 Efficient Computations of the Tate Pairing for the Large MOV Degrees Tetsuya IZU, Tsuyoshi TAKAGI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The Tate pairing has plenty of attractive applications and fast implementations have been reported. However, these implementations are restricted to supersingular curves with small MOV degrees. In this paper we propose improvements of computing the Tate pairing over general elliptic curves over finite fields F_(p>3).The proposed algorithm is specially effective upon the curves that has a large MOV degree κ=6, the proposed algorithm is about 20% faster than previously fastest algorithm.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Elliptic curve cryptosystem / Tate pairing / Jacobian coordinate / MOV degree
Paper #	IT2002-85,ISEC2002-143,SST2002-191,ITS2002-168
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2003/3/20(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Information Security (ISEC)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Efficient Computations of the Tate Pairing for the Large MOV Degrees
Sub Title (in English)
Keyword(1)	Elliptic curve cryptosystem
Keyword(2)	Tate pairing
Keyword(3)	Jacobian coordinate
Keyword(4)	MOV degree
1st Author's Name	Tetsuya IZU
1st Author's Affiliation	FUJITSU LABORATORIES Ltd., Secure Computing Lab.()
2nd Author's Name	Tsuyoshi TAKAGI
2nd Author's Affiliation	FUJITSU LABORATORIES Ltd., Secure Computing Lab.
Date	2003/3/20
Paper #	IT2002-85,ISEC2002-143,SST2002-191,ITS2002-168
Volume (vol)	vol.102
Number (no)	744
Page	pp.pp.-
#Pages	6
Date of Issue