A Harvard University
computer science professor claims to have developed Internet
message encryption code that he can prove is unbreakable.
While other "unbreakable" codes have been developed in the past few years, the latest
one, developed by Professor Michael Rabin, represents the first one that is provably
uncrackable.
Rabin, who backs up his claims with mathematics, reportedly said
the code is also efficient, adding that adversaries trying to crack it are "helpless."
The code, which uses disappearing keys, also employs decoding formulas that are not
stored, further hindering efforts to break it. However, some analysts say only the test
of time can tell whether this or any other code is unbreakable.
Invisible Encoding
Most coding systems use keys, or mathematical algorithms, to encode and decode messages
sent electronically over the Internet, including e-mail. The code developed by Rabin and
his assistant, student Yan Zong Bing, uses a stream of random numbers that disappear
when the message is encrypted, effectively hiding the decoding mechanism.
Some in the encryption business say codes are already secure enough, but others claim a
system such as Rabin's could keep messages permanently encrypted and more secure.
Time Will Tell
An expert who spoke to NewsFactor Network said it is hard to foresee what will happen
to computer code in the future.
"Most codes, if you have the computer and the computer time, you can break," said Bob
Hughes, president of Atlanta, Georgia-based
Guarded.net. "The codes are getting more and
more complex; but really, what was unbreakable a few years ago is now breakable."
Hughes also told NewsFactor that it is hard to prove a code will remain unbreakable
in the future.
"Proving that a code cannot be broken takes time," he said. "Over years of operation,
people will throw a number of different things at it. It is hard to prove beyond a
reasonable doubt that a code cannot be broken."
Security Over Speed
Rabin, who says he created the code for the challenge and not for commercial gain,
contends the unbreakable code is also efficient.
Hughes, whose company provides security and encryption services for large businesses
such as banks and other financial institutions, called the new code significant, but
said he was somewhat skeptical regarding its efficiency in the real world of computer
security.
"An important aspect, as an algorithm is produced, is how fast
it can be processed," Hughes said. "That is a factor. People can make complex codes, but
they're not usable."
Hughes said government and financial organizations may be willing to sacrifice
efficiency and speed for complete security, but that is not the case in business.
"This latest code would probably be used in an environment of higher security, and not
in general usage," Hughes said.
|