<?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: x1masibhr</title>
	<atom:link href="http://robertsinclaire.com/2009/10/07/x1masibhr/feed/" rel="self" type="application/rss+xml" />
	<link>http://robertsinclaire.com/2009/10/07/x1masibhr/</link>
	<description>Life is complex.....simplify</description>
	<lastBuildDate>Sat, 04 Jun 2011 20:28:21 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Robert</title>
		<link>http://robertsinclaire.com/2009/10/07/x1masibhr/comment-page-1/#comment-412</link>
		<dc:creator>Robert</dc:creator>
		<pubDate>Fri, 23 Oct 2009 13:30:46 +0000</pubDate>
		<guid isPermaLink="false">http://robertsinclaire.com/?p=1583#comment-412</guid>
		<description>I will not post it here, however, if you really want to know I will email it to you. :) It&#039;s a poly-alphabetic substitution cipher. I read a fantastic book years ago called &lt;a href=&quot;http://www.amazon.com/Code-Book-Science-Secrecy-Cryptography/dp/0385495323&quot; title=&quot;The Code Book&quot; rel=&quot;nofollow&quot;&gt;The Code Book&lt;/a&gt;. I &lt;strong&gt;highly&lt;/strong&gt; recommend it. Anyways, I wrote a program that takes in a block of text and encrypts it using a &lt;a href=&quot;http://en.wikipedia.org/wiki/Tabula_recta&quot; rel=&quot;nofollow&quot;&gt;tabula recta&lt;/a&gt;. My next fun little project will be to write a program that can decrypt this type of cypher.</description>
		<content:encoded><![CDATA[<p>I will not post it here, however, if you really want to know I will email it to you. <img src='http://robertsinclaire.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  It&#8217;s a poly-alphabetic substitution cipher. I read a fantastic book years ago called <a href="http://www.amazon.com/Code-Book-Science-Secrecy-Cryptography/dp/0385495323" title="The Code Book" rel="nofollow">The Code Book</a>. I <strong>highly</strong> recommend it. Anyways, I wrote a program that takes in a block of text and encrypts it using a <a href="http://en.wikipedia.org/wiki/Tabula_recta" rel="nofollow">tabula recta</a>. My next fun little project will be to write a program that can decrypt this type of cypher.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: kevin</title>
		<link>http://robertsinclaire.com/2009/10/07/x1masibhr/comment-page-1/#comment-411</link>
		<dc:creator>kevin</dc:creator>
		<pubDate>Fri, 23 Oct 2009 04:00:00 +0000</pubDate>
		<guid isPermaLink="false">http://robertsinclaire.com/?p=1583#comment-411</guid>
		<description>You ever gonna post the decrypted version of this post?  I still have no clue.  I&#039;ve been looking for patterns in the letters and then trying to substitute new letters based on what I think the word may be, but it ain&#039;t workin.</description>
		<content:encoded><![CDATA[<p>You ever gonna post the decrypted version of this post?  I still have no clue.  I&#8217;ve been looking for patterns in the letters and then trying to substitute new letters based on what I think the word may be, but it ain&#8217;t workin.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using disk: basic
Page Caching using disk: enhanced
Database Caching 1/5 queries in 0.013 seconds using disk: basic
Object Caching 253/253 objects using disk: basic

Served from: robertsinclaire.com @ 2012-02-08 19:36:20 -->
