Skip to content

Walkthroughs for custom maps.

#3643
Auto-translated
Dandy
This is the basics of cryptanalysis and the RSA method. Knowing the product of two numbers makes it virtually impossible for even a supercomputer to calculate the factors by brute force in less than thousands of years.
It's not all that bad. The number field sieve method already has sub-exponential complexity, and it is quite possible that there are algorithms for finding factors in polynomial time.