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 :))

tnx,

ParaBytes

i need to know how to build a phi(x) function,

and if possible, how to work with BIG numbers...

(big is 1024bit :))

tnx,

ParaBytes

hi

well, for rsa, if n=p*q, p and q primes, then phi(n)=(p-1)(q-1) =)

well, for rsa, if n=p*q, p and q primes, then phi(n)=(p-1)(q-1) =)

**roy**has some more help for you at his website. :)

Please see the Binary Big Number Thread. There is some code for the basics (add, subtract, divide, multiply, inc, dec, mod, shifts).

Giovanni

Giovanni