Collision Finding with Many Classical or Quantum Processors

Collision Finding with Many Classical or Quantum Processors

Show other versions (1)

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 accou...

Full description

Bibliographic Details
Main Author: Jeffery, Stacey
Language:en
Published: 2011
Subjects:
Combinatorics and Optimization
Online Access:http://hdl.handle.net/10012/6200
id ndltd-WATERLOO-oai-uwspace.uwaterloo.ca-10012-6200
record_format oai_dc
spelling ndltd-WATERLOO-oai-uwspace.uwaterloo.ca-10012-62002013-01-08T18:54:50ZJeffery, Stacey2011-08-31T15:18:37Z2011-08-31T15:18:37Z2011-08-31T15:18:37Z2011http://hdl.handle.net/10012/6200In 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.enCollision Finding with Many Classical or Quantum ProcessorsThesis or DissertationCombinatorics and OptimizationMaster of MathematicsCombinatorics and Optimization
collection NDLTD
language en
sources NDLTD
topic Combinatorics and Optimization
spellingShingle Combinatorics and Optimization
Jeffery, Stacey
Collision Finding with Many Classical or Quantum Processors
description 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.
author Jeffery, Stacey
author_facet Jeffery, Stacey
author_sort Jeffery, Stacey
title Collision Finding with Many Classical or Quantum Processors
title_short Collision Finding with Many Classical or Quantum Processors
title_full Collision Finding with Many Classical or Quantum Processors
title_fullStr Collision Finding with Many Classical or Quantum Processors
title_full_unstemmed Collision Finding with Many Classical or Quantum Processors
title_sort collision finding with many classical or quantum processors
publishDate 2011
url http://hdl.handle.net/10012/6200
work_keys_str_mv AT jefferystacey collisionfindingwithmanyclassicalorquantumprocessors
_version_ 1716573846449946624

Similar Items