Is RSA encryption broken?

First spotted on the ILUG mailing list, it appears that a young 16 year old student has cracked the RSA encryption system and won 1st prize at the BT Young Scientist Competition 2007.

If it’s true then Internet commerce could be in for a rough time, but some previous winners have proven to be less than remarkable when seen against the cold light of day. This comment from the winner, Abdusalam Abubakar, seems to indicate that the method used might not be that effective either. Check out this ILUG thread for further discussion. Can it be true he wrote it in Visual Basic?

“It was great, unbelievable. I didn’t think I was going to win anything. I didn’t want to be optimistic,” he told The Irish Times last night. Abdusalam, whose name translates into “man of peace”, based his initial work on partially successful attacks on the world’s most widely-used encryption system, RSA, mounted by two mathematicians. He decided to take the best aspects of both and generalise a new approach, which he believes has the potential to tackle at least some less complex coding systems.


6 Comments

Bernie Goldbach (1 comments.) on January 14, 2007 at 10:00 am.

I don’t think the student claimed to break the encryption because when I chatted with him, it was the methodology that he was showcasing, not actual examples of commercial encryption that he had cracked.

The headline is not based on the evidence displayed at the Young Scientist stand.

Reply

Donncha (1707 comments.) on January 14, 2007 at 10:19 am.

Ah, that makes a lot of sense. I wonder if it’ll lead anywhere and if the method will be peer reviewed.

Reply

safa on January 22, 2007 at 1:47 pm.

Dear Bernie,
You chatted with Abdusalam Abubakar? Could u please pass me his contact number or email address? I am writing for a Muslim newspaper and would like to interview him for our Feb issue. Thank you.

Reply

Anonymous on January 23, 2007 at 6:48 pm.

Unless I’m mistaken, doesn’t breaking this encryption involve also solving the Riemann Hypothesis? Sure, you can factor out the prime using many different algorithms (as code crackers do of course) but typically, it might take perhaps 12 months for a PC to crack just one RSA prime in one encrypted message. Even the FBI don’t admit to being able to do it in less than a few days at a time? Or am I missing something here?

Reply

bk1991 on February 2, 2008 at 8:55 pm.

well they didnt give him a young scientist award for nothing. I was talking to him a few days ago and he did crack it after 4 months of hardwork

Reply

Friend on April 22, 2008 at 10:05 pm.

I had talked to him. He proved a number of theorems extending Wiener’s 1990 attack on RSA. He wasnt factorising the numbers as that will take along time. There was this trick to do with continued fractions. It was pretty cool stuff.

Reply

Leave Your Comment

Your email will not be published or shared. Required fields are marked *

*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>


Holy Shmoly! is Stephen Fry proof thanks to caching by WP Super Cache