<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives (full version) · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2211.10665/</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/2211.10665/feed.xml" rel="self" type="application/rss+xml" /><item><title>CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives (full version) — mentioned by keithwinstein</title><link>https://news.ycombinator.com/item?id=49063670</link><guid isPermaLink="false">urn:hackerpapers:mention:2211.10665:49063670</guid><pubDate>Mon, 27 Jul 2026 00:07:24 GMT</pubDate><description>&lt;p&gt;This is really cool stuff, and I agree the future is likely to look more like this. I was surprised by the last two paragraphs (&amp;quot;Aside: verified assembly&amp;quot;) -- my understanding was that this future is basically already here. I believe agl&amp;#x27;s colleagues at Google have already deployed some auto-mutated verified assembly versions of some crypto routines, based on the Fiat Crypto + CryptOpt work (https://arxiv.org/pdf/2211.10665), both involving Andres Erbsen who I think is currently at Google before starting a professorship soon. I dunno if this work would count as &amp;quot;cheap&amp;quot; (it looks like Fig. 10…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2211.10665/"&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>
