<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Crypto on unordered</title>
		<link>https://unorde.red/categories/crypto/</link>
		<description>Recent content in Crypto 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/crypto/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: 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>Hashwalk</title>
				<link>https://unorde.red/hashwalk/</link>
				<pubDate>Fri, 29 Sep 2017 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/hashwalk/</guid>
				<description>&lt;p&gt;&lt;a href=&#34;https://github.com/avanpo/hashwalk&#34;&gt;Hashwalk&lt;/a&gt; is an exercise in futility. It&#xA;attempts to mount a preimage attack on a cryptographic hash function by using&#xA;local search. This is essentially a poor man&amp;rsquo;s differential cryptanalysis.&lt;/p&gt;&#xA;&lt;p&gt;A good, general purpose cryptographic hash function should exhibit the avalanche&#xA;effect. This means that a small change in the input (e.g. a single bit flip)&#xA;results in a large change in the output (e.g. approximately half of the bits&#xA;being flipped). In other words, the function should be psuedorandom. A hash&#xA;function that isn&amp;rsquo;t psuedorandom is unsuitable for many cryptographic use cases,&#xA;since it may leak information on the data being hashed.&lt;/p&gt;</description>
			</item>
			<item>
				<title>What is Diffie-Hellman?</title>
				<link>https://unorde.red/what-is-diffie-hellman/</link>
				<pubDate>Tue, 15 Mar 2016 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/what-is-diffie-hellman/</guid>
				<description>&lt;p&gt;&lt;em&gt;This article assumes knowledge of basic group theory, and basic asymptotic complexity (big O notation).&lt;/em&gt;&lt;/p&gt;&#xA;&lt;p&gt;For efficiency reasons, most encryption used on the internet and elsewhere is done using symmetric-key algorithms. A symmetric key algorithm uses one key for both encryption and decryption. This requires the sender and receiver to share knowledge of a secret key. For two parties who have never communicated securely before, this is a non-trivial problem. How does one establish a shared secret using insecure channels? This is where a key exchange algorithm like Diffie-Hellman comes in.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
