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.
Thank you so much!! It´s impressive!!
I have many values like that. I´m pretty sure that randomness there will be irrelevant... or not?
Seconding, how can I quickly compute the original value the same way as you´ve performed? Is there any specific formula for that? Could I request you for account on this site? I´d be better to communcate that way I think. If email address is the issue, I can register your account with another address that I´ve created for you. Thanks.
Factorization isn´t bad, but the resulting number is still large. I need something like that:
original number: "5441084843431591615659571291428668923255549962214089160997541170290830516266773395936827128499431593969046448477687463427177903244520307433540723695388709656001"
simplification: "9849*40" i.e. "9849*9849*9849*9849*9849*9849*9849" etc.
It is possible to express all numbers into more compact form? It is ,of course, possible to alter the input string in many ways in order to increase the convergence with resulting number. For example:
original number: 45527652002896328588226575
hardcoded operations (this can vary depending on the input, random values allowed, but the lenght must be preserved): insert 455276 into the beginning of the number. The same at end - insert 226575 in order to increase the possibility of hitting the corresponding simple number (9849*40) and reconstruct my original number from that.
Store 6589x40.54785,208 which means 6589*6589*6589... plus 54785x208
I really don´t want to store these big numbers. I need to find the least amount of divergence in comparing of the original number expressed in the most simplified form. I´m pretty sure that it´s possible even for huge and "random" numbers I have.
Thanks a lot.