<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Heap on bitfriends' blog</title><link>https://b17fr13nds.github.io/tags/heap/</link><description>Recent content in Heap on bitfriends' blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Fri, 18 Oct 2024 18:50:53 +0200</lastBuildDate><atom:link href="https://b17fr13nds.github.io/tags/heap/index.xml" rel="self" type="application/rss+xml"/><item><title>chains - BRICS CTF 2024</title><link>https://b17fr13nds.github.io/posts/brics_chains/</link><pubDate>Fri, 18 Oct 2024 18:50:53 +0200</pubDate><guid>https://b17fr13nds.github.io/posts/brics_chains/</guid><description>&lt;p&gt;Two weeks ago, I played BRICS CTF with r3kapig, and we ranked 1st!
Chains was one of the challanges I solved.&lt;/p&gt;
&lt;p&gt;We were given a program to add/remove proxies and chains. Upon executing we&amp;rsquo;re presented with:&lt;/p&gt;
&lt;pre tabindex="0"&gt;&lt;code&gt;1. Add Proxy
2. Delete Proxy
3. Add Chain
4. View Chain
5. Delete Chain
6. Exit
&lt;/code&gt;&lt;/pre&gt;&lt;p&gt;That resembles a typical heap challenge. It turns out to be one,
since the following structures are getting allocated dynamically:&lt;/p&gt;</description></item></channel></rss>