<?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-22T23:43:50Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1154" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1154</identifier><datestamp>2017-03-21T19:58:55Z</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" lang="en" authority="bf96f07d-30f7-46e3-a148-dc2bc85140e4" confidence="600">Alexander, Nicholas Charles</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:24:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:24:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1154</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Communicating bits over a network is expensive.    Therefore, cryptosystems that transmit as little data as possible are valuable.    This thesis studies several cryptosystems that require significantly less bandwidth than conventional analogues.    The systems we study, called torus-based cryptosystems, were analyzed by Karl Rubin and Alice Silverberg in 2003 [RS03].    They interpreted the XTR [LV00] and LUC [SL93] cryptosystems in terms of quotients of algebraic tori and birational parameterizations, and they also presented CEILIDH, a new torus-based cryptosystem.    This thesis introduces the geometry of algebraic tori, uses it to explain the XTR, LUC, and CEILIDH cryptosystems, and presents torus-based extensions of van Dijk, Woodruff, et al.   [vDW04, vDGP&amp;lt;sup&amp;gt;+&amp;lt;/sup&amp;gt;05] that require even less bandwidth.    In addition, a new algorithm of Granger and Vercauteren [GV05] that attacks the security of torus-based cryptosystems is presented.    Finally, we list some open research problems.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1691444 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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="rights" lang="en">Copyright: 2005, 
  Alexander, Nicholas Charles. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cryptography</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">compression</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">finite field</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">extension field</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">discrete logarithm problem</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">tori</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">torus</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">algebraic</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Rubin</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Silverberg</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Granger</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Vercauteren</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">XTR</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">LUC</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">CEILIDH</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Algebraic Tori in Cryptography</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>