상세정보
학술지
Efficient Computation of Eta Pairing Over Binary Field with Vandermonde Matrix
- 저자
- Masaaki Shirase, Tsuyoshi Takagi, 최두호, 한동국, 김호원
- 발행일
- 200904
- 출처
- ETRI Journal, v.31 no.2, pp.129-139
- ISSN
- 1225-6463
- 출판사
- 한국전자통신연구원 (ETRI)
- 협약과제
- 09MS5600, 부채널 공격 방지 원천 기술 및 안전성 검증 기술개발, 최두호
- 초록
- This paper provides an efficient algorithm for computing the ηTpairing on supersingular elliptic curves over fields of characteristic two. In the proposed algorithm, we deploy ploy a modified multiplication in F24nusing the Vandermonde matrix. For F, G;24nthe proposed multiplication method computes B . F .G instead ofF G . with some 棺.F.G because 棺 is eliminated by the final exponentiation of the pairing computation. The proposed multiplication method asymptotically requires only 7 multiplications in 2n F as n 8 , while the cost of the previously fastest Karatsuba method is 9 multiplications in 2n F . Consequently, the cost of the T pairing computation is reduced by 14.3%.
- KSP 제안 키워드
- Binary fields, Efficient algorithms, Efficient computation, Final Exponentiation, Karatsuba method, Pairing computation, Supersingular elliptic curves, Vandermonde matrix