Cryptography

Here is a final report on a cryptographic function, which was written as the final project for a course in cryptography. I chose to focus on a lattice based hash function which has been proposed as an efficient hash function which is resistant to attacks on a quantum computer. While the math does not necessarily focus on quantum computers, the function is unique because it is based on a proof of a problem which is hard for a quantum computer. Unfortuntately the specific hash function is based on an easier case of the quantum-hard problem, but it is still an interesting algorithm which is distanced from the standard Diffie-Hellman assumption.