Date of Completion
Spring 5-3-2019
Thesis Advisor(s)
Benjamin Fuller
Honors Major
Computer Science and Engineering
Abstract
The computers that exist throughout the world today, rely on two values, 0 and 1 to work and run. Quantum computers, on the other hand, uses qubits which are quantum objects that can be in either a 0 or 1 state, or even a superposition of 0 and 1 state. Quantum computers do not necessarily make traditional computer algorithms run faster, but rather lets us come up with new algorithms specifically for quantum computers that will be faster than traditional computers. Quantum computer algorithms are designed to make full use of superpositional states. These quantum computers will be able to break commonly used public key cryptosystems such as RSA, DSA, and other practical ones as well. Some physicists predict that quantum computers will become powerful enough in the next 10 years to break these existing public key cryptosystems. As a result, a new field of research in post quantum cryptography is on the rise. One of the most well known and researched post-quantum cryptography schemes are ones that revolved around lattices.
Recommended Citation
Guo, Andy, "Lattices in Cryptography" (2019). Honors Scholar Theses. 612.
https://digitalcommons.lib.uconn.edu/srhonors_theses/612