Browsing Theses by Title
Now showing items 10305-10324 of 15597
-
On Error Detection and Recovery in Elliptic Curve Cryptosystems
(University of Waterloo, 2011-08-16)Fault analysis attacks represent a serious threat to a wide range of cryptosystems including those based on elliptic curves. With the variety and demonstrated practicality of these attacks, it is essential for cryptographic ... -
On Excluded Minors for Even Cut Matroids
(University of Waterloo, 2007-01-22)In this thesis we will present two main theorems that can be used to study minor minimal non even cut matroids. Given any signed graph we can associate an even cut matroid. However, given an even cut matroid, there are ... -
On Experimental Deterministic Quantum Computation with One Quantum Bit (DQC1)
(University of Waterloo, 2012-03-27)Quantum information processors have the ability to drastically change our world. By manipulating bits of information ruled by the laws of quantum mechanics, computational devices can perform some computations that are ... -
On Experimental Quantum Communication and Cryptography
(University of Waterloo, 2012-03-29)One of the most fascinating recent developments in research has been how different disciplines have become more and more interconnected. So much so that fields as disparate as information theory and fundamental physics ... -
On Fault-based Attacks and Countermeasures for Elliptic Curve Cryptosystems
(University of Waterloo, 2008-05-23)For some applications, elliptic curve cryptography (ECC) is an attractive choice because it achieves the same level of security with a much smaller key size in comparison with other schemes such as those that are based on ... -
On Finding Large Cliques when the Chromatic Number is close to the Maximum Degree
(University of Waterloo, 2021-12-23)We prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of size ∆(G) − 17. Our proof closely parallels a proof from Cranston and Rabern, who showed that graphs with χ = ∆ and ∆ ≥ ... -
On Fine-Grained Access Control for XML
(University of Waterloo, 2003)Fine-grained access control for XML is about controlling access to XML documents at the granularity of individual elements or attributes. This thesis addresses two problems related to XML access controls. The first is ... -
On First Passage Time Related Problems for Some Insurance Risk Processes
(University of Waterloo, 2022-05-13)For many decades, the study of ruin theory has long been one of the central topics of interest in insurance risk management. Research in this area has largely focused on analyzing the insurer’s solvency risk, which is ... -
On Free Space Quantum Key Distribution and its Implementation with a Polarization-Entangled Parametric Down Conversion Source
(University of Waterloo, 2007-05-16)This thesis describes the deployment of a free-space quantum key distribution system across the University of Waterloo campus. The quantum key distribution system has the ability to provide unconditionally secure ... -
On Functional Data Analysis: Methodologies and Applications
(University of Waterloo, 2020-05-04)In economic analyses, the variables of interest are often functions defined on continua such as time or space, though we may only have access to discrete observations -- such type of variables are said to be ``functional'' ... -
On Geometric Drawings of Graphs
(University of Waterloo, 2018-04-18)This thesis is about geometric drawings of graphs and their topological generalizations. First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing is one in which every edge can be extended ... -
On Geometric Range Searching, Approximate Counting and Depth Problems
(University of Waterloo, 2008-09-24)In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in this area are halfspace range searching, simplex range searching ... -
On Holographic Non-Local Operators and Multiple M2-Branes Theories
(University of Waterloo, 2009-06-12)Gauge-string duality has provided a powerful framework for the study of strongly coupled gauge theories and non-perturbative string models. This thesis analyzes the holographic description of non-local ... -
On Hopf Ore Extensions and Zariski Cancellation Problems
(University of Waterloo, 2020-04-29)In this thesis, we investigate Ore extensions of Hopf algebras and the Zariski Cancellation problem for noncommutative rings. In particular, we improve upon the existing conditions for when $T=R[x; \sigma, \delta]$ is a ... -
On imprecision in statistical theory
(University of Waterloo, 2022-01-06)This thesis provides an exploration of the interplay between imprecise probability and statistics. Mathematically, one may summarise this relationship as how (Bayesian) sensitivity analysis involving a set of (prior) models ... -
On Improving Distributed Pregel-like Graph Processing Systems
(University of Waterloo, 2015-07-24)The considerable interest in distributed systems that can execute algorithms to process large graphs has led to the creation of many graph processing systems. However, existing systems suffer from two major issues: (1) ... -
On Infinitesimal Inverse Spectral Geometry
(University of Waterloo, 2011-09-27)Spectral geometry is the field of mathematics which concerns relationships between geometric structures of manifolds and the spectra of canonical differential operators. Inverse Spectral Geometry in particular concerns ... -
On Integrating Failure Localization with Survivable Design
(University of Waterloo, 2013-05-22)In this thesis, I proposed a novel framework of all-optical failure restoration which jointly determines network monitoring plane and spare capacity allocation in the presence of either static or dynamic traffic. The ... -
On Landmarks for Introducing 3D SLAM Structure to VPR
(University of Waterloo, 2024-04-29)Simultaneous Localization and Mapping (SLAM) is a critical foundation to a wide variety of robotic applications. Visual SLAM systems rely on Visual Place Recognition (VPR) for map maintenance and loop-closing so their ... -
On Large Polynomial Multiplication in Certain Rings
(University of Waterloo, 2018-04-11)Multiplication of polynomials with large integer coefficients and very high degree is used in cryptography. Residue number system (RNS) helps distribute a very large integer over a set of smaller integers, which makes ...