{"id":32022,"date":"2017-06-05T06:50:14","date_gmt":"2017-06-05T10:50:14","guid":{"rendered":"http:\/\/www.opensource.im\/uncategorized\/infineon-future-proofs-cryptography-electronics-weekly-electronics-weekly.php"},"modified":"2017-06-05T06:50:14","modified_gmt":"2017-06-05T10:50:14","slug":"infineon-future-proofs-cryptography-electronics-weekly-electronics-weekly","status":"publish","type":"post","link":"https:\/\/euvolution.com\/open-source-convergence\/cryptography\/infineon-future-proofs-cryptography-electronics-weekly-electronics-weekly.php","title":{"rendered":"Infineon future-proofs cryptography &#8211; Electronics Weekly &#8211; Electronics Weekly"},"content":{"rendered":"<p><p>    The phantom of the quantum computer is keeping academia and    the IT industry on high alert, says Infineons Thomas    Pppelmann (pictured).  <\/p>\n<p>    Quantum computer attacks on todays cryptography are expected    to become reality within the next 15 to 20 years, says    Infineon.  <\/p>\n<p>    Once available, quantum computers could solve certain    calculations much faster than todays computers, threatening    even best currently known security algorithms such as RSA and    ECC.  <\/p>\n<p>    Various internet standards like Transport Layer Security (TLS),    S\/MIME or PGP\/ GPG use cryptography based on RSA or ECC to    protect data communication with smart cards, computers, servers    or industrial control systems. Online banking on https sites    or instant messaging encryption on mobile phones are    well-known examples.  <\/p>\n<p>    Infineon implemented a post-quantum key exchange scheme on a    commercially available contactless smart card chip. Key    exchange schemes are used to establish an encrypted channel    between two parties. The deployed algorithm is a variant of    New Hope, a quantum-resistant cryptosystem also explored    successfully by Google on a development version of the Chrome    browser.  <\/p>\n<p>    In a world of quantum computers, PQC (post-quantum    cryptography) should provide a level of security that is    comparable with what RSA and ECC provide today in the classical    computing world, says Infineon.  <\/p>\n<p>    However, to withstand quantum calculation power, key lengths    need to be longer than the usual 2048 bits of RSA or the 256    bits of ECC. Nevertheless, the researchers at Infineon were    able to implement New Hope on a commercially available security    chip without requiring additional memory space and hence a    larger chip size.  <\/p>\n<p>    Standardization bodies are expected to agree on one or multiple    PQC algorithms within the next few years before governments and    industries mandate the migration. Infineon is actively    participating in the development and standardization process in    order to enable a smooth transition and to address security    challenges that may arise in the advent of quantum computers.  <\/p>\n<\/p>\n<p><!-- Auto Generated --><\/p>\n<p>Read the rest here:<br \/>\n<a target=\"_blank\" href=\"https:\/\/www.electronicsweekly.com\/news\/business\/infineon-future-proofs-cryptography-2017-05\/\" title=\"Infineon future-proofs cryptography - Electronics Weekly - Electronics Weekly\">Infineon future-proofs cryptography - Electronics Weekly - Electronics Weekly<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p> The phantom of the quantum computer is keeping academia and the IT industry on high alert, says Infineons Thomas Pppelmann (pictured). Quantum computer attacks on todays cryptography are expected to become reality within the next 15 to 20 years, says Infineon. Once available, quantum computers could solve certain calculations much faster than todays computers, threatening even best currently known security algorithms such as RSA and ECC<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1600],"tags":[],"class_list":["post-32022","post","type-post","status-publish","format-standard","hentry","category-cryptography"],"_links":{"self":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/posts\/32022"}],"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=32022"}],"version-history":[{"count":0,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/posts\/32022\/revisions"}],"wp:attachment":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/media?parent=32022"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/categories?post=32022"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/tags?post=32022"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}