Crack the Code and Win a Million Bucks
JS_RIDDLER noted a Toronto Star article about a sort of contest to
crack some encryption and win a million bucks. The article is a bit fluffy, but it getst the point across... we wasted all those RC5 keys ;)
... they should have left an option open for people finding holes in the ACTUAL implementation... Now only mathematicians stand a chance - go, go, go, you few good number theoretisists not employed by the NSA! =-= insert favorite conspiricy theory here =-=
They are using keys that sound big 168 bits, 256 bits, etc. But those aren't really that big, only 21 bytes and 32 bytes respectively. These sentences are longer than those keys.
Then I note that UNIX limits passwords to 8 bytes. A measly 64 bits.
I don't think I can sleep well knowing that all that stands between my data and some hacker is such a small string.
I have been pwned because my
...is that it uses much smaller keys with the same level of encryption. This makes it useful for handhelds and phones, and network devices. If you've never heard of this before, chances are you're already using it, too, as this is prevalent already in many of the aforementioned devices.
libertarianswag.com
Anyone with the capability to solve the math required to break the encryption might do a lot better than one million dollars.
If they were malicious, all they'd have to do was wait a year or so until the encryption was incorporated into mission-critical applications and then use their knowledge to gain access to those applications. Something tells me that THAT would be worth a lot more than the cool million they are currently offering.
Agree or disagree, I usually at least understand Slashdot editorial comments. But I don't get "we wasted all those RC5 keys". You mean we cracked them when they could have been used? I hope not. You mean we cracked them without the promise of 1 meelion dollar bills? Ok, greedy, but I'm with you.
Seriously, how do you waste a key?
-madgeorge
Quite an accomplishment, considering the NSA wasn't founded until 1952.
I think the company who came up (or rather markets) ECC [eliptic curce cryptography] should be careful about saying that ECC is more secure than RSA. RSA has stood up to A LOT of cryptanalysis, simply because of it's age. ECC might have bad keys or something else we don't know about simply because we have not have time to try all attacks yet. Who knows, tomorrow someone may find a trivial algorithm for taking the discrete logarithm on an EC (rendering ECC useless). Then again, someone may find a way of doing a simple discrete logarithm (rendering RSA useless). Both are highly unlikely, but hey -- stranger things have happened.
Basically, take a company's claim with a grain of salt. Right now I'll keep my data encrypted with something more tested (3DES anyone?).
My other car is first.
and we'd most certainly be happy to consider them for a lifetime position
;-)
What position are the lawyers thinking about after the break the encryption?
This SIG pulled due to lack of funding. (This damn war is costing too much!)
There's a general uneasiness in much of the cryptographic community regarding ECC that comes from the thought that with a new and elegant cryptographic algorithm or methodology there is often a new and elegant attack that renders it worthless in practical applications. As I'm sure you realize (but others may not) the ability of a methodology to withstand conventional attacks is no indicator of long-term viability; algorithms may only be proven unsafe, not safe (except perhaps for one-time pads under certain circumstances).
I happen to hold out hope for this technique, but it takes time in the field for confidence to be built. This contest may help, but by no means is it absolute proof of the security of the technique (although one would be hard pressed to make a million dollars hoarding a working attack on ECC to themselves).
Try not. Do or do not, there is no try.
-- Dr. Spock, stardate 2822-3.
Anyone (outside patent encumbered countries) working on a Free implementation? It should be okay in the EU, for "allowing interoperability with existing products".
"'I pass the test,' she said. 'I will diminish, and go into the West, and remain Galadriel.'"
- JRR Tolkien.
...to crack it, but as of how long it will take them. Information that is worth a lot today may be worthless tomorrow, and by next week it'll be history. So the question isn't about making a perfect encoding (we allready have one, namely 'one time pads'), but finding the best encoding for the application. Also bear in mind the rule of thumb that states that the thoughter the code, the more difficult (think CPU-cycles and batterydrain) it is to encode it in the first place. Off course, just how strong thats strong enought will change as the tools for encryption, decryption and codebreeaking gets stronger.
Remember folks, an encrypted message don't have to be unbreakable, it just has to be hard enought to break. One rule of thumb is that it should cost more to break than the one breaking it will earn on doing so.
Besides, one can learn a lot about whats going on even if you can break the code. Where does the signal originates? Where is it heading. Does it occour on a frequent basis? What is the matter of transmitting? The more you learn about the message, the more you learn about the reason it's beeing sendt - even if you don't know what it says. THEN you can often start using social enginering to gain access to the key, or better yet, to the unencrypted message.
Everything in the world is controlled by a small, evil group to which, unfortunately, no one you know belongs.
I went over to their website and parused around... Seems they did the security to XM Radio, http://www.certicom.com/download/aid-78/success_XM Radio.pdf) which humors me because XM Radio was hacked about 2 months after it went live.. All you need is a part from an old Dish Network reciever and a soldier iron.
There are exceptions, but they are few and far between. The RSA challenges, both their factoring challenges and their symmetric brute-force challenges, are fair and good contests. These contests are successful not because the prize money is an incentive to factor numbers or build brute-force cracking machines, but because researchers are already interested in factoring and brute-force cracking. The contests simply provide a spotlight for what was already an interesting endeavor.
In this case, finding clever ways to factor ECCs is actually a number-theoretically interesting thing to do.
It seems that these two two acronyms, which are very different in meaning, are likely to show up in the context of computer-related discussions :
The Russians have won. They have made the world a cesspool of distrust, greed, fear and hate.
No. It's just that you know you're in trouble when people use "age of the universe" as a unit of measurement. It'll break, it's just that it'll take so long that when you (or rather your far distant descendants) crack it, there probably won't be a great deal of point in knowing it.
At that point, it's simpler to use the Caveman attack:
Walk over, beat subject about the cranium with a stout cudgel, and take the subject's computer containing the keys.