<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Number-Theory on phasewalk</title>
    <link>https://blog.phasewalk.xyz/tags/number-theory/</link>
    <description>Recent content in Number-Theory on phasewalk</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Wed, 29 Apr 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://blog.phasewalk.xyz/tags/number-theory/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Generating Cryptographic Primes in Rust</title>
      <link>https://blog.phasewalk.xyz/posts/prime-gen/</link>
      <pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate>
      <guid>https://blog.phasewalk.xyz/posts/prime-gen/</guid>
      <description>&lt;blockquote&gt;&#xA;&lt;p&gt;This is a &lt;em&gt;draft&lt;/em&gt; post. There may be some rough edges,&#xA;but the core content is here. Feedback is welcome!&lt;/p&gt;&lt;/blockquote&gt;&#xA;&lt;p&gt;Many cryptographic schemes rely on large prime numbers for their security. RSA needs&#xA;two of them. Diffie-Hellman needs one. DSA, ElGamal, Paillier — primes everywhere.&#xA;Cryptographic libraries need to generate these primes efficiently and securely when&#xA;producing keypairs. In this post, we&amp;rsquo;ll learn how these primes are generated, and&#xA;implement our own in Rust.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
