Date of Degree

6-2017

Document Type

Dissertation

Degree Name

Ph.D.

Program

Mathematics

Advisor(s)

Vladimir Shpilrain

Committee Members

Melvyn Nathanson

Alexey Ovchinnikov

Subject Categories

Mathematics

Abstract

In this thesis we describe how various rewriting methods in combinatorial group theory can be used to diffuse information about group elements, which makes it possible to use these techniques as an important constituent in cryptographic primitives. We also show that, while most group-based cryptographic primitives employ the complexity of search versions of algorithmic problems in group theory, it is also possible to use the complexity of decision problems, in particular the word problem, to claim security of relevant protocols.

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.