<?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 pnasis</title>
    <link>https://pnasis.gitlab.io/tags/number-theory/</link>
    <description>Recent content in Number Theory on pnasis</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 04 Apr 2026 13:35:13 +0300</lastBuildDate>
    <atom:link href="https://pnasis.gitlab.io/tags/number-theory/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>RITSEC CTF 2026 - Reversing Writeups (Part 2): not quite optimal</title>
      <link>https://pnasis.gitlab.io/posts/ritsec-ctf-2026-reversing-writeups-part-2-not-quite-optimal/</link>
      <pubDate>Sat, 04 Apr 2026 13:35:13 +0300</pubDate>
      <guid>https://pnasis.gitlab.io/posts/ritsec-ctf-2026-reversing-writeups-part-2-not-quite-optimal/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;    Continuing my participation in &lt;a href=&#34;https://ctfd.ritsec.club/&#34;&gt;RITSEC CTF 2026&lt;/a&gt;, this second part of the series focuses on another challenge from the Reversing category titled &lt;em&gt;&lt;strong&gt;“not quite optimal”&lt;/strong&gt;&lt;/em&gt;. As with the previous writeup, the goal here is to document the full thought process behind solving the challenge, from initial inspection of the binary to understanding its underlying logic and ultimately deriving the solution.&lt;/p&gt;&#xA;&lt;p&gt;    This challenge immediately gave the impression that the solution would not come from following the code literally, but rather from simplifying what the program was actually doing and stripping away unnecessary complexity.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
