Haskell

This is the repository for the 3 haskell assignments we had to make for the Haskell development course.
One of the things that I’m most proud of is that we managed to implement a simple RSA encryption function.
It is implemented using Euclidean Greatest Common Divider to find the private key.
The RSA encryption works best with large numbers, because of the modulo function that is used to encrypt and decrypt.