Cryptology ePrint Archive: Report 2006/005

Pairing Calculation on Supersingular Genus 2 Curves

Colm O hEigeartaigh and Michael Scott

Abstract: In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 curves over prime fields. We find that pairing calculation on supersingular genus~2 curves over prime fields is efficient and a viable candidate for practical implementation. We also show how to eliminate divisions in an efficient manner when computing the Tate pairing, and how this algorithm is useful for curves of genus greater than one.

Category / Keywords: implementation / Tate pairing, hyperelliptic curves, pairing computation

Date: received 4 Jan 2006, last revised 24 May 2006

Contact author: coheigeartaigh at computing dcu ie

Available format(s): PDF | BibTeX Citation

Note: Some changes in notation, some tables added and a section on theoretical analysis added.

Version: 20060524:175723 (All versions of this report)

Short URL: ia.cr/2006/005

Discussion forum: Show discussion | Start new discussion