When we implement the η T pairing, which is one of the fastest pairings, we need multiplications in a base field and in a group G. We have previously regarded elements in G as those in to implement the η T pairing. Gorla et al. proposed a multiplication algorithm in that takes 5 multiplications in , namely 15 multiplications in . This algorithm then reaches the theoretical lower bound of the number of multiplications. On the other hand, we may also regard elements in G as those in the residue group in which βa is equivalent to a for and . This paper proposes an algorithm for computing a multiplication in the residue group. Its cost is asymptotically 12 multiplications in as m → ∞, which reaches beyond the lower bound the algorithm of Gorla et al. reaches. The proposed algorithm is especially effective when multiplication in the finite field is implemented using a basic method such as shift-and-add. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Sasaki, Y., Nishina, S., Shirase, M., & Takagi, T. (2009). An efficient residue group multiplication for the η T pairing over. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5867 LNCS, pp. 364–375). https://doi.org/10.1007/978-3-642-05445-7_23
Mendeley helps you to discover research relevant for your work.