<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Dragon_warrior on Medium]]></title>
        <description><![CDATA[Stories by Dragon_warrior on Medium]]></description>
        <link>https://medium.com/@Dragon_warrior?source=rss-bbfa03f54be3------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*FAAUcJ1v-74Mv3EbHlrh9A.jpeg</url>
            <title>Stories by Dragon_warrior on Medium</title>
            <link>https://medium.com/@Dragon_warrior?source=rss-bbfa03f54be3------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Tue, 17 Nov 2026 12:28:55 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@Dragon_warrior/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Hackerverse July CTF: A Fun Deep Dive]]></title>
            <link>https://medium.com/@Dragon_warrior/hackerverse-july-ctf-a-fun-deep-dive-8d2653089820?source=rss-bbfa03f54be3------2</link>
            <guid isPermaLink="false">https://medium.com/p/8d2653089820</guid>
            <category><![CDATA[cryptography]]></category>
            <category><![CDATA[catch-the-flag]]></category>
            <category><![CDATA[cybersecurity]]></category>
            <category><![CDATA[ec-council-hackerverse]]></category>
            <category><![CDATA[digital-forensics]]></category>
            <dc:creator><![CDATA[Dragon_warrior]]></dc:creator>
            <pubDate>Wed, 30 Jul 2025 14:09:51 GMT</pubDate>
            <atom:updated>2025-07-30T17:10:41.226Z</atom:updated>
            <content:encoded><![CDATA[<h3>Hackerverse July CTF Writeup: A Fun Deep Dive</h3><p>What’s up, world! We are (<a href="https://medium.com/u/3e43c680c05f">Deepak</a>)<strong>Debug4n6</strong> and (<a href="https://medium.com/u/bbfa03f54be3">Dragon_warrior</a>) <strong>Dragon_warrior</strong>, two cybersecurity grad students who just survived and conquered the <a href="https://www.hackerverse.com/">Hackerverse July CTF</a> by EC-Council. Huge thanks to EC-Council for creating this awesome platform where whether you’re a beginner, currently learning, or a seasoned professional, It meets you at your level.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/711/1*V12m396PT93pY5QgAGvfjQ.png" /></figure><p>This month’s competition was a killer mix of cryptography, digital forensics, and some seriously tricky OSINT that had us digging through everything from Russian literature to Morse code signals.</p><p>It was a marathon of a late night and that unbeatable rush of cracking a tough challenge. Here’s our detailed breakdown of how we pwned the key challenges. Let’s dive in.</p><h3>🔥 Warm Up Question 1: ROT Cipher Shenanigans</h3><p>The CTF started with a classic crypto puzzle. We were given a scrambled string that looked like pure gibberish.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*12GjDC0L8KRKenpK" /></figure><pre>jvmve kyivv wfli qvif wzmv vzxyk knf fev jzo wfli</pre><p>Our immediate instinct was that this was a substitution cipher, most likely a <strong>Caesar or ROT cipher</strong>, where each letter is simply shifted down the alphabet. Instead of solving it manually, we turned to our favorite online crypto tool, <strong>Dcode.fr</strong>, to speed things up.</p><p>We pasted the string into its ROT cipher decoder, and after cycling through the possibilities, <strong>ROT-17</strong> unscrambled the message perfectly into a string of numbers.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*axOVKJWR1gqfm-HP" /></figure><p>It was a great way to warm up our crypto-solving muscles.</p><h4>Final Answer</h4><pre>seven three four zero five eight two one six four</pre><p><strong>Lessons Learned:</strong> Always start with the simple ciphers. Automating with tools like Dcode.fr saves time and prevents manual errors.</p><h3>🔐 Warm Up Question 2: Adventures in Binary Reverse Engineering!</h3><p>Next, we were handed a file named binary1. This was a classic reverse engineering challenge. Our process for tackling binaries is a systematic two-stage attack.</p><p>First, basic reconnaissance. We used the file command to identify what we were up against.</p><pre>file binary1</pre><pre>binary1: ELF 64-bit LSB executable, x86-64, dynamically linked</pre><p>It was a standard 64-bit Linux executable, exactly what we hoped for. Next, we used the strings command to hunt for any readable text hardcoded into the binary.</p><pre>strings binary1 | grep -i &quot;password&quot;</pre><p>This gave us some juicy clues, confirming the program’s purpose.</p><pre>Enter the password:<br>Correct password!<br>Incorrect password. Try again!<br>verify_password</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/825/0*SSiO2RPzNB1nDw2o" /></figure><p>With recon done, it was time for the deep dive. We used objdump to disassemble the binary and inspect its assembly code, focusing on the verify_password function.</p><pre>objdump -d binary1 | less</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/866/0*R6YzYCpCP2qRQYx4" /></figure><p>Inside the function, we found the core logic. The program was performing an <strong>XOR operation</strong> on our input using the hex key 0x42 and comparing the result against two hardcoded values (0x673a257671212f28 and 0x3131122d140d2d2d).</p><p>To find the password, all we had to do was reverse the process. We wrote a quick Python script to XOR the hardcoded values back with the key.</p><pre>import struct<br># The encrypted values found in the assembly<br>magic1 = 0x673a257671212f28<br>magic2 = 0x3131122d140d2d2d<br>magic_bytes = struct.pack(&#39;&lt;Q&#39;, magic1) + struct.pack(&#39;&lt;Q&#39;, magic2)<br># Reverse the XOR operation to get the original password<br>password = &#39;&#39;.join(chr(b ^ 0x42) for b in magic_bytes)<br>print(password)</pre><p>The script revealed the password. We tested it to confirm, and the binary surrendered its flag.</p><h4>Final Answer</h4><pre>jmc34gx%ooOVoPss</pre><p><strong>Lessons Learned:</strong> A methodical approach (file -&gt; strings -&gt; objdump) is key for reverse engineering. XOR remains a favorite trick for CTF creators.</p><h3>🍅 Warm Up Round 2 Question 1: Cracking Open a Zipped Mystery</h3><p>This challenge presented us with a password-protected archive, p1.zip. Our go-to tool for this is the legendary password cracker, <strong>John the Ripper</strong>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*kMYefhcz4cT5w08z" /><figcaption>Verify whether it is really a zip file: Basic Reconnaissance</figcaption></figure><p>First, we needed to extract the password hash from the zip file into a format John could understand. The zip2john utility is perfect for this.</p><pre>zip2john p1.zip &gt; p1.hash</pre><p>With the hash file p1.hash created, we unleashed John on it using a common password list.</p><pre>john --show p1.hash</pre><p>In a matter of seconds, John cracked it.</p><pre>p1.zip/flag.txt:tomatoes:flag.txt:p1.zip::p1.zip</pre><p>The password was, amusingly, tomatoes. With our vegetable-themed key, we easily extracted the flag.txt file.</p><pre>unzip -P tomatoes p1.zip</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*ORHTVEGIkbmrrJ86" /></figure><h4>Final Answer</h4><pre>CTF{TomatoMan}</pre><p><strong>Lessons Learned:</strong> Every CTF player needs password cracking tools like John the Ripper in their arsenal. And sometimes, the password is much sillier than you’d expect.</p><h3>☕ Round 4: Warm Up 1 Java, JARs, and a Password with Bite!</h3><p>Here, we received a Java Archive file, c1.jar.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*l06rnQcFa_R8vcnh" /></figure><p>Since JARs are essentially zip files, our first step was to extract its contents.</p><pre>unzip c1.jar</pre><p>This revealed the compiled Java bytecode file, a.class, which contained the program&#39;s logic. To understand it, we needed to decompile it back into human-readable Java source code. We used <strong>CFR</strong>, a powerful and reliable Java decompiler.</p><pre>java -jar cfr.jar c1/a.class --outputdir c1_out</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*9lbfNJsx42s7-NPy" /></figure><p>Opening the resulting c1_out/a.java file, we immediately noticed a hardcoded integer array.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*R3sr55GjrCERuWY_" /></figure><pre>private static int[] a = new int[]{121, 37, 114, 122, 34, 99, 32, 127, 118};</pre><p>This was a huge red flag. Analyzing the code further, we saw that it was comparing this array to the user’s input after each character had been <strong>XORed with the number 17</strong>. To find the password, we just had to reverse this logic. Another simple Python script did the trick.</p><pre>c = [121, 37, 114, 122, 34, 99, 32, 127, 118]<br>password = &quot;&quot;.join(chr(x ^ 17) for x in c)<br>print(password)</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/377/0*s2DpjHUq4bnTBviH" /></figure><p>The script printed the correct password.</p><p>We run the program and feed the password to verify</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/401/0*7P5lqYnFLAnyylMZ" /></figure><h4>Final Answer</h4><pre>h4ck3r1ng</pre><p><strong>Lessons Learned:</strong> Decompilers are essential for reversing applications written in languages like Java. Hardcoded arrays are almost always a clue.</p><h3>🌳 Round 5: Detective Work The Case of the Famous Fallen</h3><p>This challenge shifted to <strong>Open-Source Intelligence (OSINT)</strong>. We were given coordinates (54°59&#39;32.7&quot;N 2°23&#39;21.7&quot;W) and a timeframe (2020–2025) and asked to identify a famous non-human “victim.”</p><p>Our first step was to plug the coordinates into Google Maps. This dropped us in Northumberland National Park, UK, right next to Hadrian’s Wall. The location was unmistakable: <strong>Sycamore Gap</strong>, home to the iconic “Robin Hood Tree.”</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*lE4Vi4h8f6UE9vy8" /></figure><p>Knowing the location and the prompt’s mention of a “tragedy,” we performed a quick web search for “Sycamore Gap tragedy 2023.” The search results were filled with news articles about how the famous tree was tragically and illegally felled in September 2023.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*qGVRXD0Yxy0cXMea" /></figure><p>This event fit all the criteria: it was a tragedy involving a famous living thing (but not human) at the correct location and within the specified timeframe.</p><h4>Final Answer</h4><p>Sycamore Gap Tree</p><p><strong>Lessons Learned:</strong> OSINT challenges are about connecting disparate pieces of information. Combining geolocation with targeted keyword searches is an incredibly powerful technique.</p><h3>🗺️ Round 5: Geo Guesser &amp; The Travelling Hackers</h3><p>These two challenges were rapid-fire OSINT tests based on images.</p><ul><li><strong>Big Macs &amp; Colonial Mansions:</strong> We were shown a picture of a McDonald’s inside a beautiful, ornate colonial mansion. A quick <strong>Google Reverse Image Search</strong> immediately identified the location as the <strong>Birch House</strong> in George Town, Malaysia.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*X17Y_-PAGH0eucm-" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*jRmvfTCg-sPddWjF" /></figure><ul><li><strong>The Travelling Hackers:</strong> The next image was of a large, modern yacht. Again, a reverse image search was all it took. Google identified it as the <strong>Sunborn</strong> London, a unique luxury yacht hotel permanently moored in Royal Victoria Dock.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*ppT-Fp31J8Im3N-S" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*5HefstFhjGNLkCDM" /></figure><h4>Final Answers</h4><ul><li>Birch House</li><li>Sunborn</li></ul><p><strong>Lessons Learned:</strong> For any challenge involving an unknown image, a reverse image search should be your first and often final step. It’s fast, easy, and incredibly effective.</p><h3>🎧 Round 5: Не говорю по-английски The Russian Lit Puzzle</h3><p>This was a fascinating audio forensics challenge. We were given no_english.mp3 and a prompt in Russian asking which woman the message was associated with.</p><p>After translating the prompt, we analyzed the MP3. It contained a dramatic reading of a sentence in Russian. We used an online audio-to-text transcriber to get the text:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*fJQPFgyOrBuvoh5a" /></figure><pre>Все счастливые семьи похожи друг на друга, каждая несчастливая семья несчастлива по-своему.</pre><p>A quick search for this phrase revealed it’s the legendary opening line of Leo Tolstoy’s novel, <strong>“Anna Karenina”</strong>: <em>“All happy families are alike; each unhappy family is unhappy in its own way.”</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*yP-m6GH-o_8s7zJK" /></figure><p>The woman associated with this iconic message is, of course, the book’s titular character.</p><h4>Final Answer</h4><p>Анна Каренина</p><p><strong>Lessons Learned:</strong> Forensics isn’t just about code and data; it can involve culture and language too. Don’t be afraid to use translators and search engines to bridge knowledge gaps.</p><h3>🛰️ Round 5: The First Contact &amp; The Buzzer Audio Signal Double Feature</h3><p>The final two challenges were a brilliant pair of audio signal puzzles.</p><h4>Part 1: The First Contact</h4><p>We got signal.mp3 and a password-protected flag.zip. The name &quot;signal&quot; immediately suggested <strong>Morse Code</strong>. We wrote a Python script using pydub and numpy to analyze the audio, measuring the duration of beeps (sound) and silences. We classified short beeps as dots and long beeps as dashes, which allowed us to decode the message:</p><p>THE PASSWORD FOR THE ZIP FILE IS ONE FOUR SIX EIGHT TWO ZERO FIVE TWO TWO FOUR</p><p>The password was 1468205224. We used it to unlock the zip file and claim the flag.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/940/0*NJCNXiQkG2UcYcGr" /></figure><h4>Final Answer (First Contact)</h4><pre>CTF{FIRST_ENCOUNTER}</pre><h4>Part 2: The Buzzer</h4><p>This challenge gave us signal2.mp3. We ran it through the same Morse decoding script, but this time it produced a long string of unintelligible ciphertext:</p><p>GVTREUNZFGRERYRCUNAGSEBTYRZHENAGRYBCRTBEVYYNVTHNANFANXRCVTNYYVTNGBECRATHVANNEQINEXLNXNEZNQVYYB</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/988/0*v-pAoHB3l41PtI9k" /></figure><p>This looked like another substitution cipher. On a hunch, we applied <strong>ROT13</strong>, the simple cipher that shifts letters by 13 places. The gibberish instantly transformed into a list of animals:</p><p>TIGER HAMSTER ELEPHANT FROG LEMUR ANTELOPE GORILLA IGUANA SNAKE PIG ALLIGATOR PENGUIN AARDVARK YAK ARMADILLO</p><p>We were momentarily confused until we saw the final layer of the puzzle: it was an <strong>acrostic</strong>. Taking the first letter of each animal spelled out a new message: THEFLAGISPAPAYA.</p><h4>Final Answer (The Buzzer)</h4><pre>PAPAYA</pre><p><strong>Lessons Learned:</strong> CTF challenges often have multiple layers. If your first decryption results in more gibberish, look for another layer of encoding. Always keep an eye out for patterns, from Morse code to acrostics.</p><p><strong>Final Thoughts:</strong> This CTF was a blast. We hit almost every category, from deep-dive reversing to quick-and-dirty OSINT. <strong>We left a few challenges on the table</strong>, but hey, there’s always next month! Huge thanks to the Hackerverse crew for putting this on.</p><p>Until next time, keep your terminals open and your coffee hot.</p><p>Debug4n6(<a href="https://medium.com/u/3e43c680c05f">Deepak</a>) and Dragon_warrior(<a href="https://medium.com/u/bbfa03f54be3">Dragon_warrior</a>) Signing off!✌️</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=8d2653089820" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>