Collision Finding with Many Classical or Quantum Processors
| dc.contributor.author | Jeffery, Stacey | |
| dc.date.accessioned | 2011-08-31T15:18:37Z | |
| dc.date.available | 2011-08-31T15:18:37Z | |
| dc.date.issued | 2011-08-31T15:18:37Z | |
| dc.date.submitted | 2011 | |
| 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. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/6200 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject.program | Combinatorics and Optimization | en |
| dc.title | Collision Finding with Many Classical or Quantum Processors | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |