논문
Optimal pairing computation over families of pairing-friendly Elliptic curves
- 저자Soo-Kyung Eom, Hyang-Sook Lee and Cheol-Min Park
- 학술지Applicable Algebra in Engineering, Communication and Computing 22
- 등재유형
- 게재일자(2011)
Vercauteren introduced the concept of optimal pairing, which by definition can be computed by using at most (log2 r)/φ(k) + log2 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.
Vercauteren introduced the concept of optimal pairing, which by definition can be computed by using at most (log2 r)/φ(k) + log2 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.
