You are looking at a specific version 20050907:095316 of this paper.
See the latest version.
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)
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Tate PairingPairing-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