Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp019c67wq76fFull metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Zhandry, Mark | - |
| dc.contributor.author | Kaleoglu, Fatih | - |
| dc.date.accessioned | 2020-07-24T11:42:41Z | - |
| dc.date.available | 2020-07-24T11:42:41Z | - |
| dc.date.created | 2020-05-04 | - |
| dc.date.issued | 2020-07-24 | - |
| dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp019c67wq76f | - |
| dc.description.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. | en_US |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en | en_US |
| dc.title | An Overview of Collision Resistance Against a Quantum Adversary | en_US |
| dc.title | ORIGINAL | - |
| dc.title | An Overview of Collision Resistance Against a Quantum Adversary | en_US |
| dc.type | Princeton University Senior Theses | - |
| pu.date.classyear | 2020 | en_US |
| pu.department | Mathematics | en_US |
| pu.pdf.coverpage | SeniorThesisCoverPage | - |
| pu.contributor.authorid | 961169238 | - |
| pu.certificate | Applications of Computing Program | en_US |
| 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.