Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01th83m2369| Title: | An Overview of Collision Resistance Against a Quantum Adversary |
| Authors: | Kaleoglu, Fatih |
| Advisors: | Zhandry, Mark |
| Department: | Mathematics |
| Certificate Program: | Applications of Computing Program |
| Class Year: | 2020 |
| Abstract: | Quantum computers are threatening to undermine cryptographic schemes that have been classically proven to be secure. In this paper, we give an overview of the historical development of collision and multi-collision finding quantum algorithms, analyzing their query and space complexity in the Random Oracle Model. |
| URI: | http://arks.princeton.edu/ark:/88435/dsp01th83m2369 |
| Type of Material: | Princeton University Senior Theses |
| Language: | en |
| Appears in Collections: | Mathematics, 1934-2020 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| KALEOGLU-FATIH-THESIS.pdf | 208.72 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.