<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic When will a quantum computer break RSA? in Tech Talk</title>
    <link>https://community.isc2.org/t5/Tech-Talk/When-will-a-quantum-computer-break-RSA/m-p/73406#M4538</link>
    <description>&lt;P&gt;Hi All&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN class=""&gt;&lt;SPAN&gt;My most trusted source for this is the &lt;A class="" href="https://www.linkedin.com/company/global-risk-institute/" target="_self"&gt;Global Risk Institute&lt;/A&gt;'s yearly "Quantum Threat Report" (&lt;A class="" href="https://lnkd.in/dWi5DaVj" target="_self"&gt;https://lnkd.in/dWi5DaVj&lt;/A&gt;) by &lt;A class="" href="https://www.linkedin.com/in/dr-mosca/" target="_blank" rel="noopener"&gt;Michele Mosca&lt;/A&gt;&lt;/SPAN&gt; and &lt;A class="" href="https://www.linkedin.com/in/marco-piani-26260b/" target="_blank" rel="noopener"&gt;Marco Piani&lt;/A&gt;&lt;/SPAN&gt;, which gives a risk based approach to the estimation based on experts' opinions. The TL;DR conclusion is that around mid-30s it will be more likely than unlikely that a cryptographically relevant quantum computer will exist.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;Today I knew about the paper "Estimation of Shor’s Circuit for 2048-bit Integers based on Quantum Simulator" by &lt;A class="" href="https://www.linkedin.com/company/fujitsu/" target="_self"&gt;&lt;SPAN&gt;Fujitsu&lt;/SPAN&gt;&lt;/A&gt; researchers (&lt;A class="" href="https://lnkd.in/dEqWA8eX" target="_self"&gt;https://lnkd.in/dEqWA8eX&lt;/A&gt;). They evaluate the computational resources necessary for factoring general composite large integers by Shor algorithm using an ideal quantum computer. That is:&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;- They don't take advantage of beneficial properties in the numbers they select,&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;- They assume a fault tolerant quantum computer. A real quantum computer will need some level of overhead for error correction.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;Also, they do not take advantage of the latest improvements to Shor's algorithm by Regev, Ragavan and Vaikuntanathan (on different papers, reach them through &lt;A class="" href="https://lnkd.in/dMCsUSNv" target="_self"&gt;https://lnkd.in/dMCsUSNv&lt;/A&gt;). So, the circuit depth and gate number estimations might be improved. I can't guess if the error correction overhead and these algorithmic improvements cancel out, but let's assume for a moment that they do. We just want to get ball-park figures.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;Their estimation is that RSA-2048 will need 2.23 × 10^12 gates with depth 1.80 × 10^12. As a reference, &lt;A class="" href="https://www.linkedin.com/company/ibm/" target="_self"&gt;&lt;SPAN&gt;IBM&lt;/SPAN&gt;&lt;/A&gt;'s Quantum roadmap (&lt;A class="" href="https://lnkd.in/dFu52wJR" target="_self"&gt;https://lnkd.in/dFu52wJR&lt;/A&gt;) expects to support 10^9-gate circuits in 2033+. So, the target is still unreachable by a factor of 1000 gates.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;Conclusion: Unless the hardware development accelerates beyond the current predictions or algorithmic improvements significantly reduce circuit requirements, the target of 2033 or beyond seems to be a good estimation.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;However it could come sooner than you expect:&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;&lt;SPAN class=""&gt;The integration of classical supercomputing, ASIC-enhanced AI and memcomputing, quantum interconnects, AI-driven optimizations, and quantum black box oracles forms a threat to RSA encryption today. These researchers only take into account commercially available quantum computing capability and not the interconnect of a hybridized network with classical supercomputing, AI, quantum oracles and other techniques and capabilities to derive prime factors.&lt;BR /&gt;&lt;BR /&gt;In this approach you need far lesser Qubits, an approach that was also pointed out by the Chinese back in 2023, claiming they could break 2048-bit RSA, using a 372-qubit quantum computer. Yet here the assumption is made that there is still time until 2033 ... That really is not the right message ...&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;Regards&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;Caute_Cautim&lt;/SPAN&gt;&lt;/P&gt;</description>
    <pubDate>Tue, 27 Aug 2024 01:01:27 GMT</pubDate>
    <dc:creator>Caute_cautim</dc:creator>
    <dc:date>2024-08-27T01:01:27Z</dc:date>
    <item>
      <title>When will a quantum computer break RSA?</title>
      <link>https://community.isc2.org/t5/Tech-Talk/When-will-a-quantum-computer-break-RSA/m-p/73406#M4538</link>
      <description>&lt;P&gt;Hi All&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN class=""&gt;&lt;SPAN&gt;My most trusted source for this is the &lt;A class="" href="https://www.linkedin.com/company/global-risk-institute/" target="_self"&gt;Global Risk Institute&lt;/A&gt;'s yearly "Quantum Threat Report" (&lt;A class="" href="https://lnkd.in/dWi5DaVj" target="_self"&gt;https://lnkd.in/dWi5DaVj&lt;/A&gt;) by &lt;A class="" href="https://www.linkedin.com/in/dr-mosca/" target="_blank" rel="noopener"&gt;Michele Mosca&lt;/A&gt;&lt;/SPAN&gt; and &lt;A class="" href="https://www.linkedin.com/in/marco-piani-26260b/" target="_blank" rel="noopener"&gt;Marco Piani&lt;/A&gt;&lt;/SPAN&gt;, which gives a risk based approach to the estimation based on experts' opinions. The TL;DR conclusion is that around mid-30s it will be more likely than unlikely that a cryptographically relevant quantum computer will exist.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;Today I knew about the paper "Estimation of Shor’s Circuit for 2048-bit Integers based on Quantum Simulator" by &lt;A class="" href="https://www.linkedin.com/company/fujitsu/" target="_self"&gt;&lt;SPAN&gt;Fujitsu&lt;/SPAN&gt;&lt;/A&gt; researchers (&lt;A class="" href="https://lnkd.in/dEqWA8eX" target="_self"&gt;https://lnkd.in/dEqWA8eX&lt;/A&gt;). They evaluate the computational resources necessary for factoring general composite large integers by Shor algorithm using an ideal quantum computer. That is:&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;- They don't take advantage of beneficial properties in the numbers they select,&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;- They assume a fault tolerant quantum computer. A real quantum computer will need some level of overhead for error correction.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;Also, they do not take advantage of the latest improvements to Shor's algorithm by Regev, Ragavan and Vaikuntanathan (on different papers, reach them through &lt;A class="" href="https://lnkd.in/dMCsUSNv" target="_self"&gt;https://lnkd.in/dMCsUSNv&lt;/A&gt;). So, the circuit depth and gate number estimations might be improved. I can't guess if the error correction overhead and these algorithmic improvements cancel out, but let's assume for a moment that they do. We just want to get ball-park figures.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;Their estimation is that RSA-2048 will need 2.23 × 10^12 gates with depth 1.80 × 10^12. As a reference, &lt;A class="" href="https://www.linkedin.com/company/ibm/" target="_self"&gt;&lt;SPAN&gt;IBM&lt;/SPAN&gt;&lt;/A&gt;'s Quantum roadmap (&lt;A class="" href="https://lnkd.in/dFu52wJR" target="_self"&gt;https://lnkd.in/dFu52wJR&lt;/A&gt;) expects to support 10^9-gate circuits in 2033+. So, the target is still unreachable by a factor of 1000 gates.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;Conclusion: Unless the hardware development accelerates beyond the current predictions or algorithmic improvements significantly reduce circuit requirements, the target of 2033 or beyond seems to be a good estimation.&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;However it could come sooner than you expect:&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;&lt;SPAN class=""&gt;The integration of classical supercomputing, ASIC-enhanced AI and memcomputing, quantum interconnects, AI-driven optimizations, and quantum black box oracles forms a threat to RSA encryption today. These researchers only take into account commercially available quantum computing capability and not the interconnect of a hybridized network with classical supercomputing, AI, quantum oracles and other techniques and capabilities to derive prime factors.&lt;BR /&gt;&lt;BR /&gt;In this approach you need far lesser Qubits, an approach that was also pointed out by the Chinese back in 2023, claiming they could break 2048-bit RSA, using a 372-qubit quantum computer. Yet here the assumption is made that there is still time until 2033 ... That really is not the right message ...&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;Regards&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;Caute_Cautim&lt;/SPAN&gt;&lt;/P&gt;</description>
      <pubDate>Tue, 27 Aug 2024 01:01:27 GMT</pubDate>
      <guid>https://community.isc2.org/t5/Tech-Talk/When-will-a-quantum-computer-break-RSA/m-p/73406#M4538</guid>
      <dc:creator>Caute_cautim</dc:creator>
      <dc:date>2024-08-27T01:01:27Z</dc:date>
    </item>
  </channel>
</rss>

