An Analysis of the Ajtai–Kumar–Sivakumar (AKS) Sieving Algorithm
A walkthrough of the first algorithm to solve the exact Shortest Vector Problem in 2O(n) time, and the lattice problems it builds on: SVP, CVP, LLL and Babai's approximation. Not original research. I wrote it to understand what cryptography leans on once Shor's algorithm breaks RSA.
Written and presented in Advanced Cryptography (CSCI 762) at RIT, Spring 2020 · taught by Prof. Stanisław Radziszowski