in reply to The Exponentiation of (not-so) Large Primes
To quote http://world.std.com/~franl/crypto/rsa-guts.html
Adam Back (aba@dcs.exeter.ac.uk) has created an implementation of RSA in just 2 lines of Perl. It uses <KBD>dc</KBD>, an arbritrary precision arithmetic package that ships with most UNIX systems. Here's the Perl code:
print pack"C*",split/\D+/,`echo "16iII*o\U@{$/=$z;[(pop,pop,unpack"H*" +,<> )]}\EsMsKsN0[lN*1lK[d2%Sa2/d0<X+d*lMLa^*lN%0]dsXx++lMlN/dsM0<J]dsJxp"| +dc`
--hsm
"Never try to teach a pig to sing...it wastes your time and it annoys the pig."
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: The Exponentiation of (not-so) Large Primes
by titivillus (Scribe) on Jun 29, 2006 at 04:55 UTC | |
by hsmyers (Canon) on Jun 29, 2006 at 15:25 UTC |