https://hackerpaper.kaipfister.de/p/quant-ph_0411037/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=30973424urn:hackerpapers:mention:quant-ph_0411037:30973424Sun, 10 Apr 2022 00:29:45 GMT<p>QC can only solve two problems more efficiently than classical (and this is proven very thoroughly): unstructured search and discrete log problem (well, more accurately, certain hidden subgroup problems). DLP covers factoring, hence RSA. Elliptic curve crypto is directly a discrete log problem, as the crypto is based on the underlying group defined over rational curve points. NTRU is based on neither problem; it&#x27;s based on a lattice problem in a certain class of rings. Lattice problems cannot be reduced to either class of problems for which quantum provides speedups. As a side effect of…</p><p><a href="https://hackerpaper.kaipfister.de/p/quant-ph_0411037/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph