<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Impact of Quantum Computing on Present Cryptography · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1804.00200/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1804.00200/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Impact of Quantum Computing on Present Cryptography — mentioned by steelframe</title><link>https://news.ycombinator.com/item?id=21016989</link><guid isPermaLink="false">urn:hackerpapers:mention:1804.00200:21016989</guid><pubDate>Thu, 19 Sep 2019 15:16:48 GMT</pubDate><description>&lt;p&gt;&amp;gt; only methods based on Discrete Log are at risk, which includes RSA and ECC RSA&amp;#x27;s security is based on the presumption that factorization is hard, which is a different problem than finding the discrete log. To attack RSA you would use Shor&amp;#x27;s algorithm, and to attack ECC you would use Grover&amp;#x27;s. See page 2 of this paper: https://arxiv.org/pdf/1804.00200.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1804.00200/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
