{"id":17,"date":"2014-01-05T17:54:55","date_gmt":"2014-01-05T17:54:55","guid":{"rendered":"http:\/\/www.opensource.im\/?p=17"},"modified":"2014-01-05T17:54:55","modified_gmt":"2014-01-05T17:54:55","slug":"report-nsa-looking-to-crack-all-encryption-with-quantum-computer","status":"publish","type":"post","link":"https:\/\/euvolution.com\/open-source-convergence\/encryption\/report-nsa-looking-to-crack-all-encryption-with-quantum-computer.php","title":{"rendered":"Report: NSA looking to crack all encryption with quantum computer"},"content":{"rendered":"<p><p>    The U.S. National    Security Agency is attempting to build a new breed of    supercomputer that theoretically could make short work of    cracking most keys used for encrypted communications.  <\/p>\n<p>    The project to    build a cryptographically useful quantum computer is part of    an $80 million research project called Penetrating Hard    Targets that is taking place at a campus in College Park,    Maryland,     according to The Washington Post. The newspaper quoted    documents it said were provided by former NSA contractor Edward    Snowden.  <\/p>\n<p>    Since the early    days of encryption, an important defense in the security of    each system has been the amount of time it would take to attack    and discover the encryption key. The longer the time required,    the greater the motivation and financial investment needed to    discover the key.  <\/p>\n<p>    As computers have    gotten more powerful, longer encryption keys that are harder to    crack have been employed, so today keys of 256 bits or more are    common, especially for sensitive information. Even with a    powerful supercomputer, experts generally agree it would take    many years to crack a single key of 256 bits or more.  <\/p>\n<p>    Quantum computing    turns all of that around.  <\/p>\n<p>    Unlike    traditional computing, which relies on single bits of    information that represent either one or zero, a quantum    computer employs quantum bits that hold the value of one and    zero at the same time.  <\/p>\n<p>    If youre    wondering how thats possible, youre not alone. Even the    worlds leading quantum computing experts dont totally    understand how it works, but they are in agreement about what    it means for encryption keys.  <\/p>\n<p>    Because each    quantum bit holds two values at the same time, a string of    quantum bits can represent all numbers simultaneously. That    means a future quantum computer could do many calculations in a    single step, not one by one as todays computers do. So,    cracking an encryption key could become childs play.  <\/p>\n<p>    At least, thats    the theory.  <\/p>\n<p>    Scientists are    yet to get reliably operating quantum computers capable of    doing complex mathematical calculations, but it appears the NSA    program is aimed at doing just that.  <\/p>\n<p><!-- Auto Generated --><\/p>\n<p>Originally posted here: <\/p>\n<p><a target=\"_blank\" href=\"http:\/\/www.pcworld.com\/article\/2083760\/report-nsa-looking-to-crack-all-encryption-with-quantum-computer.html\" title=\"Report: NSA looking to crack all encryption with quantum computer\">Report: NSA looking to crack all encryption with quantum computer<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p> The U.S. National Security Agency is attempting to build a new breed of supercomputer that theoretically could make short work of cracking most keys used for encrypted communications. <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[45],"tags":[],"class_list":["post-17","post","type-post","status-publish","format-standard","hentry","category-encryption"],"_links":{"self":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/posts\/17"}],"collection":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/comments?post=17"}],"version-history":[{"count":0,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/posts\/17\/revisions"}],"wp:attachment":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/media?parent=17"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/categories?post=17"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/tags?post=17"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}