Gordon Burditt wrote: > >Consider a relation between two integer factorizations: > > > >f_1 f_2 = k + g_1 g_2 > > > >and a solution with four unknowns w, x, y and z, as they are determined > ... > >I call this method the Holy Grail of factoring--a basic template for > >factoring any composite. > > Which of the RSA challenge numbers have you factored with this? > > If that's too complicated, please demonstrate how you would use > this to factor 32111. Or how about 6? > > Gordon L. Burditt
I find it weird that so many of you are lost on what mathematics is that you still hold on as if I have to actually demonstrate for what follows from the mathematics to be true.
I found that you can just use
f_1 f_2 = k + g_1 g_2
and four variables w, x, y and z with four linear equations, to SEE why the method has to work, while to get g_1 and g_2 you use two of the linear equations and the equation defining k as the difference to get a set of possible values for g_1 and g_2.
That theory is easy algebra. Trivial. It is a proof that the factoring problem is actually trivially easy, and a mathematical proof that RSA cannot be secure.
But you want an implementation and a demonstration.
I am sure, someone is working as we speak on giving you one.
Some of you may joke about moving stocks, but you have inside information, because our world is a little complicated and most people don't read sci.crypt, but then again, this is public disclosure so maybe you can move your stocks without breaking the law.
I'm not sure. I'm not moving any. But it's not like I really have any anyway. I long ago sold everything I had on the stock market, and only recently acquired small amounts without choosing to do so.