Search:

That is working. My mistake. Sorry.

nothing wrong when you executed it. but the problem is, its working only for limited numbers.

i think it should work because it is an standard algorithm developed by Rivest, Adelman. Google it.
...

Input- Two prime numbers which is used to first encrypt and then data given:
in above case, 7 and 13 were prime numbers, data was 36
Output- the output shows the encrypted and decrypted...

for example: not working when prime nos are 7 and 13.. and when data is 36.


/* Algorithm:
Choose p = 3 and q = 11
Compute n = p * q = 3 * 11 = 33
Compute f(n) = (p - 1) * (q - 1)...