<?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-22T17:37:10Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/15928" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/15928</identifier><datestamp>2025-03-26T23:32:14Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</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="advisor">Aagaard, Mark</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Gong, Guang</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="d0087d04-8002-4412-93a3-585dfef14489" confidence="600">Zidaric, Nusa</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-05-27T19:38:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-05-27T19:38:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020-05-27</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2020-05-11</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/15928</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Today, emerging technologies are reaching astronomical proportions. For example, the Internet&#xd;
of Things has numerous applications and consists of countless different devices using different&#xd;
technologies with different capabilities. But the one invariant is their connectivity. Consequently,&#xd;
secure communications, and cryptographic hardware as a means of providing them, are faced&#xd;
with new challenges. Cryptographic algorithms intended for hardware implementations must be&#xd;
designed with a good trade-off between implementation efficiency and sufficient cryptographic&#xd;
strength. Finite fields are widely used in cryptography. Examples of algorithm design choices&#xd;
related to finite field arithmetic are the field size, which arithmetic operations to use, how to &#xd;
represent the field elements, etc. As there are many parameters to be considered and analyzed, an&#xd;
automation framework is needed.&#xd;
This thesis proposes a framework for automated design, implementation and verification of finite&#xd;
field arithmetic hardware. The underlying motif throughout this work is “math meets hardware”.&#xd;
The automation framework is designed to bring the awareness of underlying mathematical &#xd;
structures to the hardware design flow. It is implemented in GAP, an open source computer algebra&#xd;
system that can work with finite fields and has symbolic computation capabilities. The framework&#xd;
is roughly divided into two phases, the architectural decisions and the automated design genera-&#xd;
tion. The architectural decisions phase supports parameter search and produces a list of candidates.&#xd;
The automated design generation phase is invoked for each candidate, and the generated VHDL&#xd;
files are passed on to conventional synthesis tools. The candidates and their implementation results&#xd;
form the design space, and the framework allows rapid design space exploration in a systematic&#xd;
way. In this thesis, design space exploration is focused on finite field arithmetic.&#xd;
Three distinctive features of the proposed framework are the structure of finite fields, tower field&#xd;
support, and on the fly submodule generation. Each finite field used in the design is represented as&#xd;
both a field and its corresponding vector space. It is easy for a designer to switch between fields&#xd;
and vector spaces, but strict distinction of the two is necessary for hierarchical designs. When an&#xd;
expression is defined over an extension field, the top-level module contains element signals and&#xd;
submodules for arithmetic operations on those signals. The submodules are generated with &#xd;
corresponding vector signals and the arithmetic operations are now performed on the coordinates. &#xd;
For tower fields, the submodules are generated for the subfield operations, and the design is generated&#xd;
in a top-down fashion. The binding of expressions to the appropriate finite fields or vector spaces&#xd;
and a set of customized methods allow the on the fly generation of expressions for implementation&#xd;
of arithmetic operations, and hence submodule generation.&#xd;
In the light of NIST Lightweight Cryptography Project (LWC), this work focuses mainly on small&#xd;
finite fields. The thesis illustrates the impact of hardware implementation results during the design&#xd;
process of WAGE, a Round 2 candidate in the NIST LWC standardization competition. WAGE&#xd;
is a hardware oriented authenticated encryption scheme. The parameter selection for WAGE was&#xd;
aimed at balancing the security and hardware implementation area, using hardware implementation&#xd;
results for many design decisions, for example field size, representation of field elements, etc. &#xd;
In the proposed framework, the components of WAGE are used as an example to illustrate different&#xd;
automation flows and demonstrate the design space exploration on a real-world algorithm.</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" qualifier="lcsh" lang="en">Cryptography</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Aagaard, Mark</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Gong, Guang</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Engineering</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</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>