Slashdot Mirror
RSA-640 Factored
gslin writes to tell us MathWorld News is reporting that RSA-640 has been factored. F. Bahr, M. Boehm, J. Franke, and T. Kleinjung, memebers of the German Federal Agency for Information Technology Security (BSI) announced they had cracked the 193-digit number last Friday using the General Number Field Sieve. The team purportedly used 80 opteron CPUs and 5 months to achieve victory.
640=2*2*2*2*2*2*2*5.
What do I win?
I wish had nothing better to do for five moths than factor numbers...geez...who needs the Internet when there are numbers to factor. :)
The answer was 42!
Now what was the question
The German Federal Government is short on cash, I know, but resorting to funding the "Agency for Information Technology Security" by winning RSA contests? Besides, if they're so up on IT security, why didn't they just cheat by logging onto RSA's computers?
It's a small world and it smells funny; I'd buy another if it wasn't for the money; Take back what I paid (SoM)
My TI-82 was just about to solve that one!
Well, he certainly failed miserably at using less than 640k.
I knew that one of the factors ended in a 1 and the other ended in a 9 or that they both ended in 3. Am I eligible to split the prize?
should be enough for anyone."
Oh wait. No, that wouldn't have worked. Nevermind.
I wonder how long it would have taken 1.5 million zombie PCs.
To a politician, one email equals one voter.
Why don't we just start using 1.44mb encryption keys. We'd finally have a use for all of these floppies.
I think he was joking.. I hope he was joking
p.s. all your xbox is belong to us.
And in only 5 months... how P Q ular.
...now if he could just find his keys.
Stop invalid scientific research. Ask your local scientists to feed their lab rats with a phytoestrogen-free chow.
factor:2 72754572016194882320644051808150455634682967172328 67824379162728380334154710731085019195485290073377 24822783525742386454014691736602477652346609' is too large
`310741824049004372135075003588856793003734602284
isomerica.net | Foonetic IRC
The cipher in The Sum Of All Fears was actually One-Time Pad.
;)
And yes, I am a Tom Clancy fanboy
I don't know who this general Steve is, but he must be one heck of a math whiz!
Bill Gates wrote something similar in The Road Ahead:
The obvious mathematical breakthrough would be development of an easy way to factor large prime numbers.
Sorry to break it to you boys but I know an algorithm that can do that in constant time: the factors of any prime number are 1 and the number itself.
For any base b, the sum of the digits (in base b) of a multiple of (b-1) add to a multiple of (b-1). The proof is fairly simple: http://www.pseudorandom.co.uk/2002/maths/divby9/.
For instance, in base 16, 3 * F (45 dec) is 2D, and 2+D=F.
This leads to a (slow) algorithm for primality check. For a given number r, simply (hah!) check all the bases up to about log_b(r) to see if all your base r belong to us.
Raise your children as if you were teaching them to raise your grandchildren, because you are.
I have an even better one. If you convert the number to binary, you'll observe it ends in 1. The only way to get that from two numbers is if they both end in 1. So here's your first digit with 100% certainty!
Please correct me if I got my facts wrong.
You ARE using a one-time pad. It's just that the method of getting the pad to the other person is quantum in nature, making it completely secure. And as we all know, one-time pads are unbreakable if they are random and the key is not intercepted and the government doesn't use TEMPEST to read our screens and our computers don't have keyloggers and nobody has a secret camera hidden in the building and we mask our keystrokes so that computer that MIT made can't tell what we're typing just from the sounds and we wipe our hard drives afterwards and then set them on fire and melt them and put them into the fusion reactor that is being built and ...
Note to mods: I'm probably being sarcastic.