<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Shor's discrete logarithm quantum algorithm for elliptic curves · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/quant-ph_0301141/</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/quant-ph_0301141/feed.xml" rel="self" type="application/rss+xml" /><item><title>Shor's discrete logarithm quantum algorithm for elliptic curves — mentioned by ori_b</title><link>https://news.ycombinator.com/item?id=36672811</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0301141:36672811</guid><pubDate>Mon, 10 Jul 2023 20:53:24 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/quant-ph/0301141&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0301141/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Shor's discrete logarithm quantum algorithm for elliptic curves — mentioned by archgoon</title><link>https://news.ycombinator.com/item?id=25023863</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0301141:25023863</guid><pubDate>Sun, 08 Nov 2020 07:29:47 GMT</pubDate><description>&lt;p&gt;You can break a 160 bit EC with a 1000 qubit quantum machine. An equivalent 1024 RSA bit key needs about 2000 qbuits. (The following paper has a cool table and formula for working out how many you need for each) https://arxiv.org/pdf/quant-ph/0301141.pdf My incredulity is in the idea that Google and the NSA apparently have 1000 qubit machines that can do that, but not 2000 qubit ones (and you should be very confident that will remain the case in future). Note that once you&amp;#x27;re at the &amp;quot;I have a stable 1000 qubit machine that can perform complex calculations&amp;quot; realm, you can consider doing things…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0301141/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Shor's discrete logarithm quantum algorithm for elliptic curves — mentioned by blattimwind</title><link>https://news.ycombinator.com/item?id=16458990</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0301141:16458990</guid><pubDate>Sun, 25 Feb 2018 14:04:33 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/pdf/quant-ph/0301141.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0301141/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
