Browse DORAS
Browse Theses
Search
Latest Additions
Creative Commons License
Except where otherwise noted, content on this site is licensed for use under a:

Constructing suitable ordinary pairing-friendly curves: A case of elliptic curves and genus two hyperelliptic curves

Kachisa, Ezekiel Justin (2011) Constructing suitable ordinary pairing-friendly curves: A case of elliptic curves and genus two hyperelliptic curves. PhD thesis, Dublin City University.

Full text available as:

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
1067Kb

Abstract

One of the challenges in the designing of pairing-based cryptographic protocols is to construct suitable pairing-friendly curves: Curves which would provide ecient implementation without compromising the security of the protocols. These curves have small embedding degree and large prime order subgroup. Random curves are likely to have large embedding degree and hence are not practical for implementation of pairing-based protocols. In this thesis we review some mathematical background on elliptic and hyperelliptic curves in relation to the construction of pairing-friendly hyper-elliptic curves. We also present the notion of pairing-friendly curves. Furthermore, we construct new pairing-friendly elliptic curves and Jacobians of genus two hyperelliptic curves which would facilitate an efficient implementation in pairing-based protocols. We aim for curves that have smaller values than ever before reported for dierent embedding degrees. We also discuss optimisation of computing pairing in Tate pairing and its variants. Here we show how to eciently multiply a point in a subgroup dened on a twist curve by a large cofactor. Our approach uses the theory of addition chains. We also show a new method for implementation of the computation of the hard part of the nal exponentiation in the calculation of the Tate pairing and its variant

Item Type:Thesis (PhD)
Date of Award:November 2011
Refereed:No
Supervisor(s):Scott, Michael
Uncontrolled Keywords:elliptic; hyperelliptic; addition chains; tate pairing
Subjects:Computer Science > Computer security
DCU Faculties and Centres:DCU Faculties and Schools > Faculty of Engineering and Computing > School of Computing
Use License:This item is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 3.0 License. View License
Funders:Science Foundation Ireland
ID Code:16598
Deposited On:02 Dec 2011 11:45 by Michael Scott. Last Modified 02 Dec 2011 11:45

Download statistics

Archive Staff Only: edit this record