The present paper aims to explain cryptography from the point of view of
functional programming. In order to accomplish this goal, we would use
Haskell to write the code about many cryptosystems. In addition, we would
verify the correctness of those functions by generating some random tests.
We would deal with the following ciphers: Cesar, Affine, Vigènere, Hill, Permutation, DES, RSA, ElGamal and Rabin.Universidad de Sevilla. Grado en Matemática