<?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"
	>
<channel>
	<title>Comments on: Magic bullet</title>
	<atom:link href="http://www.achingbrain.net/alex/magic-bullet/feed" rel="self" type="application/rss+xml" />
	<link>http://www.achingbrain.net/alex/magic-bullet</link>
	<description>Not just another WordPress weblog</description>
	<pubDate>Wed, 20 Aug 2008 12:29:42 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5</generator>
		<item>
		<title>By: Alex</title>
		<link>http://www.achingbrain.net/alex/magic-bullet#comment-316</link>
		<dc:creator>Alex</dc:creator>
		<pubDate>Wed, 22 Nov 2006 23:08:58 +0000</pubDate>
		<guid isPermaLink="false">http://wordpress/blog/alex/magic-bullet#comment-316</guid>
		<description>My knowledge of cryptography is very good.  I learned it from a book.

Heh, no, actually the book that Katherine links to really is very good.  Great narrative without getting too technical - excellent holiday reading.  Much like &lt;a href="http://www.amazon.co.uk/Search-Schrodingers-Cat-John-Gribbin/dp/0552125555/sr=8-1/qid=1164231909/ref=sr_1_1/203-1070895-7701567?ie=UTF8&#038;s=books"&gt;In search of Schrodinger's cat&lt;/a&gt; if quantum theory is your thing.

Anyway, the point I was trying to make is that the key itself is not necessarily the weakest link in the chain.

As a trite example, the Caesar Cypher is a simple encryption technique that moves each letter along the alphabet by a set number - that number being the key.  So with a key of two, a becomes c, j becomes l, etc.  The problem here is that it's very vulnerable to frequency analysis in that given a large enough body of encrypted text, replacing the most common encrypted letter with e and so on will usually either reveal the plain text or enough of it to guess the rest.

Finding these sorts of shortcuts is usually how encryption methods are broken.</description>
		<content:encoded><![CDATA[<p>My knowledge of cryptography is very good.  I learned it from a book.</p>
<p>Heh, no, actually the book that Katherine links to really is very good.  Great narrative without getting too technical - excellent holiday reading.  Much like <a href="http://www.amazon.co.uk/Search-Schrodingers-Cat-John-Gribbin/dp/0552125555/sr=8-1/qid=1164231909/ref=sr_1_1/203-1070895-7701567?ie=UTF8&#038;s=books">In search of Schrodinger&#8217;s cat</a> if quantum theory is your thing.</p>
<p>Anyway, the point I was trying to make is that the key itself is not necessarily the weakest link in the chain.</p>
<p>As a trite example, the Caesar Cypher is a simple encryption technique that moves each letter along the alphabet by a set number - that number being the key.  So with a key of two, a becomes c, j becomes l, etc.  The problem here is that it&#8217;s very vulnerable to frequency analysis in that given a large enough body of encrypted text, replacing the most common encrypted letter with e and so on will usually either reveal the plain text or enough of it to guess the rest.</p>
<p>Finding these sorts of shortcuts is usually how encryption methods are broken.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pierre</title>
		<link>http://www.achingbrain.net/alex/magic-bullet#comment-315</link>
		<dc:creator>Pierre</dc:creator>
		<pubDate>Wed, 22 Nov 2006 18:24:11 +0000</pubDate>
		<guid isPermaLink="false">http://wordpress/blog/alex/magic-bullet#comment-315</guid>
		<description>Without your knowledge of cryptography, I'd tend to agree with Katherine.  If the code has a key and if there is a pattern of whatever complexity to generate that key, or rather there is a specific way to use that key on a set of data to make sense of them, it's only a matter of time to crack it.  Even if it would take a universe-age length of time by random guessing alone, clever pattern recognition and sneaky "that one person is a liability" methods surely mean it will come out sooner or later.

It sounds a bit like burying your treasure deeper and deeper in the ground, only to find out that your enemies are buying bigger and bigger shovels...


: P</description>
		<content:encoded><![CDATA[<p>Without your knowledge of cryptography, I&#8217;d tend to agree with Katherine.  If the code has a key and if there is a pattern of whatever complexity to generate that key, or rather there is a specific way to use that key on a set of data to make sense of them, it&#8217;s only a matter of time to crack it.  Even if it would take a universe-age length of time by random guessing alone, clever pattern recognition and sneaky &#8220;that one person is a liability&#8221; methods surely mean it will come out sooner or later.</p>
<p>It sounds a bit like burying your treasure deeper and deeper in the ground, only to find out that your enemies are buying bigger and bigger shovels&#8230;</p>
<p>: P</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alex</title>
		<link>http://www.achingbrain.net/alex/magic-bullet#comment-314</link>
		<dc:creator>Alex</dc:creator>
		<pubDate>Mon, 20 Nov 2006 11:43:00 +0000</pubDate>
		<guid isPermaLink="false">http://wordpress/blog/alex/magic-bullet#comment-314</guid>
		<description>They are only a liability if you don't want anyone at all to read the code, in which case you might as well just delete it...

Anyway, you don't necessarily need the key to decrypt the data.  A lot of research into breaking encryption targets the actual encryption method rather than trying to figure out what the key is...</description>
		<content:encoded><![CDATA[<p>They are only a liability if you don&#8217;t want anyone at all to read the code, in which case you might as well just delete it&#8230;</p>
<p>Anyway, you don&#8217;t necessarily need the key to decrypt the data.  A lot of research into breaking encryption targets the actual encryption method rather than trying to figure out what the key is&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ktm</title>
		<link>http://www.achingbrain.net/alex/magic-bullet#comment-313</link>
		<dc:creator>ktm</dc:creator>
		<pubDate>Mon, 20 Nov 2006 09:59:03 +0000</pubDate>
		<guid isPermaLink="false">http://wordpress/blog/alex/magic-bullet#comment-313</guid>
		<description>Are there any unreakable codes?  If all codes have keys, and even if only one person has knowledge of the key, that one person is a liability - are there keyless codes?  Time to send of copy of &lt;a href="http://www.amazon.co.uk/Code-Book-Secret-History-Code-breaking/dp/1857028899/sr=8-1/qid=1164016559/ref=pd_ka_1/202-7428583-1520637?ie=UTF8&#038;s=books"&gt;The Code Book&lt;/a&gt; to the Home Office...</description>
		<content:encoded><![CDATA[<p>Are there any unreakable codes?  If all codes have keys, and even if only one person has knowledge of the key, that one person is a liability - are there keyless codes?  Time to send of copy of <a href="http://www.amazon.co.uk/Code-Book-Secret-History-Code-breaking/dp/1857028899/sr=8-1/qid=1164016559/ref=pd_ka_1/202-7428583-1520637?ie=UTF8&#038;s=books">The Code Book</a> to the Home Office&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: will</title>
		<link>http://www.achingbrain.net/alex/magic-bullet#comment-312</link>
		<dc:creator>will</dc:creator>
		<pubDate>Mon, 20 Nov 2006 06:25:43 +0000</pubDate>
		<guid isPermaLink="false">http://wordpress/blog/alex/magic-bullet#comment-312</guid>
		<description>And not just the government surely. Most hardware and software announcements claiming to be secure seem to get broken pretty quickly (Apple's iTunes DRM protection, DVD encryption,various wireless standards etc.)</description>
		<content:encoded><![CDATA[<p>And not just the government surely. Most hardware and software announcements claiming to be secure seem to get broken pretty quickly (Apple&#8217;s iTunes DRM protection, DVD encryption,various wireless standards etc.)</p>
]]></content:encoded>
	</item>
</channel>
</rss>
