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...

Just small correction to the text in PDF.
It was meant:

"Assuming x and y are of approximately the same size in both cases.
What is more difficult to solve?"

instead of

"Assuming n is of approximately the same size in both cases.
What is more difficult to solve?"

This has no effect on solving the challenge.

P.S.: The recommendation was to publish it as Level II, but they decided to publish it as Level III so take the opportunity to earn some "easy" extra points now ;-)

First this challenge was wrongly published in the level 3 section, but now it was corrected to be a level 2 challenge.

Sorry for all of you who spotted some easy points. All points were adjusted.

yeah, good idea. even if i was happy to get 13.333 Points for this :)