<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Memory Unpacking on pnasis</title>
    <link>https://pnasis.gitlab.io/tags/memory-unpacking/</link>
    <description>Recent content in Memory Unpacking on pnasis</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 05 Apr 2026 11:54:26 +0300</lastBuildDate>
    <atom:link href="https://pnasis.gitlab.io/tags/memory-unpacking/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>RITSEC CTF 2026 - Reversing Writeups (Part 3): Buried Treasure</title>
      <link>https://pnasis.gitlab.io/posts/ritsec-ctf-2026-reversing-writeups-part-3-buried-treasure/</link>
      <pubDate>Sun, 05 Apr 2026 11:54:26 +0300</pubDate>
      <guid>https://pnasis.gitlab.io/posts/ritsec-ctf-2026-reversing-writeups-part-3-buried-treasure/</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 third part of the series focuses on another reversing challenge titled &lt;em&gt;&lt;strong&gt;“Buried Treasure”&lt;/strong&gt;&lt;/em&gt;. As with the previous writeups, this post documents the full process of analyzing the binary, understanding its internal logic and extracting the solution.&lt;/p&gt;&#xA;&lt;p&gt;    The name of the challenge already suggests something intentionally hidden rather than immediately visible, which typically hints at logic that is either obscured, layered, or embedded in an unusual part of the program flow.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
