I wanted to prove that the numbers for @_nix 's Cloud RSA Project were way too small and they are. Click on the dinosaur to start hacking. If you like, you can use the RSA keys in the top left corner. The original project: https://scratch.mit.edu/projects/277367705 --------------------How it works:--------------------------- In this project, the Dinosaur looks for all the combos of P & Q possible by factoring N. There are 27889 combinations of primes in the project, but the dinosaur only needs either P or Q to factor N so it only needs to try √27889 = 167 times maximum... It goes through all of them and cracks it really quickly. All it needs to do then is to do the rest of the RSA math and reveal the Private key...
