A Dedicated Processor for the eta Pairing

Robert Ronan; Colm O hEigeartaigh; Colin Murphy; Michael Scott; Tim Kerins; W. P.  Marnane

Paper 2005/330

A Dedicated Processor for the eta Pairing

Robert Ronan, Colm O hEigeartaigh, Colin Murphy, Michael Scott, Tim Kerins, and W. P. Marnane

Abstract

The $η$ pairing is an efficient computation technique based on a generalization of the Duursma Lee method for calculating the Tate pairing. The pairing can be computed very efficiently on genus 2 hyperelliptic curves. In this paper it is demonstrated that this pairing operation is well suited to a dedicated parallel hardware implementation. An $η$ pairing processor is described in detail and the architectures required for such a system are discussed. Prototype implementation results are presented over a base field of $F_{2^{103}}$ and the advantages of implementing the pairing on the dedicated processor are discussed.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Keywords: pairing-based cryptosystem pairing genus 2 hyperelliptic characteristic 2 dedicated processor
Contact author(s): robertr @ rennes ucc ie
History: 2005-09-25: received
Short URL: https://ia.cr/2005/330
License: CC BY

BibTeX

@misc{cryptoeprint:2005/330,
      author = {Robert Ronan and Colm O hEigeartaigh and Colin Murphy and Michael Scott and Tim Kerins and W. P.  Marnane},
      title = {A Dedicated Processor for the eta Pairing},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/330},
      year = {2005},
      url = {https://eprint.iacr.org/2005/330}
}