Speeding Up Pairing Computation

Colm O hEigeartaigh

Paper 2005/293

Speeding Up Pairing Computation

Colm O hEigeartaigh

Abstract

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.

Note: Some mistakes have been fixed, and a lemma added.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Keywords: Tate Pairing Pairing-based cryptosystems
Contact author(s): coheigeartaigh @ computing dcu ie
History: 2005-09-07: revised; 2005-09-01: received; See all versions
Short URL: https://ia.cr/2005/293
License: CC BY

BibTeX

@misc{cryptoeprint:2005/293,
      author = {Colm O hEigeartaigh},
      title = {Speeding Up Pairing Computation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/293},
      year = {2005},
      url = {https://eprint.iacr.org/2005/293}
}