Cryptology ePrint Archive: Report 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.

Category / Keywords: implementation / Tate Pairing, Pairing-based cryptosystems

Date: received 26 Aug 2005, last revised 7 Sep 2005

Contact author: coheigeartaigh at computing dcu ie

Available format(s): PDF | BibTeX Citation

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

Version: 20050907:095316 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]