Comment Re:SHA-SHA-SHA-KE YOUR BOOTY !! (Score 1) 194
It's a collision, not preimage, attack. The attack was later improved to 2^63, which is certainly doable.
Meg Whitman Campaign Shows How Not To Use Twitter 147
tsamsoniw writes "California gubernatorial candidate Meg Whitman's campaign team attempted to share with her Twitter followers an endorsement from a police association. Unfortunately, the campaign press secretary entered an incorrect or incomplete Bit.ly URL in the Tweet, which took clickers to a YouTube video featuring a bespectacled, long-haired Japanese man in a tutu and leggings rocking out on a bass guitar. And for whatever reason, the Tweet, which went out on the 18th, has remained active through today."
7 Scientific Reasons a Zombie Outbreak Would Fail 320
Whether they spoil in the heat, freeze in the winter, or get taken out by a human-friendly venue of vultures, a zombie outbreak is unlikely to succeed. Here's 7 reasons why we should stop worrying about the shambling dead and start concentrating on a real threat: sparkly vampires.
Comment Re:New algorithms? (Score 1) 192
Due to the possibility of finding more efficient algorithms? Wouldn't that rule out RSA-any size?
1024 bit RSA keys are considered mildly secure because they are breakable with a large budget.
Comment Re:Interesting and a qustion (Score 5, Informative) 133
There are a few algorithms resistant against quantum computers, based on alternative problems. A good reference of the main, usable ones, is at http://pqcrypto.org/.
Quantum computers can also speed up exhaustive searches (see Grover's algorithm) and collision searches, but this is easily mitigated by increasing symmetric key sizes to e.g. 256 bits up from 128.
