768-bit RSA modulus factorized

RSA, a public key cryptography algorithm, relies for its security on the fact that factorizing a number that is the product of two large primes is hard. Very hard.

A group of computer science researchers, mostly from Europe, have just factored the number RSA-768:

RSA-768 = 12301866845301177551304949583849627207728535695953347921973224521517264005
 07263657518745202199786469389956474942774063845925192557326303453731548268
 50791702612214291346167042921431160222124047927473779408066535141959745985
 6902143413

It's 768 bits long (or 232 decimal digits) and is the product of two 116 decimal digit numbers. If you know anything about public key cryptography and how it's used in SSL (the underlying tech for secure web sites like your bank), you may be feeling a little alarmed at this; after all the researchers in their paper estimate that factoring a 1024-bit product of two primes is only about one thousand times harder and many people are using 1024-bit RSA.

However, let's just see what was involved in completing this feat. They used the number field sieve method (not something I've ever heard of, to be clear). First of all they used 80 processors for 6 months on polynomial selection (presumably part of the sieve algorithm). After that they performed the main task known as sieving, "which was done on many hundreds of machines and took almost two years." So after two and a half years of continuous processing on 80 and then "several hundred" machines, they factorized RSA-768. They admit that on a single 2.2GHz AMD Opteron processor with 2GB of RAM sieving would have taken 1500 years.

Although a formidable feat -- and believe you me, I am in awe -- this is still brute force. No doubt, the techniques and code they used will be refined in the future (and they do say that their estimate is 10 years before RSA-1024 is factored), but it's still not a "knock it out in an afternoon" type break. I'd say we're safe for a while yet.

Oh, by the way, the result they found is that

RSA-768 = 33478071698956898786044169848212690817704794983713768568912431388982883793
 878002287614711652531743087737814467999489
 × 36746043666799590428244633799627952632279158164343087642676032283815739666
 511279233373417143396810270092798736308917

Posted via email from Julian's posterous

 


Posts on similar topics...

2 Responses

  • Fri 08 Jan 2010
  • 6:50 AM
  •  avatar #1

Dew Drop – January 8, 2010 | Alvin Ashcraft's Morning Dew said...

Pingback from Dew Drop – January 8, 2010 | Alvin Ashcraft's Morning Dew

  • Mon 01 Nov 2010
  • 5:32 AM
  •  avatar #2

hari E said...

plz someone tell me how to find modulo of big number like mod (27^21667,32881) in matlab

any algorithm plz tell me it will be very helpful for my project

Leave a Response

Some MarkDown is allowed, but HTML is not. (Click to learn more.)

  • Emphasize with italics: surround word with underscores _emphasis_
  • Emphasize strongly: surround word with double-asterisks **strong**
  • Link: surround text with square brackets, url with parentheses [text](url)
  • Inline code: surround text with backticks `IEnumerable`
  • Unordered list: start each line with an asterisk, space * an item
  • Ordered list: start each line with a digit, period, space 1. an item
  • Insert code block: start each line with four spaces
  • Insert blockquote: start each line with right-angle-bracket, space > Now is the time...

Extras

Search

About Me

I'm Julian M Bucknall, the M because it's my middle initial and because I and the other Julian Bucknall (the movie guy) would like to differentiate ourselves.

I'm a programmer by trade, an actor by ambition, and an algorithms guy by osmosis. I write articles for PCPlus in my spare time, not that there's much of that.

Julian M Bucknall Apart from that, an ex-pat Brit, atheist, microbrew enthusiast, Pet Shop Boys fanboy, slide rule and HP calculator collector, amateur photographer, Altoids muncher.

DevExpress

I'm Chief Technology Officer at Developer Express, a software company that writes some great controls and tools for .NET and Delphi. I'm responsible for the technology oversight and vision of the company.

Validation

Validate markup as HTML5 (beta)     Validate CSS

Bottom swirl

Archives

May 2012 (4)
SMTWTFS
« Apr  
12345
6789101112
13141516171819
20212223242526
2728293031

Like this Archive Calendar widget? Download it here.

Social networking

The OUT Campaign

The OUT Campaign

My Tweets

  • Honest Movie Trailer of Phantom Menace http://t.co/sif8y4Ns and then Battleship, er, Transformers http://t.co/sif8y4Ns
  • Damn, Donna Summer and Chuck Brown both gone in the last 24 hours. Different types of music, sure, but enjoyed them both. :(
  • Just saw a company page showing a list of tweets with "Join the conversation" linked to their Twitter a/c. The tweets are 6 months old #fail
Bottom swirl