Anyone can help me a bit with RSA ?

i need to know how to build a phi(x) function,
and if possible, how to work with BIG numbers...

(big is 1024bit :))


Posted on 2002-04-21 09:00:13 by ParaBytes

well, for rsa, if n=p*q, p and q primes, then phi(n)=(p-1)(q-1) =)
Posted on 2002-04-21 10:14:22 by roy
roy has some more help for you at his website. :)
Posted on 2002-04-21 10:16:24 by bitRAKE
Anything you like at:

Posted on 2002-05-05 17:12:01 by sch.jnn
Please see the Binary Big Number Thread. There is some code for the basics (add, subtract, divide, multiply, inc, dec, mod, shifts).

Posted on 2002-05-06 16:51:25 by sch.jnn