<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Decoding the Verizon DBIR 2009 Cover</title>
	<atom:link href="http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/</link>
	<description>Application security testing, analysis, and metrics</description>
	<lastBuildDate>Thu, 09 Feb 2012 11:59:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Allison Ego</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-5903</link>
		<dc:creator>Allison Ego</dc:creator>
		<pubDate>Mon, 17 Jan 2011 20:53:11 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-5903</guid>
		<description>I like the valuable info you provide in your articles. I’ll bookmark your blog and check again here frequently. I&#039;m quite sure I’ll learn many new stuff right here! Best of luck for the next!</description>
		<content:encoded><![CDATA[<p>I like the valuable info you provide in your articles. I’ll bookmark your blog and check again here frequently. I&#8217;m quite sure I’ll learn many new stuff right here! Best of luck for the next!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Psst, psst! A clue to Verizon data breach report challenge &#124; ZDNet</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-5562</link>
		<dc:creator>Psst, psst! A clue to Verizon data breach report challenge &#124; ZDNet</dc:creator>
		<pubDate>Wed, 11 Aug 2010 19:25:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-5562</guid>
		<description>[...] year, after I dropped a big clue on Threapost, Grant Stavely, Chris Eng and others decoded the hidden message on the cover of the report in record [...]</description>
		<content:encoded><![CDATA[<p>[...] year, after I dropped a big clue on Threapost, Grant Stavely, Chris Eng and others decoded the hidden message on the cover of the report in record [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: haxor</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-2718</link>
		<dc:creator>haxor</dc:creator>
		<pubDate>Mon, 04 May 2009 18:18:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-2718</guid>
		<description>Lame encryption.</description>
		<content:encoded><![CDATA[<p>Lame encryption.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Breaking good</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-2712</link>
		<dc:creator>Breaking good</dc:creator>
		<pubDate>Sun, 03 May 2009 21:32:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-2712</guid>
		<description>[...] really like Chris Eng&#039;s post on how he broke the code on the cover of the 2009 Verizon Data Breach Investigations Report. He [...]</description>
		<content:encoded><![CDATA[<p>[...] really like Chris Eng&#8217;s post on how he broke the code on the cover of the 2009 Verizon Data Breach Investigations Report. He [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: isaac dawson</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-2710</link>
		<dc:creator>isaac dawson</dc:creator>
		<pubDate>Sun, 03 May 2009 16:32:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-2710</guid>
		<description>Hey Chris,
Enjoyed the quick write up on the steps you took to crack it. After you got to the part where you realized it was a Vigenere cipher and started explaining how that works, I realized a SSO implementation I tested a little while back was the same type of algorithm! However, I had the luxury of an encryption oracle and could just choose the plaintext I wanted encrypted ;&gt;. 
Hope things are going well with you,
^isaac</description>
		<content:encoded><![CDATA[<p>Hey Chris,<br />
Enjoyed the quick write up on the steps you took to crack it. After you got to the part where you realized it was a Vigenere cipher and started explaining how that works, I realized a SSO implementation I tested a little while back was the same type of algorithm! However, I had the luxury of an encryption oracle and could just choose the plaintext I wanted encrypted ;&gt;.<br />
Hope things are going well with you,<br />
^isaac</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Erzengel</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-2708</link>
		<dc:creator>Erzengel</dc:creator>
		<pubDate>Fri, 01 May 2009 16:46:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-2708</guid>
		<description>Your final solution (guess the word and work back from there) reminds me of what I did when &quot;Order Of The Stick&quot; (a webcomic) had a character (Haley) whose brain broke and so she ended up talking in cypher garbage. I guessed that it was cypher (Belkar, another character, later confirmed it in a 4th wall break), and started, much as you did, with Caesar shifts, but when that failed I tried frequency analysis but didn&#039;t really come up with much from such a small sample size. So I just guessed what she might be saying, based upon what was happening, and found the substitution cypher that way. Then the author changed the cypher on the next comic, with an even smaller sample size, so I kind of gave up. I&#039;m not a cryptographer, though, so I don&#039;t exactly have the tools or knowledge you do at figuring these out.</description>
		<content:encoded><![CDATA[<p>Your final solution (guess the word and work back from there) reminds me of what I did when &#8220;Order Of The Stick&#8221; (a webcomic) had a character (Haley) whose brain broke and so she ended up talking in cypher garbage. I guessed that it was cypher (Belkar, another character, later confirmed it in a 4th wall break), and started, much as you did, with Caesar shifts, but when that failed I tried frequency analysis but didn&#8217;t really come up with much from such a small sample size. So I just guessed what she might be saying, based upon what was happening, and found the substitution cypher that way. Then the author changed the cypher on the next comic, with an even smaller sample size, so I kind of gave up. I&#8217;m not a cryptographer, though, so I don&#8217;t exactly have the tools or knowledge you do at figuring these out.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chris Eng</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-2705</link>
		<dc:creator>Chris Eng</dc:creator>
		<pubDate>Thu, 30 Apr 2009 18:41:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-2705</guid>
		<description>@Nate: Yeah, I think that&#039;s the approach that this &lt;a href=&quot;http://islab.oregonstate.edu/koc/ece575/02Project/Mun+Lee/VigenereCipher.html&quot; rel=&quot;nofollow&quot;&gt;Vigenere brute force applet&lt;/a&gt; implements (the one Grant Stavely found and used to &lt;a href=&quot;http://grantstavely.com/how-i-decoded-the-verizon-2009-dbir-cover&quot; rel=&quot;nofollow&quot;&gt;win the contest&lt;/a&gt;).  I was surprised to see just how effective that method was, considering the relatively small sample size of 900 characters.  I don&#039;t quite understand why the dot products work, though I&#039;m sure it would become more apparent with a little experimentation.</description>
		<content:encoded><![CDATA[<p>@Nate: Yeah, I think that&#8217;s the approach that this <a href="http://islab.oregonstate.edu/koc/ece575/02Project/Mun+Lee/VigenereCipher.html" rel="nofollow">Vigenere brute force applet</a> implements (the one Grant Stavely found and used to <a href="http://grantstavely.com/how-i-decoded-the-verizon-2009-dbir-cover" rel="nofollow">win the contest</a>).  I was surprised to see just how effective that method was, considering the relatively small sample size of 900 characters.  I don&#8217;t quite understand why the dot products work, though I&#8217;m sure it would become more apparent with a little experimentation.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nate</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-2704</link>
		<dc:creator>Nate</dc:creator>
		<pubDate>Thu, 30 Apr 2009 17:53:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-2704</guid>
		<description>Nice work, Chris. While this kind of cipher does level out the frequency of individual characters, it only reduces the distance between the least and most frequent letters, it doesn&#039;t eliminate the variation. This is because each group of ciphertext characters (where group is determined by the length of the key) is dependent on the same key bits as every other group. So a quick way to solve it is to first find the length of the key by breaking the message up into sets of regular groups and then doing frequency analysis between the groups with the index of coincidence (freq count of pairs or triplets, etc).</description>
		<content:encoded><![CDATA[<p>Nice work, Chris. While this kind of cipher does level out the frequency of individual characters, it only reduces the distance between the least and most frequent letters, it doesn&#8217;t eliminate the variation. This is because each group of ciphertext characters (where group is determined by the length of the key) is dependent on the same key bits as every other group. So a quick way to solve it is to first find the length of the key by breaking the message up into sets of regular groups and then doing frequency analysis between the groups with the index of coincidence (freq count of pairs or triplets, etc).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alex</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-2684</link>
		<dc:creator>Alex</dc:creator>
		<pubDate>Tue, 28 Apr 2009 22:52:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-2684</guid>
		<description>@ Jebediah - actually, that was the first thing we thought of.  Unfort. using a brand name would be problematic.</description>
		<content:encoded><![CDATA[<p>@ Jebediah &#8211; actually, that was the first thing we thought of.  Unfort. using a brand name would be problematic.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jebediah Webb</title>
		<link>http://www.veracode.com/blog/2009/04/decoding-the-dbir-2009-cover/comment-page-1/#comment-2668</link>
		<dc:creator>Jebediah Webb</dc:creator>
		<pubDate>Mon, 27 Apr 2009 21:44:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=729#comment-2668</guid>
		<description>I was really wishing it has said &quot;Be sure to drink your Ovaltine&quot;....</description>
		<content:encoded><![CDATA[<p>I was really wishing it has said &#8220;Be sure to drink your Ovaltine&#8221;&#8230;.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

