[Resource Topic] 2005/293: Speeding Up Pairing Computation

Welcome to the resource topic for 2005/293

Speeding Up Pairing Computation

Authors: Colm O hEigeartaigh


In this note, we describe how to achieve a simple yet substantial speed
up of Miller’s algorithm, when not using denominator elimination, and working over quadratic extension fields.

ePrint: https://eprint.iacr.org/2005/293

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 .