{"id":2507,"date":"2017-10-14T23:46:42","date_gmt":"2017-10-14T23:46:42","guid":{"rendered":"http:\/\/websecuritypatterns.com\/blogs\/?p=2507"},"modified":"2018-05-20T23:04:59","modified_gmt":"2018-05-20T23:04:59","slug":"post-quantum-cryptography-pqc-quantum-resistant-encryption","status":"publish","type":"post","link":"https:\/\/websecuritypatterns.com\/blogs\/2017\/10\/14\/post-quantum-cryptography-pqc-quantum-resistant-encryption\/","title":{"rendered":"Post-Quantum Cryptography (PQC) &#8211; Future proofing for quantum-safe encryption !"},"content":{"rendered":"<p><span style=\"color: #000000;\">Everything is hackable! During the RSA Conference 2017 Crypto panel, Prof. Shamir (the letter &#8220;S&#8221; in the RSA) said, &#8220;I think there is a higher chance that RSA could be broken by a mathematical attack.&#8221; and he also wondered to note &#8220;Quantum Computers&#8221; will be a reality soon!\u00a0That said, the evolution of practical quantum computers are not far away, according to a recent\u00a0<a href=\"https:\/\/www.technologyreview.com\/s\/603495\/10-breakthrough-technologies-2017-practical-quantum-computers\/\">MIT Technology review<\/a> article, which highlighted most research works on Quantum computing are closer to a solution (<a href=\"https:\/\/www.wsj.com\/articles\/how-googles-quantum-computer-could-change-the-world-1508158847\">Google Quantum Computer!<\/a>). This means quantum computations can pose some serious threats to existing public-key cryptography mechanisms in use. Are they serious or deluded? Not really, It turns out that they are right to rave.<\/span><\/p>\n<p><span style=\"color: #000000;\">Even NIST believes on those expert predictions that\u00a0within the next 20 or so years, the emergence of\u00a0quantum computers will easily break all public key cryptography and digital signature schemes (ex. RSA, ECDH, ECDSA) currently being used. The impact on symmetric key mechanisms is not that much as it can be handled through larger key sizes (verified by using Grover&#8217;s algorithm and Shor&#8217;s algorithm &#8212; Both are commonly used for breaking Cryptography).<\/span><\/p>\n<div id=\"attachment_2509\" style=\"width: 910px\" class=\"wp-caption aligncenter\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-2509\" class=\"size-full wp-image-2509\" src=\"http:\/\/websecuritypatterns.com\/blogs\/wp-content\/uploads\/2017\/10\/QuantumCrypto-impacts.png\" alt=\"\" width=\"900\" height=\"461\" srcset=\"https:\/\/websecuritypatterns.com\/blogs\/wp-content\/uploads\/2017\/10\/QuantumCrypto-impacts.png 900w, https:\/\/websecuritypatterns.com\/blogs\/wp-content\/uploads\/2017\/10\/QuantumCrypto-impacts-768x393.png 768w, https:\/\/websecuritypatterns.com\/blogs\/wp-content\/uploads\/2017\/10\/QuantumCrypto-impacts-624x320.png 624w\" sizes=\"auto, (max-width: 900px) 100vw, 900px\" \/><p id=\"caption-attachment-2509\" class=\"wp-caption-text\">Impact of Quantum Computing on Common Cryptographic Algorithms (Source: NISTIR 8105)<\/p><\/div>\n<p><span style=\"color: #000000;\">Not surprising, last year (Dec 2016), NIST launched a Post-Quantum Cryptography project\u00a0initiative to develop quantum-resistant public-key cryptographic algorithms that are secure against both quantum and modern\u00a0computers currently being used and can also interoperate with existing communications protocols and networks. Currently. there are about 5 algorithm proposals for public-key post-quantum cryptography considered to be quantum-safe are being evaluated.<\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\"><strong>Lattice-based Cryptography<\/strong>: Based on the construction of cryptographic\u00a0primitives using computational lattice problems. They are\u00a0known to be secure assuming the <em>worst-case<\/em> hardness of certain lattice problems as it has proven to\u00a0be\u00a0difficult to estimate of the security of lattice schemes.\u00a0In 2009, Craig Gentry introduced the first <strong><em>fully homomorphic encryption scheme<\/em><\/strong>, which was based on a lattice problem. Other known lattice-based\u00a0cryptographic functions are Indistinguishability Obfuscation, cryptographic maps, attribute-based functional encryption.\u00a0<strong><em>NTRU encryption and NTRU signatures<\/em><\/strong> have been researched for many years without anyone finding a successful attack.<\/span><\/li>\n<li><span style=\"color: #000000;\"><strong>Multivariate Cryptography<\/strong>: Based on solving multivariate equations.\u00a0The <strong><em>Rainbow scheme<\/em><\/strong> is based on multivariate cryptography, which could be a potential signature scheme\u00a0to provide the basis for a quantum secure digital signature.<\/span><\/li>\n<li><span style=\"color: #000000;\"><strong>Code-based Cryptography<\/strong>: Based on\u00a0error-correcting codes, such as the McEliece and Niederreiter encryption algorithms and related signature scheme.\u00a0EU Commission recommended McEliece public key encryption as a candidate for long-term protection against attacks by quantum computation.<\/span><\/li>\n<li><span style=\"color: #000000;\"><strong>Hash-based\u00a0Cryptography<\/strong>: Based on Hash-based signature schemes like Lamport signature scheme (one-time signature and Merkel\u00a0signature scheme based on Hash trees (also called Merkel trees &#8212; used in Bitcoin Blockchain).They are known to be secure as long as hashes are not invertible and it certainly depends on large hash sizes.<\/span><\/li>\n<li><span style=\"color: #000000;\"><strong>Supersingular Elliptic Curve Isogeny Cryptography<\/strong>: Based on the Supersingular elliptic curve and it works like Diffie-Hellman Key exchange methods and its implementation, it can be an alternative to Diffie-Hellman with <\/span>forward<span style=\"color: #000000;\"> secrecy that can resist and provide protection against quantum computations.<\/span><\/li>\n<\/ul>\n<p><span style=\"color: #000000;\">All are quite promising developments, with NIST investing on\u00a0<\/span>PQC<span style=\"color: #000000;\">\u00a0initiatives newer algorithms and their prototype implementations are evolving faster. Lately, Google Research has evolved an implementation of Lattice-based Cryptography using Ring Learning-with-Errors (RLWE) algorithm has integrated into OpenSSL, which can be potentially leveraged as a potential alternative to current public-key encryption schemes for providing post-quantum security for TLS and IPSec\/IKE.<\/span><\/p>\n<h3><span style=\"color: #000000;\">Quantum-safe Blockchain ?<\/span><\/h3>\n<p><span style=\"color: #000000;\">Looking into the Public-key infrastructure risks with the impact of quantum computing, As we think, Blockchain is potentially vulnerable because of its reliance on PKI based digital signatures and hashing algorithms. The heavy use of Hashing algorithms will have a lesser impact as the chain can be easily enhanced by upgrading it from SHA-256 to SHA-384 to SHA-512 and so on. (For example, Bitcoin address is just\u00a0an SHA-256 hash of your public key). \u00a0The interesting aspect, in the proof-of-work <\/span>miners<span style=\"color: #000000;\"> world, there will be an unfair advantage to the miner who uses the quantum computer will get the biggest miner reward \ud83d\ude42<\/span><\/p>\n<p>Update (Oct 16):<\/p>\n<p class=\"wsj-article-headline\">How Google\u2019s Quantum Computer Could Change the World (Wallstreet Journal, Oct 16)<\/p>\n<p class=\"wsj-article-headline\">https:\/\/www.wsj.com\/articles\/how-googles-quantum-computer-could-change-the-world-1508158847<\/p>\n<p><span style=\"color: #000000;\">References:<\/span><\/p>\n<p><span style=\"color: #000000;\">NIST IR-8105 &#8211; http:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2016\/NIST.IR.8105.pdf<\/span><\/p>\n<p><span style=\"color: #000000;\">NIST PQC Project initiative &#8211; https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/<\/span><\/p>\n<p>https:\/\/www.technologyreview.com\/s\/608041\/first-quantum-secured-blockchain-technology-tested-in-moscow\/<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Everything is hackable! During the RSA Conference 2017 Crypto panel, Prof. Shamir (the letter &#8220;S&#8221; in the RSA) said, &#8220;I think there is a higher chance that RSA could be broken by a mathematical attack.&#8221; and he also wondered to note &#8220;Quantum Computers&#8221; will be a reality soon!\u00a0That said, the evolution of practical quantum computers are not far away, according&#8230; <a href=\"https:\/\/websecuritypatterns.com\/blogs\/2017\/10\/14\/post-quantum-cryptography-pqc-quantum-resistant-encryption\/\">Read more &raquo;<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[3,15,8,9],"tags":[25,93,109,57,110,62],"class_list":["post-2507","post","type-post","status-publish","format-standard","hentry","category-blockchain","category-cloud-security","category-pki-main","category-security","tag-blockchain","tag-cloud-security","tag-ntru","tag-pki-main","tag-pqc","tag-security"],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/posts\/2507","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/comments?post=2507"}],"version-history":[{"count":19,"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/posts\/2507\/revisions"}],"predecessor-version":[{"id":2545,"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/posts\/2507\/revisions\/2545"}],"wp:attachment":[{"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/media?parent=2507"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/categories?post=2507"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/websecuritypatterns.com\/blogs\/wp-json\/wp\/v2\/tags?post=2507"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}