RSA encryption algorithm - a poem

Take two large prime numbers, q and p.

Find the product n, and the totient φ.

If e and φ have GCD one

and d is e’s inverse, then you’re done!

For sending m raised to the e

reduced mod n gives secre-c.

by Daniel G. Treat of the National Security Agency