Hi, I requier some real help with the following question. it would be great if some expert kindly explain to me how to program the following formula. this is the qestion:
this is RSA encryption method used in network security and e-commerce
C = M power e (mod N)
whereas the decyption involves in
M = C power d (mod N)
where N =pq whith p and q primes and ed = 1 (mod ( p-1) (q-1)) now give the information (e,M) = (13816622705919460 ,1905032118092025) and N =32200197944786327
i want to write a program in any language to find the ciphertext C. It would be great if i can get the complet algorithm/program.
i hope some one out there knows how to do this
kind regards
Halgurt :confused: