The phenomenon that the RSA system exploits is the fact that it is relatively easy to determine whether a large integer is prime or not, but very difficult to explicitly factor a very large composite integer. The proposers issued a challenge through a Mathematical Games column in 1977 ([4]), and we shall explain their system with exactly the challenge parameters.