Softpedia
 

NEWS CATEGORIES:



NEWS ARCHIVE >>
SOFTPEDIA REVIEWS >>
MEET THE EDITORS >>
Home > News > Science > Nano-Biotechnology

May 21st, 2007, 14:51 GMT · By Lucian Dorneanu

1024 Bits Encryption Can Be Cracked

SHARE:

Adjust text size:


1024-bit hash function
Enlarge picture
Mathematics is not so easy, once you get past the "exact change" problem and the yearly taxes. Here's a mathematical record that might sound simple to achieve, until you try it.

An international team of scientists have performed a computational "Herculean Task" and finally found the prime factors of a well-known, hard-to-factor number that is a whopping 307 digits long.


The scientists had been using computer clusters from three institutions, the EPFL, the University of Bonn and NTT in Japan, for 11 months, trying to solve this mathematical problem.

"This is the largest 'special' hard-to-factor number factored to date," explains EPFL cryptology professor Arjen Lenstra. Special numbers have a special mathematical form, close to a power of two. This is a real breakthrough that will most likely draw the attention of information security experts that will start thinking about changing the current encryption methods.

RSA encryption, named after the three individuals who devised the technique (Ronald Rivest, Adi Shamir and Leonard Adleman), takes advantage of the fact that factoring a number, meaning dividing it into its prime components, is extremely difficult.

Encryption methods like this one use a large composite number, usually 1024 bits in size, created by multiplying together two 150-or-so digit prime numbers, so that only the one who knows the two numbers has the encryption key that allows him or her to access the information.

Everybody uses these encryption applications, since nobody ever succeeded at factoring these huge numbers. At least not yet. The most recent factoring record is RSA200, a 200-digit 'non-special' number whose two prime factors were identified in 2005 after 18 months of calculations that took over a half century of computer time.

Since it's much more difficult to factor a number made up of two huge prime numbers (like the RSA method), it seems that for now the standard is still secure, but the experiment has proved, at least in theory, that this 1024 bits encryption method is not such a tough nut to crack, after all.

TELL US WHAT YOU THINK:

4,087 hits · Link to this article · Print article · Send to friend · Subscribe to news

MUST-READ RELATED ARTICLES:


New Carbon Nanotube Aerogel Supports 8000 Times Its Own Weight

High Flux Isotope Uranium Reactor Back on Line

Strongest "Nanoglue" Ever Bonds Anything Together

Trapping a Gravity Wave Using Entangled Photons

Bose-Einstein Condensate Confirmed in Polaritons

READER COMMENTS:



No user comments yet.
Be the first to express your opinion!
Copyright © 2001-2012 Softpedia. Contact/Tip us at

WindowsGamesDriversMacLinuxScriptsMobileHandheldNews

SUBMIT PROGRAM   |   ADVERTISE   |   GET HELP   |   SEND US FEEDBACK   |   RSS FEEDS   |   UPDATE YOUR SOFTWARE   |   ROMANIAN FORUM