Since I found out that RSA-640 was solved, I’ve been thinking about altering my script for RSA-704. I made a number of changes:

  • Focusing on generating binary numbers with exactly half the digits of RSA-704. Both RSA-640 and RSA-576’s factors had that property.
  • Used join() to concatenate the binary number string elements instead of +=’s.
  • Used Python’s native base-10 conversion instead of baseconvert.
  • Decided to calculate the primes below 2000 and check these against the generated number, since that might save compute cycles versus trying every number against RSA-704. It seems like it makes things go faster.
  • Improved the output.

Here it is: download text version