{"id":67,"date":"2010-01-09T19:45:53","date_gmt":"2010-01-09T19:45:53","guid":{"rendered":"http:\/\/gator4228.temp.domains\/~vasiljevski\/blog\/?p=67"},"modified":"2026-03-07T23:51:20","modified_gmt":"2026-03-07T22:51:20","slug":"768-bit-rsa-cracked-1024-bit-safe-for-now","status":"publish","type":"post","link":"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/","title":{"rendered":"768-bit RSA cracked, 1024-bit safe (for now)"},"content":{"rendered":"<p>Researchers have posted a preprint that describes their method for factoring a number used for RSA 768-bit encryption.<\/p>\n<div><em><strong>SOURCE:<\/strong> By <a href=\"http:\/\/arstechnica.com\/author\/john-timmer\/\" rel=\"nofollow\">John Timmer<\/a> | Last updated <abbr title=\"2010-01-07T23:20:00Z\">January 7, 2010 5:20 PM<\/abbr><\/em><\/div>\n<p>With the increasing computing power available to even casual users, the security-conscious have had to move on to increasingly robust encryption, lest they find their information vulnerable to brute-force attacks. The latest milestone to fall is 768-bit RSA; in a paper posted on a cryptography preprint server, academic researchers have now announced that they factored one of these keys in early December.<!--more--><\/p>\n<p>Most modern cryptography relies on single large numbers that are the product of two primes. If you know the numbers, it&#8217;s relatively easy to encrypt and decrypt data; if you don&#8217;t, finding the numbers by brute force is a big computational challenge. But this challenge gets easier every year as processor speed and efficiency increase, making &#8220;secure&#8221; a bit of a moving target. The paper describes how the process was done with commodity hardware, albeit lots of it.<\/p>\n<p>Their first step involved sieving, or identifying appropriate integers; that took the equivalent of 1,500 years on one core of a 2.2GHz Opteron; the results occupied about 5TB. Those were then uniqued and processed into a matrix; because of all the previous work, actually using the matrix to factor the RSA value only took a cluster less than half a day. Although most people aren&#8217;t going to have access to these sorts of clusters, they represent a trivial amount of computing power for many organizations. As a result, the authors conclude, &#8220;The overall effort is sufficiently low that even for short-term protection of data of little value, 768-bit RSA moduli can no longer be recommended.&#8221; 1024-bit values should be good for a few years still.<\/p>\n<p>Given that these developments are somewhat inevitable, even the authors sound a bit bored by their report. &#8220;There is nothing new to be reported for the square root step, except for the resulting factorization of RSA-768&#8221; they write. &#8220;Nevertheless, and for the record, we present some of the details.&#8221; Still, they manage to have a little fun, in one place referencing a YouTube clip of a Tarantino film following their use of the term &#8220;bingo.&#8221;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Researchers have posted a preprint that describes their method for factoring a number used for RSA 768-bit encryption. SOURCE: By John Timmer | Last updated January 7, 2010 5:20 PM With the increasing computing power available to even casual users, the security-conscious have had to move on to increasingly robust encryption, lest they find their&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[13],"class_list":["post-67","post","type-post","status-publish","format-standard","hentry","category-general","tag-encryption","content","has-not-featured-image"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.3 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>768-bit RSA cracked, 1024-bit safe (for now) - Vasiljevski Nikola<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"768-bit RSA cracked, 1024-bit safe (for now) - Vasiljevski Nikola\" \/>\n<meta property=\"og:description\" content=\"Researchers have posted a preprint that describes their method for factoring a number used for RSA 768-bit encryption. SOURCE: By John Timmer | Last updated January 7, 2010 5:20 PM With the increasing computing power available to even casual users, the security-conscious have had to move on to increasingly robust encryption, lest they find their...\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/\" \/>\n<meta property=\"og:site_name\" content=\"Vasiljevski Nikola\" \/>\n<meta property=\"article:publisher\" content=\"vasiljevski\/\" \/>\n<meta property=\"article:author\" content=\"vasiljevski\/\" \/>\n<meta property=\"article:published_time\" content=\"2010-01-09T19:45:53+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2026-03-07T22:51:20+00:00\" \/>\n<meta name=\"author\" content=\"Nikola Vasiljevski\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@vasiljevski\" \/>\n<meta name=\"twitter:site\" content=\"@vasiljevski\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Nikola Vasiljevski\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/general\\\/768-bit-rsa-cracked-1024-bit-safe-for-now\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/general\\\/768-bit-rsa-cracked-1024-bit-safe-for-now\\\/\"},\"author\":{\"name\":\"Nikola Vasiljevski\",\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/#\\\/schema\\\/person\\\/509c89ff2a8cf276387db60304561957\"},\"headline\":\"768-bit RSA cracked, 1024-bit safe (for now)\",\"datePublished\":\"2010-01-09T19:45:53+00:00\",\"dateModified\":\"2026-03-07T22:51:20+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/general\\\/768-bit-rsa-cracked-1024-bit-safe-for-now\\\/\"},\"wordCount\":375,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/#\\\/schema\\\/person\\\/509c89ff2a8cf276387db60304561957\"},\"keywords\":[\"encryption\"],\"articleSection\":[\"General\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/general\\\/768-bit-rsa-cracked-1024-bit-safe-for-now\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/general\\\/768-bit-rsa-cracked-1024-bit-safe-for-now\\\/\",\"url\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/general\\\/768-bit-rsa-cracked-1024-bit-safe-for-now\\\/\",\"name\":\"768-bit RSA cracked, 1024-bit safe (for now) - Vasiljevski Nikola\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/#website\"},\"datePublished\":\"2010-01-09T19:45:53+00:00\",\"dateModified\":\"2026-03-07T22:51:20+00:00\",\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/general\\\/768-bit-rsa-cracked-1024-bit-safe-for-now\\\/\"]}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/\",\"name\":\"Vasiljevski Nikola\",\"description\":\"Art is never finished, only abandoned\",\"publisher\":{\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/#\\\/schema\\\/person\\\/509c89ff2a8cf276387db60304561957\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/#\\\/schema\\\/person\\\/509c89ff2a8cf276387db60304561957\",\"name\":\"Nikola Vasiljevski\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/ec57b2f6f160422547bf7c9839dcdea6dec9a50dddffae650a5a393fea6953ec?s=96&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/ec57b2f6f160422547bf7c9839dcdea6dec9a50dddffae650a5a393fea6953ec?s=96&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/ec57b2f6f160422547bf7c9839dcdea6dec9a50dddffae650a5a393fea6953ec?s=96&r=g\",\"caption\":\"Nikola Vasiljevski\"},\"logo\":{\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/ec57b2f6f160422547bf7c9839dcdea6dec9a50dddffae650a5a393fea6953ec?s=96&r=g\"},\"sameAs\":[\"https:\\\/\\\/www.vasiljevski.com\",\"vasiljevski\\\/\",\"https:\\\/\\\/x.com\\\/vasiljevski\",\"nikola83\"],\"url\":\"https:\\\/\\\/www.vasiljevski.com\\\/blog\\\/author\\\/nikola\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"768-bit RSA cracked, 1024-bit safe (for now) - Vasiljevski Nikola","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/","og_locale":"en_US","og_type":"article","og_title":"768-bit RSA cracked, 1024-bit safe (for now) - Vasiljevski Nikola","og_description":"Researchers have posted a preprint that describes their method for factoring a number used for RSA 768-bit encryption. SOURCE: By John Timmer | Last updated January 7, 2010 5:20 PM With the increasing computing power available to even casual users, the security-conscious have had to move on to increasingly robust encryption, lest they find their...","og_url":"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/","og_site_name":"Vasiljevski Nikola","article_publisher":"vasiljevski\/","article_author":"vasiljevski\/","article_published_time":"2010-01-09T19:45:53+00:00","article_modified_time":"2026-03-07T22:51:20+00:00","author":"Nikola Vasiljevski","twitter_card":"summary_large_image","twitter_creator":"@vasiljevski","twitter_site":"@vasiljevski","twitter_misc":{"Written by":"Nikola Vasiljevski","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/#article","isPartOf":{"@id":"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/"},"author":{"name":"Nikola Vasiljevski","@id":"https:\/\/www.vasiljevski.com\/blog\/#\/schema\/person\/509c89ff2a8cf276387db60304561957"},"headline":"768-bit RSA cracked, 1024-bit safe (for now)","datePublished":"2010-01-09T19:45:53+00:00","dateModified":"2026-03-07T22:51:20+00:00","mainEntityOfPage":{"@id":"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/"},"wordCount":375,"commentCount":0,"publisher":{"@id":"https:\/\/www.vasiljevski.com\/blog\/#\/schema\/person\/509c89ff2a8cf276387db60304561957"},"keywords":["encryption"],"articleSection":["General"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/","url":"https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/","name":"768-bit RSA cracked, 1024-bit safe (for now) - Vasiljevski Nikola","isPartOf":{"@id":"https:\/\/www.vasiljevski.com\/blog\/#website"},"datePublished":"2010-01-09T19:45:53+00:00","dateModified":"2026-03-07T22:51:20+00:00","inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.vasiljevski.com\/blog\/general\/768-bit-rsa-cracked-1024-bit-safe-for-now\/"]}]},{"@type":"WebSite","@id":"https:\/\/www.vasiljevski.com\/blog\/#website","url":"https:\/\/www.vasiljevski.com\/blog\/","name":"Vasiljevski Nikola","description":"Art is never finished, only abandoned","publisher":{"@id":"https:\/\/www.vasiljevski.com\/blog\/#\/schema\/person\/509c89ff2a8cf276387db60304561957"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.vasiljevski.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":["Person","Organization"],"@id":"https:\/\/www.vasiljevski.com\/blog\/#\/schema\/person\/509c89ff2a8cf276387db60304561957","name":"Nikola Vasiljevski","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/ec57b2f6f160422547bf7c9839dcdea6dec9a50dddffae650a5a393fea6953ec?s=96&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/ec57b2f6f160422547bf7c9839dcdea6dec9a50dddffae650a5a393fea6953ec?s=96&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/ec57b2f6f160422547bf7c9839dcdea6dec9a50dddffae650a5a393fea6953ec?s=96&r=g","caption":"Nikola Vasiljevski"},"logo":{"@id":"https:\/\/secure.gravatar.com\/avatar\/ec57b2f6f160422547bf7c9839dcdea6dec9a50dddffae650a5a393fea6953ec?s=96&r=g"},"sameAs":["https:\/\/www.vasiljevski.com","vasiljevski\/","https:\/\/x.com\/vasiljevski","nikola83"],"url":"https:\/\/www.vasiljevski.com\/blog\/author\/nikola\/"}]}},"_links":{"self":[{"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/posts\/67","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/comments?post=67"}],"version-history":[{"count":7,"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/posts\/67\/revisions"}],"predecessor-version":[{"id":779,"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/posts\/67\/revisions\/779"}],"wp:attachment":[{"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/media?parent=67"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/categories?post=67"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.vasiljevski.com\/blog\/wp-json\/wp\/v2\/tags?post=67"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}