Anyone know how to impliment the RSA algorithm (preferably in Perl)? I have the prime numbers, P and Q, and I can mulitply them together. How do I get the multiplicitive inverse?