Due to the development of quantum computers which threaten to break the current security state of the internet, lattice-based cryptosystems are proposed to be an attractive option for post-quantum cryptography. The main underlying problem is the Shortest Vector Problem. To test the security of these proposed solutions, we want to determine how hard the Shortest Vector Problem is in ideal lattices and present the reason why it plays an important role in modern cryptography.