Guest,

So you say, that you´ve used factorization algorithm to express large integer into small values. That´s great. I´ve tried with ECM algorithm (online implementation) and the results was generated in less than 0.3 second. That´s very good!

I´m pretty sure that your software is simply integer factorization calculator. Could I request you for Windows EXE GUI implementation if you have any? CMD implementations are alwasy welcome. Or at least screenshot of it.

My prior number has only 160 digits. But what about if I will have very large (800 digits) "randomly" generated numbers? I am afraid that numbers of that size cannot be factored so fast.

Further, in order to minimize the probability of the number to be non-prime, I have two ideas:

1.Extract the first 100 digits as usual. If the number can be shrinked down normally, it´s OK. If not, add another set of digits (e.g. 50) to your number and test it. Again and again (of course, limit would be set by myself) until the number can be shrinked down to the smallest possible size.

2.Add separator after every n-th digit e.g. 451245 325784 014852 475412 and so on. Insert the best computed value at the blank space e.g. 451245932578460148524475412 and factorize that number - hopefully you´ll end up with integer that can be factored (and therefore expressed) so fast.

Any other ideas?

P.S. I am currenty factoring WannaDecrypt0r ransomware RSA 2048-bit master public key using ECM online implementation.