This is a personal project were I code the Rabin-Miller primality test in C to generate large prime numbers. The mathematical core of the algorithm is Fermat's little theorem, making the algorithm probabilistic. As of today, this algorithm has applications in cryptography were it is used to generate the two very large prime numbers needed for the RSA cryptosystem, the main asymetric crypto-algorithm used today for sensitive operations like bank transfer orders or online purchases.
Ainsi le petit prince, malgré la bonne volonté de son amour, avait vite douté d’elle. Il avait pris au sérieux des mots sans importance, et était devenu très malheureux.