An adversary armed with a quantum computer has algorithms[66, 33, 34] at their disposal, which are capable of breaking our current methods of encryption. Even with the birth of post-quantum cryptography[52, 62, 61], some of best cryptanalytic algorithms are still quantum [45, 8]. This thesis contains several experiments on the efficacy of lattice reduction algorithms, BKZ and LLL. In particular, the difficulty of solving Learning With Errors is assessed by reducing the problem to an instance of the Unique Shortest Vector Problem. The results are used to predict the behavior these algorithms may have on actual cryptographic schemes with security based on hard lattice problems. Lattice reduction algorithms require several floating-point operations including multiplication. In this thesis, I consider the resource requirements of a quantum circuit designed to simulate floating-point multiplication with high precision. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2020. / FAU Electronic Theses and Dissertations Collection
| Identifer | oai:union.ndltd.org:fau.edu/oai:fau.digital.flvc.org:fau_44442 |
| Contributors | Miller, Shaun (author), Bai, Shi (Thesis advisor), Florida Atlantic University (Degree grantor), Department of Mathematical Sciences, Charles E. Schmidt College of Science |
| Publisher | Florida Atlantic University |
| Source Sets | Florida Atlantic University |
| Language | English |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation, Text |
| Format | 79 p., online resource |
| Rights | Copyright © is held by the author with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder., http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0017 seconds