Slashdot Mirror
RSA-576 Factored
An anonymous reader writes "I thought Slashdot would have picked this up
several days ago, but apparently not. Although
you still won't see any mention of it on the
RSA challenge site, Mathworld is carrying the news that a team at the German Bundesamt fur Sicherheit in der Informationstechnik submitted a factorization of
RSA-576 on December 3. RSA-576 is the smallest challenge number that RSA Security offers a cash prize for, to the tune of $10,000"
I don't know... maybe...
u sib;r jbiq (shifted all the keys to the left.)
Seriously, though, all of these ciphers can be broken. It's just a task of minimizing the value to the cracker by making it take as long as possible to get the data, under the thought that it just won't be worth the time.
#define DRM chmod 000
Well, the computational complexity of the General Number Field Sieve is:
O(exp(c*log(n)^(1/3)*log(log(n))^(2/3)))
where the value of c is reflected by the specific flavor of the NFS you're using, but in each case c>1
I don't know the complexity of RC5, but I can imagine it's not exponential like the NFS.
Sure, all codes (except one time pads and equivalents) can be broken. The difference is whether it takes a day to crack the code or it can be proven that it requires either a centuries-sought breakthrough in mathematics or all the computers in the world working for ten thousand years.
I don't know how you feel about it, but quantitative differences on those scales qualify as qualitative differences to me. Your 2048 bit PGP key simply isn't crackable by any reasonable standard. The reason people succeed at these challenges is because the bar has been set intentionally low.
Algorithm for increasing karma:
1. Read first paragraph of article.
2. Find first occurence of technical term.
3. Look up definition of said technical term on google.
4. Cut and paste definition then post on relevent slashdot forum.
The best part is, you can do all this without actually knowing anything about the topic!
:wq