So you're curious about the RSA algorithm, you like Internet technologies and mathematics? This is a short article on how the RSA Algorithm works, with practical examples. Preface and Disclaimer Obviously the article itself and the code here presented are suitable for a learning activity only and in case you use them, you do it at your own responsibility. I based this on the 1977's article from Rivest, Shamir and Adleman , (from which initial letters the algorithm takes the name), and ran the code on a Mac with python 2.6.1. The code presented here is also not optimized. The reader is invited to suggest better implementations (in languages other than python as well). Mathematics concepts you need to know - What a 'prime number' is. (A integer number which can be divided evenly only by 1 and itself. e.g. 1, 2, 3, 5, 7, 11, ..., 47, ...) - What the 'modulus' (here referred as 'mod') operation is. ('A mod B' is the reminder of A divided...