<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Ctf on unordered</title>
		<link>https://unorde.red/categories/ctf/</link>
		<description>Recent content in Ctf on unordered</description>
		<generator>Hugo</generator>
		<language>en-US</language>
		
		
		
		
			<lastBuildDate>Mon, 12 Oct 2020 00:00:00 +0000</lastBuildDate>
		
			<atom:link href="https://unorde.red/categories/ctf/feed.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>DamCTF: crypto/guess-secret</title>
				<link>https://unorde.red/damctf-crypto-guess-secret/</link>
				<pubDate>Mon, 12 Oct 2020 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/damctf-crypto-guess-secret/</guid>
				<description>&lt;p&gt;This challenge asks us to break a &amp;lsquo;super secure and efficient communication&#xA;method&amp;rsquo;. It also gives us the server code, although this isn&amp;rsquo;t really&#xA;necessary&amp;mdash;the server itself tells us all we need to know.&lt;/p&gt;&#xA;&lt;p&gt;The server explains in detail what it does. It accepts a string, and creates the&#xA;plaintext by concatenating it to the flag. The plaintext is then compressed&#xA;using the lossless deflate (zlib) algorithm. Lastly, the compressed data is&#xA;encrypted using AES_CTR_128. The resulting ciphertext is returned to us.&lt;/p&gt;</description>
			</item>
			<item>
				<title>RedpwnCTF: mallcop</title>
				<link>https://unorde.red/redpwnctf-mallcop/</link>
				<pubDate>Sat, 17 Aug 2019 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/redpwnctf-mallcop/</guid>
				<description>&lt;p&gt;Mallcop was the least-solved challenge in the Misc category. We were given a&#xA;zipped file of 20 problem instances. The server gives us the following problem&#xA;description:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; class=&#34;chroma&#34;&gt;&lt;code class=&#34;language-txt&#34; data-lang=&#34;txt&#34;&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;Sick of Chick-fil-A, Daniel&amp;#39;s son deserts him to make a break for the parking&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;lot. (Un?)fortunately, Max the Mall Cop is here to help!  The n stores in the&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;mall are connected by walkways such that none of them form a cycle; in other&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;words, there is exactly one path from one store to another. Daniel&amp;#39;s son was&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;last seen at store k.  Stores connected to only one store lead to a parking lot.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;Max the Mall Cop decides to station his miniature clones at some of these&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;parking lot stores.  Every minute, Daniel&amp;#39;s son and the miniature Maxes can move&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;one meter towards an adjacent store or stay put. Daniel&amp;#39;s son is caught when he&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;coincides with a miniature Max at a store or a walkway.  What is the minimum&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;number of miniature Maxes that Max the Mall Cop should station to ensure that&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;Daniel&amp;#39;s son cannot reach a parking lot?&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;Input:&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    First line: n, k&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    Next n-1 lines: a, b, x indicating a walkway between stores a and b with&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;        length x meters&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;Output:&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    One line with the minimum miniature Maxes needed.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;Download the testcases from in.zip and enter your output here.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;The server has us give the answer to each of the 20 instances one at a time, and&#xA;then disconnects us without giving any information if we got it wrong.&lt;/p&gt;</description>
			</item>
			<item>
				<title>RedpwnCTF: Alien Transmissions</title>
				<link>https://unorde.red/redpwnctf-alien-transmissions/</link>
				<pubDate>Fri, 16 Aug 2019 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/redpwnctf-alien-transmissions/</guid>
				<description>&lt;p&gt;This was one of the higher scoring challenges I completed. We&amp;rsquo;re given the&#xA;following description:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; class=&#34;chroma&#34;&gt;&lt;code class=&#34;language-txt&#34; data-lang=&#34;txt&#34;&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;Brownie plugged his USB stick in, ready to take a look at the alien&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;transmissions he had received. However, when he opened the document, he&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;discovered that it was all encrypted! Brownie remembered overhearing Tux&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;bragging about a 38 character xor key, and realized that he must have encrypted&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;his document. Help Brownie find the key to decrypt the transmissions!&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;The transmission list is formatted as a list of strings delimited by ։. Here&amp;#39;s&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;an example list: /Z։Tk8V։gF։ue3T։dae9#&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;Note: ։ is not the regular English colon.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;The description pretty much gives it away. We&amp;rsquo;re looking at a simple XOR cipher&#xA;with a 38 character key. The key insight here is that every 38th character will&#xA;be XORed with the same char. Combining all of these characters into a string&#xA;allows you to do frequency analysis and hopefully recover the char. Rinse and&#xA;repeat to get the whole key and decrypt the message.&lt;/p&gt;</description>
			</item>
			<item>
				<title>OverTheWire: Bandit</title>
				<link>https://unorde.red/overthewire-bandit/</link>
				<pubDate>Sat, 10 Jun 2017 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/overthewire-bandit/</guid>
				<description>&lt;p&gt;Today I finished the Bandit wargame at &lt;a href=&#34;https://overthewire.org&#34;&gt;OverTheWire&lt;/a&gt;.&#xA;It was a lot of fun! It&amp;rsquo;s aimed at players looking to become familiar with the&#xA;command line and basic linux tooling. I got to use a lot of utilities from&#xA;coreutils that I didn&amp;rsquo;t even know existed.&lt;/p&gt;&#xA;&lt;p&gt;I was familiar with nearly all of the concepts touched on in the levels. Despite&#xA;this, I still managed to get stuck several times. Understanding the concepts on&#xA;a higher level often isn&amp;rsquo;t enough &amp;ndash; sometimes you really need to understand the&#xA;utility intimately to get the job done. Reading man pages is good for you.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Microcorruption CTF: Hollywood</title>
				<link>https://unorde.red/microcorruption-ctf-hollywood/</link>
				<pubDate>Sun, 20 Dec 2015 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/microcorruption-ctf-hollywood/</guid>
				<description>&lt;p&gt;This is my writeup for &amp;ldquo;Hollywood&amp;rdquo;, the very last level on the &lt;a href=&#34;https://microcorruption.com&#34;&gt;Microcorruption&lt;/a&gt; CTF. Like usual, if you haven&amp;rsquo;t already solved it or given it your very best shot, you should stop reading and go do that now. This level doesn&amp;rsquo;t have any clever tricks, it just takes perseverance.&lt;/p&gt;&#xA;&lt;h2 id=&#34;intro&#34;&gt;Intro&lt;/h2&gt;&#xA;&lt;p&gt;The introduction text reveals two things. One is randomization, and the second is that there are no hardware modules attached. If this lock is to open using a valid password, it means that the password is checked within the binary, and thus the password must also exist somewhere in the binary. All we have to do is reverse engineer until we find it. Of course, some previous locks lacked legitimate means of opening them, but given the obvious theme of this level, I figured it was probably safe to assume the password existed somewhere.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Microcorruption CTF: Chernobyl</title>
				<link>https://unorde.red/microcorruption-ctf-chernobyl/</link>
				<pubDate>Fri, 18 Dec 2015 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/microcorruption-ctf-chernobyl/</guid>
				<description>&lt;p&gt;This is my writeup for &amp;ldquo;Chernobyl&amp;rdquo;, the second to last level on the &lt;a href=&#34;https://microcorruption.com&#34;&gt;Microcorruption&lt;/a&gt; CTF. Like usual, if you haven&amp;rsquo;t already solved it or given it your very best shot, you should stop reading and go do that now.&lt;/p&gt;&#xA;&lt;h2 id=&#34;the-input&#34;&gt;The input&lt;/h2&gt;&#xA;&lt;p&gt;This binary is pretty big compared to previous levels. There&amp;rsquo;s a lot more functionality, and I spent a fair bit of time getting acquainted with the program.&lt;/p&gt;&#xA;&lt;p&gt;I first stepped through some test inputs to see what was going on. The first character is tested against 0x61, or &amp;lsquo;a&amp;rsquo;, and then against &amp;rsquo;n&amp;rsquo;. A bit more digging revealed the following information:&lt;/p&gt;</description>
			</item>
			<item>
				<title>Microcorruption CTF: Lagos</title>
				<link>https://unorde.red/microcorruption-ctf-lagos/</link>
				<pubDate>Tue, 15 Dec 2015 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/microcorruption-ctf-lagos/</guid>
				<description>&lt;p&gt;This is my writeup for the &amp;ldquo;Lagos&amp;rdquo; level in the &lt;a href=&#34;https://microcorruption.com&#34;&gt;Microcorruption&lt;/a&gt; CTF. It goes through my (naive) thought process and my initial solution. If you haven&amp;rsquo;t already solved it or given it your best shot, you should probably stop reading and do that first.&lt;/p&gt;&#xA;&lt;h2 id=&#34;the-filter&#34;&gt;The filter&lt;/h2&gt;&#xA;&lt;p&gt;This level takes your input from the heap, and filters out non-alphanumeric characters before copying them to the stack. As soon as a non-alphanumeric character is reached, the copying stops. There is a familiar &lt;code&gt;conditional_unlock_door&lt;/code&gt; function that uses the &lt;code&gt;INT 0x7E&lt;/code&gt; interrupt. It also uses &lt;code&gt;memset&lt;/code&gt; to wipe the heap clean before testing the password copied to the stack. The overflow is potentially quite large, as up to 0x200 characters are taken as input.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Microcorruption CTF: Bangalore</title>
				<link>https://unorde.red/microcorruption-ctf-bangalore/</link>
				<pubDate>Mon, 14 Dec 2015 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/microcorruption-ctf-bangalore/</guid>
				<description>&lt;p&gt;This is my writeup for the &amp;ldquo;Bangalore&amp;rdquo; level on the &lt;a href=&#34;https://microcorruption.com&#34;&gt;Microcorruption&lt;/a&gt; CTF. If you haven&amp;rsquo;t already solved it or given it your best shot, you should probably stop reading and go do that first.&lt;/p&gt;&#xA;&lt;p&gt;This level introduces the concept of DEP, or Data Execution Prevention. You can read a lot about DEP elsewhere, but the gist of it is in the name&amp;mdash;it prevents instructions from being executed in certain areas of memory. So simply injecting and running your favorite shellcode will no longer work, if that area of memory is marked as non-executable. We will have to find a way around DEP. Let&amp;rsquo;s check the Lock Manual for the specifics.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
