<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>binary on Asa&#39;s Website</title><link>https://ahessmat.netlify.com/tags/binary/</link><description>Recent content in binary on Asa&#39;s Website</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Sun, 18 Apr 2021 05:24:13 +0000</lastBuildDate><atom:link href="https://ahessmat.netlify.com/tags/binary/index.xml" rel="self" type="application/rss+xml"/><item><title>PicoCTF 2021 Writeup: Stonks</title><link>https://ahessmat.netlify.com/post/2021-04-picoctf-2021-writeup-stonks/</link><pubDate>Sun, 18 Apr 2021 05:24:13 +0000</pubDate><guid>https://ahessmat.netlify.com/post/2021-04-picoctf-2021-writeup-stonks/</guid><description>Preamble The Stonks problem was a binary exploitation problem set out by the PicoCTF 2021 competition. This problem featured a variety of techniques that I hadn&amp;rsquo;t used before and introduced me to some new tools to consider in the future.
The problem may be accessed here for those interested.
This problem provided a source code file - vuln.c - and a compiled version accessible via netcat. Ultimately, as the attacker we are meant to evaluate the source code to identify a vulnerability; once the vulnerability is discovered, we should exploit it on the compiled version in order to achieve the flag (format: picoCTF{&amp;hellip;}).</description></item></channel></rss>