Author (Your Name)

Raj KaneFollow

Date of Award

2019

Document Type

Honors Thesis (Open Access)

Department

Colby College. Mathematics and Statistics Dept.

Advisor(s)

Nora Youngs

Second Advisor

Leo Livshits

Abstract

We develop an understanding of lattices and their use in cryptography. We examine how reducing lattice bases can yield solutions to the Shortest Vector Problem and the Closest Vector Problem.

Keywords

lattice, cryptography, knapsack, cryptanalysis, basis, LLL

Included in

Algebra Commons

Share

COinS