Show simple item record

dc.contributor.authorChou, Kuo Ming Jamesen
dc.date2011-11-07 20:25:34.514
dc.date2011-11-08 18:57:59.988
dc.date.accessioned2011-11-09T15:00:32Z
dc.date.available2011-11-09T15:00:32Z
dc.date.issued2011-11-09
dc.identifier.urihttp://hdl.handle.net/1974/6866
dc.descriptionThesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2011-11-08 18:57:59.988en
dc.description.abstractFor pairing-based cryptographic protocols to be both efficient and secure, the underlying genus 2 curves defined over finite fields used must satisfy pairing-friendly conditions, and have small rho-value, which are not likely to be satisfied with random curves. In this thesis, we study two specific families of genus 2 curves defined over finite fields whose Jacobians do not split over the ground fields into a product of elliptic curves, but geometrically split over an extension of the ground field of prescribed degree n=3, 4, or 6. These curves were also studied extensively recently by Kawazoe and Takahashi in 2008, and by Freeman and Satoh in 2009 in their searches of pairing-friendly curves. We present a new method for constructing and identifying suitable curves in these two families which satisfy the pairing-friendly conditions and have rho-values around 4. The computational results of the rho-values obtained in this thesis are consistent with those found by Freeman and Satoh in 2009. An extension of our new method has led to a cryptographic example of a pairing-friendly curve in one of the two families which has rho-value 2.969, and it is the lowest rho-value ever recorded for curves of this type. Our method is different from the method proposed by Freeman and Satoh, since we can prescribe the minimal degree n =3,4 or 6 extension of the ground fields which the Jacobians of the curves split over.en
dc.language.isoengen
dc.relation.ispartofseriesCanadian thesesen
dc.rightsThis publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner.en
dc.subjectPairing-Friendly Genus 2 Curvesen
dc.subjectAlgebraic Geometryen
dc.subjectCryptographyen
dc.subjectNumber Theoryen
dc.titleConstructing pairing-friendly algebraic curves of genus 2 curves with small rho-valueen
dc.typethesisen
dc.description.degreePhDen
dc.contributor.supervisorKani, Ernsten
dc.contributor.departmentMathematics and Statisticsen
dc.degree.grantorQueen's University at Kingstonen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record