The RSA algorithm works as follows: First, I find two huge (at least 100 digits each!) prime numbers p and q, and then I multiply them together to get the even bigger number N.