<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T12:24:33Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/6722" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/6722</identifier><datestamp>2017-03-21T17:59:02Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="0cfa3132-4900-4f5c-ab51-3085bc0910e7" confidence="600">Grewal, Gurleen</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-05-14T19:08:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-05-14T19:08:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2012-05-14T19:08:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2012-04-30</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/6722</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Pairings have found a range of applications in many areas of cryptography. As such, to&#xd;
utilize the enormous potential of pairing-based protocols one needs to efficiently compute&#xd;
pairings across various computing platforms. In this thesis, we give an introduction to&#xd;
pairing-based cryptography and describe the Tate pairing and its variants. We then describe&#xd;
some recent work to realize efficient computation of pairings. We further extend&#xd;
these optimizations and implement the O-Ate pairing on BN-curves on ARM and x86-64&#xd;
platforms. Specifically, we extend the idea of lazy reduction to field inversion, optimize&#xd;
curve arithmetic, and construct efficient tower extensions to optimize field arithmetic. We&#xd;
also analyze the use of affine coordinates for pairing computation leading us to the conclusion&#xd;
that they are a competitive choice for fast pairing computation on ARM processors,&#xd;
especially at high security level. Our resulting implementation is more than three&#xd;
times faster than any previously reported implementation on ARM processors.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">ARM processor</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cryptography</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">pairing-based cryptography</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">pairings</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">pairing computation</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">O-Ate pairing</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Efficient Pairings on Various Platforms</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>