<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Cryptography on CS Theorems</title><link>https://cs.lozic.me/areas/cryptography/</link><description>Recent content in Cryptography on CS Theorems</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 08 Oct 2027 12:00:00 +0100</lastBuildDate><atom:link href="https://cs.lozic.me/areas/cryptography/index.xml" rel="self" type="application/rss+xml"/><item><title>IP = PSPACE</title><link>https://cs.lozic.me/posts/t036-ip-equals-pspace/</link><pubDate>Fri, 08 Oct 2027 12:00:00 +0100</pubDate><guid>https://cs.lozic.me/posts/t036-ip-equals-pspace/</guid><description>&lt;h2 id="symptom"&gt;Symptom&lt;/h2&gt;
&lt;p&gt;You have a claim you cannot check. A cloud provider ran a computation on a
petabyte you do not have and reports an answer. A model was trained on data you
cannot access. A database returned an aggregate over rows you are not permitted
to read.&lt;/p&gt;</description></item><item><title>The No-Cloning Theorem</title><link>https://cs.lozic.me/posts/t110-the-no-cloning-theorem/</link><pubDate>Fri, 02 Jul 2027 12:00:00 +0100</pubDate><guid>https://cs.lozic.me/posts/t110-the-no-cloning-theorem/</guid><description>&lt;h2 id="symptom"&gt;Symptom&lt;/h2&gt;
&lt;p&gt;You have spent this whole part learning that information wants to be copied.
Entropy bounds compression (T018), Huffman hits the bound (T020), redundancy
buys error correction (T021). Every result so far treats &amp;ldquo;make another copy&amp;rdquo; as
the free operation — the thing you do without thinking, the reason &lt;code&gt;cp&lt;/code&gt; has no
interesting failure modes.&lt;/p&gt;</description></item><item><title>The Birthday Bound</title><link>https://cs.lozic.me/posts/t074-the-birthday-bound/</link><pubDate>Fri, 06 Nov 2026 12:00:00 +0100</pubDate><guid>https://cs.lozic.me/posts/t074-the-birthday-bound/</guid><description>&lt;h2 id="symptom"&gt;Symptom&lt;/h2&gt;
&lt;p&gt;You need a short ID for uploads. Eight hex characters feels generous, so you
take the first 32 bits of a hash and move on.&lt;/p&gt;
&lt;p&gt;At about 80,000 uploads, two files collide, and one of them silently overwrites
the other, and the bug report says the customer&amp;rsquo;s invoice contains someone
else&amp;rsquo;s line items.&lt;/p&gt;</description></item></channel></rss>