I SOLVED IT!!
VQC Respond to this within 30 minutes or I'm going to POST IT AND REVEAL THE TRUTH!!!!
Well idk how to exactly fit in the public key, could you help me with that?
Basically I can factor a product of 2 primes easily. If given a public key, could you give me the steps I would need to solve it? Like do I factor d? Is that it?
factorRSA(17969491597941066732916128449573246156367561808012600070888918835531726460341490933493372247868650755230855864199929221814436684722874052065257937495694348389263171152522525654410980819170611742509702440718010364831638288518852689)
(1, 17969491597941066732916128449573246156367561808012600070888918835531726460341490933493372247868650755230855864199929221814436684722874052065257937495694348389263171152522525654410980819170611742509702440718010364831638288518852689L, True)
It was taking a while but I made the algorithm better and solved it.
Look through my notes. You can solve it too.
I'm trying to fix a thing where I do repeated addition to change it to a multiplication. The big RSA number was taking like more than 5 minutes so I'm trying to optimize it. Now I can't even factor 145 :(
I don't think I got it its taking too long. It works fast for small numbers but I let my CPU run for like an hour and a half for that bigass RSA number so I'm disheartened. Maybe my way is not the fastest way to do it. VQC said it would solve it practically instantaneously right?
I'll try for this one but I'm testing other stuff now. I'm now starting to think we may need to be able to factor another number and then run it recursively.
Basically you generate a cell from (1,c) then use the D and traverse along the D until you get the same E value as the first one. Fairly simple
I understand. My father said "Don't figure it out and tell everyone, theres only a few chances to really profit in life and this may be one of them" so I would hate to figure it out and not help my fam. Then the problem becomes the fact that I didn't really break it VQC did and guided me through it.
Heres the map for D. I think this is the key to it all.
The D labels for this are all wrong. The correct values are D+1
I disagree, I think that all these negative values are actually important, because they can be used to navigate the grid. Look at this pic:
Most of those values are invalid according to our current understanding of the records (e,n,d,x,a,b), but this pattern is constant for every number, so even if the values are 'invalid' we could still use them to traverse along the graph.
Okay I'm going to try and convince you and I'll sound absolutely insane but I'll make a new thread about it. it will take a while.
>>2011
>>2021
Here is the OP and the post specifically about why I believe we should go into the negative values. I may have gone full blown schizophrenic but I'm convinced this album is a guide.
I believe algorithm can be done with a Turing machine
How does that work?
Sorry to explain I was solving them pretty fast but I couldn't get the big RSA number. Then I modified the code to make it faster and I accidently had a loop condition be satisfied immediately. I got so excited that I copy pasted and posted right away. My method doesn't work for bigass numbers.