Optimal pairing computation over families of pairing-friendly elliptic curves
- 주제(키워드) Ate pairing , Elliptic curves , Pairing computation , R-ate pairing , Tate pairing
- 관리정보기술 faculty
- 등재 SCIE, SCOPUS
- 발행기관 Springer Verlag
- 발행년도 2011
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000092911
- 본문언어 영어
- Published As http://dx.doi.org/10.1007/s00200-011-0146-4
초록/요약
Vercauteren introduced the concept of optimal pairing, which by definition can be computed by using at most (log 2 r)/φ(k) + log 2 k basic Miller iterations, where r is the order of the groups involved and k is the embedding degree Vercauteren (IEEE Trans Inf Theory 56(1):455-461, 2010). Freeman et al. summarized and proposed all of the new constructions of pairing-friendly elliptic curves that currently exist Freeman et al. (J Cryptol 23(2):224-280, 2010). In this paper, we give an optimal pairing for each family of pairing-friendly curves in Freeman et al. (J Cryptol 23(2):224-280, 2010) by taking the Ate or R-ate pairing approach. © 2011 Springer-Verlag.
more