Back to search

University of Waterloo

Collision Finding with Many Classical or Quantum Processors

Abstract

dc:description.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.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Jeffery, Stacey

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/6200

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Jeffery, Stacey. Collision Finding with Many Classical or Quantum Processors. University of Waterloo, 2011. http://hdl.handle.net/10012/6200