sorry for not have seen the other topic before...

No argument there
I was just explaining him that distributed computing probably wouldn't help enough for the factorization to become practical, with the current algorithms

Actually, rainbow crack //I don't know how much you know about it, but isn't for RSA keys, my suggestion was something like it, not it, maybe I should say it more explicit...
And I said it because I like to divide in tables for giving each one a part to do, as I like also the style of these tables.
But, it can't be used as it is for factoring a RSA key.

=/

With current algorithms, it would require so much Time and computational power that it wouldn't be feasible.  That is why I like recursive algorithms that run in log n time. ;-)

Are you sure that isn't any recursive algorithm?
That's sad after so many time none came yet.

but, sometimes when using some recursive functions in c I see that computer many times will do much more quickly than a n function, but, it will crash before the end.

//I tried this, exactly with a friend to see which program in c was faster, both used pointers, but mine had a little more of it and was recursive.
mine was pretty quickly at start and then crashed at some number. while his took sometime to achieve that number, but
after it done it continued to next numbers. 

I thought the rainbow crack was for windows passwords...

It was made for crack MD5, then they started to include other keys like LM, NTLM, SHA1, MYSQLSHA1, HALFLMCHALL, NTLMCHALL, ORACLE-SYSTEM, MD5-HALF

but, nothing for RSA yet.
And it run in both linux and Ruindows <- (inside joke) just can speak portuguese will understand...

Lol never heard the Ruindows thing before, but in English it almost fits the OS perfectly . People usually just say Winblows, Window$ and French people say Windaube.

Ruim in portuguese: bad/poor,
but now, I thought about it and you are right. I think it does fit better in english than in portuguese..

true. but there a lot less linux users too.  So, hasvanyone thought about rsa much?

5.9?  And what do you mean we shouldn't go that far?

Also, no idea is a bad idea really.  It's just that some will work with small scale numbers while some don't.

Lol never heard the Ruindows thing before, but in English it almost fits the OS perfectly . People usually just say Winblows, Window$ and French people say Windaube.

We usually say Windhoos (=cyclone) or something. There's also this: (Rutt'n ahtenehenteh in West-Vlaams. Hilarious.)
(Note: this is not how ALL Flemish people talk)

On a more on-topic note: Rainbowcrack was not made for our purpose, because we're talking about a key that is far longer than the average password, and storing the tables for reuse is pointless in this setting (that's the No. 1 reason why you would use RC).

I'm sure you will agree with us after having read: en.wikipedia.org/wiki/RSA . This algorithm is invulnerable. Cryptanalysts have done all they could. Thinking that a bunch of youngsters with calcs can break a 1024-bit key, let alone find a flaw in the algorithm, is VERY utopic.

Would help, if we had all the factorials stored in a file?

I am saying this because I saw, this and found it pretty amazing.

I think there may be a simple method we have overlooked.  This isn't neccissarily the best resource, but this is a list of the top 500 known prime numbers.  Perhaps we can multiply them to each other until we find n?  I know it's brute force, but hey, it could work.