Welcome to the resource topic for 2010/123
Title:
Delaying Mismatched Field Multiplications in Pairing Computations
Authors: Craig Costello, Colin Boyd, Juan Manuel Gonzalez Nieto, Kenneth Koon-Ho Wong
Abstract:Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full extension field \mathbb{F}_{p^k} are multiplied by elements contained in proper subfields \mathbb{F}_{p^{k/d}}, and by elements in the base field \mathbb{F}_{p}. We show that significant speedups in pairing computations can be achieved by delaying these ``mismatched’’ multiplications for an optimal number of iterations. Importantly, we show that our technique can be easily integrated into traditional pairing algorithms; implementers can exploit the computational savings herein by applying only minor changes to existing pairing code.
ePrint: https://eprint.iacr.org/2010/123
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .