<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Crypto on phasewalk</title>
    <link>https://blog.phasewalk.xyz/tags/crypto/</link>
    <description>Recent content in Crypto 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/crypto/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>
    <item>
      <title>The Discrete Logarithm Problem</title>
      <link>https://blog.phasewalk.xyz/posts/dlp/</link>
      <pubDate>Sun, 12 Apr 2026 00:00:00 +0000</pubDate>
      <guid>https://blog.phasewalk.xyz/posts/dlp/</guid>
      <description>&lt;p&gt;The &lt;strong&gt;discrete logarithm problem&lt;/strong&gt; (DLP) is a fundamental problem in group theory that underpins the security of many cryptographic systems, including elliptic curve cryptography and the &lt;a href=&#34;https://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange&#34;&gt;Diffie-Hellman key exchange&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;In a &lt;a href=&#34;https://blog.phasewalk.xyz/posts/bn254&#34;&gt;cyclic group&lt;/a&gt; $G$ with generator $g$, every element $h\in G$ can be expressed as $h=g^x$ for some integer $x$. Computing $g^x$ given $g$ and $x$ is fast and efficient &amp;ndash; $\mathcal O(\log x)$ using the method of repeated squaring.&lt;/p&gt;&#xA;&lt;p&gt;The inverse problem, however &amp;ndash; given $g$ and $h=g^x$, find $x$ &amp;ndash; is believed to be computationally hard in certain groups. We haven&amp;rsquo;t &lt;em&gt;proven&lt;/em&gt; that it&amp;rsquo;s hard (P vs NP is still an open problem), but we have decades of cryptanalysis and no known efficient algorithms for solving DLP in well-chosen groups, which gives us confidence in its hardness.&lt;/p&gt;</description>
    </item>
    <item>
      <title>A Cypherpunk&#39;s Manifesto</title>
      <link>https://blog.phasewalk.xyz/posts/archive/cypherpunk-manifesto/</link>
      <pubDate>Tue, 09 Mar 1993 00:00:00 +0000</pubDate>
      <guid>https://blog.phasewalk.xyz/posts/archive/cypherpunk-manifesto/</guid>
      <description>&lt;blockquote&gt;&#xA;&lt;p&gt;The following is an archival copy of Eric Hughes&amp;rsquo; &amp;ldquo;A Cypherpunk&amp;rsquo;s Manifesto&amp;rdquo;, originally published on 9 March 1993. The manifesto is a foundational text for the cypherpunk movement, advocating for privacy and the use of cryptography in an open society. The original text can be found at &lt;a href=&#34;https://www.activism.net/cypherpunk/manifesto.html&#34;&gt;https://www.activism.net/cypherpunk/manifesto.html&lt;/a&gt;.&lt;/p&gt;&lt;/blockquote&gt;&#xA;&lt;p&gt;&lt;em&gt;Privacy is necessary for an open society in the electronic age. Privacy is not secrecy. A private matter is something one doesn&amp;rsquo;t want the whole world to know, but a secret matter is something one doesn&amp;rsquo;t want anybody to know. Privacy is the power to selectively reveal oneself to the world.&lt;/em&gt;&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
