<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Knapsack-Like Code Using Recurrence Sequence Representations · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1503.04238/</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/1503.04238/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Knapsack-Like Code Using Recurrence Sequence Representations — mentioned by schoen</title><link>https://news.ycombinator.com/item?id=9313961</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.04238:9313961</guid><pubDate>Fri, 03 Apr 2015 00:34:05 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s kind of sad when university press departments don&amp;#x27;t include a link to the actual research. The paper that this summarizes can be found at http://arxiv.org/pdf/1503.04238v1.pdf (I thought the summary was pretty clear and unusually technically accurate, although they don&amp;#x27;t talk about whether other people doing research on post-quantum crypto think that this method does or doesn&amp;#x27;t have promise or important tradeoffs compared to other methods. It&amp;#x27;s not as if this is the first-ever post-quantum cryptosystem to be proposed.)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.04238/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.NT</category></item></channel></rss>
