<?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>Rsa on Akshit Kathuria</title>
    <link>https://ak-debug.github.io/tags/rsa/</link>
    <description>Recent content in Rsa on Akshit Kathuria</description>
    <image>
      <title>Akshit Kathuria</title>
      <url>https://ak-debug.github.io/social-preview.png</url>
      <link>https://ak-debug.github.io/social-preview.png</link>
    </image>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Thu, 12 Nov 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://ak-debug.github.io/tags/rsa/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Common RSA Weaknesses: Shared Primes, Close Primes, and Bad Parameters</title>
      <link>https://ak-debug.github.io/posts/rsa-parameter-weaknesses/</link>
      <pubDate>Thu, 12 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://ak-debug.github.io/posts/rsa-parameter-weaknesses/</guid>
      <description>RSA is only as strong as the primes behind it. If two keys share a prime, or if p and q sit too close together, the modulus can be factored in seconds with a GCD or Fermat&amp;rsquo;s method. Here I explain the maths behind each weakness, with clean Python solves for four crypto challenges from the bi0s DD CTF.</description>
    </item>
  </channel>
</rss>
