#### Challenge "Unusual encryption using a diophantine equation" ¶

By: admin on Sept. 2, 2011, 12:58 p.m.

In order to calculate the private keys of the RSA algorithm, it is necessary to factorize large numbers. How difficult is it if we replace x*y by some diophantine equation?

Read more...