International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Speeding Up Pairing Computation

Authors:
Colm O hEigeartaigh
Download:
URL: http://eprint.iacr.org/2005/293
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2005-12627,
  title={Speeding Up Pairing Computation},
  booktitle={IACR Eprint archive},
  keywords={implementation / Tate Pairing, Pairing-based cryptosystems},
  url={http://eprint.iacr.org/2005/293},
  note={ coheigeartaigh@computing.dcu.ie 13033 received 26 Aug 2005, last revised 7 Sep 2005},
  author={Colm O hEigeartaigh},
  year=2005
}