<?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 Akshit Kathuria</title>
    <link>https://ak-debug.github.io/categories/cryptography/</link>
    <description>Recent content in Cryptography 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/categories/cryptography/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>
    <item>
      <title>Solving Classical and Homebrew Ciphers</title>
      <link>https://ak-debug.github.io/posts/solving-classical-and-homebrew-ciphers/</link>
      <pubDate>Thu, 12 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://ak-debug.github.io/posts/solving-classical-and-homebrew-ciphers/</guid>
      <description>Most CTF cipher challenges come down to a few ideas: modular arithmetic, substitution with a repeating key, reused XOR keystreams, and historical machines. This post covers how I identify which one I&amp;rsquo;m facing, then works through four challenges from the bi0s DD CTF: a modulo &amp;lsquo;hash&amp;rsquo; that can be inverted, an Enigma message, a broken AES-CTR implementation, and a Vigenère cipher with an extended alphabet.</description>
    </item>
    <item>
      <title>When Symmetric Crypto Goes Wrong: AES Key-as-IV and XOR Mistakes</title>
      <link>https://ak-debug.github.io/posts/symmetric-crypto-misuse-aes-and-xor/</link>
      <pubDate>Thu, 12 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://ak-debug.github.io/posts/symmetric-crypto-misuse-aes-and-xor/</guid>
      <description>AES is not broken, but code that uses it often is. Here I explain why reusing the key as the CBC initialisation vector can hand an attacker the key itself, and why home-made XOR ciphers fall to known plaintext and key reuse. Each mistake comes with a working Python demonstration, the correct pattern, and a worked example from the bi0s DD CTF.</description>
    </item>
  </channel>
</rss>
