UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Combinatorial aspects of braids with applications to cryptography

Thumbnail Image

Files

Bennett_Max.pdf (827 KB)

Date

2015-08-25

Authors

Bennett, Max

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This thesis is a collection of different results on braids, and draws connections between them. We first introduce braids by showcasing a number of equivalent ways of describing what a braid is, and how those representations are related. Then, while uncovering enumerative properties of the positive braid monoid, we consider algorithms to compute the lcm of a set of braids. This leads to more than one elegant solution to the word problem. We explore some efficient algorithms which solve the word problem for braids, and then also explore the conjugacy problem and the cryptosystems that rely on the hardness of it in their proofs of security.

Description

Keywords

braids, enumeration, word problem, cryptography

LC Keywords

Citation

URI

http://hdl.handle.net/10012/9583

Collections

Theses
Combinatorics and Optimization