|
|
|
THE OLD METHODS are the best has once again been proven true, with a 32-year-old encryption algorithm having been shown to be able to withstand posited quantum cryptography attacks.
In recent years the world of cryptography has been shuddering at the thought that once quantum computers reach even a fraction of their computational capabilities, present encryption techniques will be rendered useless. Not so, say researchers from the University of Connecticut, who claim to have mathematically proven that an encryption algorithm dating from 1978 can withstand all known quantum cryptography attacks.
While quantum computers could quite easily crack widely used encryption schemes such as RSA, the researchers have shown that Robert McEliece's algorithm, by using a mathematical conundrum known as the hidden super group, cannot be cracked using quantum fourier analysis.
The technique was the first widely known quantum cracking technique proposed in 1994 and if and when implemented by quantum computers will essentially render most, but apparently not all, encryption methods useless.
So what exactly uses a 30-year-old piece of software these days? Apparently a file sharing system called Entropy. Apparently that system never really got off the ground due to the size of the keys that need to be transferred. These revelations are likely to result in McEliece's masterpiece receiving a lot more attention and improving its viability in the real world.
It should be noted that the researchers categorically state that while McEliece's algorithm cannot be cracked by current quantum cryptography attacks, they are not taking any bets on whether it can withstand attacks dreamt up in the future.
Nonetheless, few will deny that McEliece's encryption work has stood the test of time better than most. µ
OTP(one time pad) encryption, properly implimented, is completly unbreakable. Period. This is what Russian spies(all spies??) used to send coded messages. To impliment for computer message use would require an offline exchange of single use keys, but...after that, there is no way to attack this.
Well nothing is unbreakable, I mean exactly nothing. The algorithm survive quantum attacks but the fact is you don't need quantum computers to break it. Read it here:
http://en.wikipedia.org/wiki/McEliece_cryptosystem#Attacks
Of course doing a research is nice but publishing conclusions is different.
Yes they do. oh wait is gone... hang on... I need a quantum case, (or do I)
Panic over.
Of course it's crackable. But, first you must find someone that cares about cracking it. Most of these so-called attempts were done at the request of people who use the encryption, so the attempts at cracking are half-hearted.
It's true, though. The SSL that we use at VeriSign is based on the original algorithm, too, albeit with some additions over the years to dissuade phishing and sniffing attacks. It's also interesting to consider that encryption was never designed to protect anything beyond the data points it shields; folks who note MITM attacks as a core weakness don't realize that that those exploit peripheral and unsafe connections, even in the case of extended validation ssl (with its green url bar). Obviously EV SSL has a bit more under the hood, but it's all based upon the original principles for a good reason - they're sturdy.
- Researchers use CPUs to feed GPUs
- IBM shows off sub-10nm carbon nanotube transistors
- Microsoft shows off touchy feely surfaces of the future
- Boffins invent an operating system for cities
- Nike is readying Back to the Future shoes
- IBM and 3M are developing semiconductor adhesives
- Amazon chief fails to deliver rocket to space
- Lightbulbs can be used to broadcast wireless internet
