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.
 

Collision Finding with Many Classical or Quantum Processors

Thumbnail Image

Files

Jeffery_Stacey.pdf (950.31 KB)

Date

2011-08-31T15:18:37Z

Authors

Jeffery, Stacey

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

In this thesis, we investigate the cost of finding collisions in a black-box function, a problem that is of fundamental importance in cryptanalysis. Inspired by the excellent performance of the heuristic rho method of collision finding, we define several new models of complexity that take into account the cost of moving information across a large space, and lay the groundwork for studying the performance of classical and quantum algorithms in these models.

Description

Keywords

LC Keywords

Citation

URI

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

Collections

Theses
Combinatorics and Optimization