<?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 for Cryptosmith</title>
	<atom:link href="http://www.cryptosmith.com/comments/feed" rel="self" type="application/rss+xml" />
	<link>http://www.cryptosmith.com</link>
	<description>Authentication, crypto, information security, and life with gadgets - Rick Smith</description>
	<lastBuildDate>Thu, 19 Nov 2009 04:27:20 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=abc</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Boak&#8217;s Puzzle: Disposing of Classified Trash by onetimer</title>
		<link>http://www.cryptosmith.com/archives/565/comment-page-1#comment-8215</link>
		<dc:creator>onetimer</dc:creator>
		<pubDate>Thu, 19 Nov 2009 04:27:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.cryptosmith.com/?p=565#comment-8215</guid>
		<description>GregoryF, I believe you have the correct solution. Note the final words of the Boak text: &quot;because that is par for the course.&quot; I think that language is key. 

Add up the error positions you describe in your post:
1st error: E (5)
2nd error: F (6)
3rd error: N (14)
4th error: E (5)
? error: U/L Transposition
5th error: S (19)
6th error: B (2)

5 + 6 + 14 + 5 + 19 + 2 = 51,

then, accounting for the &quot;deliberately incorporated error,&quot; add 51, from above, to 19 + 2 = 72, which is, of course, &quot;par for the course.&quot;</description>
		<content:encoded><![CDATA[<p>GregoryF, I believe you have the correct solution. Note the final words of the Boak text: &#8220;because that is par for the course.&#8221; I think that language is key. </p>
<p>Add up the error positions you describe in your post:<br />
1st error: E (5)<br />
2nd error: F (6)<br />
3rd error: N (14)<br />
4th error: E (5)<br />
? error: U/L Transposition<br />
5th error: S (19)<br />
6th error: B (2)</p>
<p>5 + 6 + 14 + 5 + 19 + 2 = 51,</p>
<p>then, accounting for the &#8220;deliberately incorporated error,&#8221; add 51, from above, to 19 + 2 = 72, which is, of course, &#8220;par for the course.&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Boak&#8217;s Puzzle Revisited by Rick (l) Admin</title>
		<link>http://www.cryptosmith.com/archives/779/comment-page-1#comment-8214</link>
		<dc:creator>Rick (l) Admin</dc:creator>
		<pubDate>Wed, 30 Sep 2009 12:37:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.cryptosmith.com/?p=779#comment-8214</guid>
		<description>Gregory dropped me an e-mail pointing out the misspelling I missed - Ft. Meyer was missing it&#039;s &quot;e&quot;.</description>
		<content:encoded><![CDATA[<p>Gregory dropped me an e-mail pointing out the misspelling I missed &#8211; Ft. Meyer was missing it&#8217;s &#8220;e&#8221;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Boak&#8217;s Puzzle Revisited by James Heaney</title>
		<link>http://www.cryptosmith.com/archives/779/comment-page-1#comment-8213</link>
		<dc:creator>James Heaney</dc:creator>
		<pubDate>Wed, 16 Sep 2009 00:31:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.cryptosmith.com/?p=779#comment-8213</guid>
		<description>Good!  Hopefully those enrollments will (continue) to tick upwards.

Thanks.</description>
		<content:encoded><![CDATA[<p>Good!  Hopefully those enrollments will (continue) to tick upwards.</p>
<p>Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Boak&#8217;s Puzzle Revisited by Dr. Rick Smith</title>
		<link>http://www.cryptosmith.com/archives/779/comment-page-1#comment-8212</link>
		<dc:creator>Dr. Rick Smith</dc:creator>
		<pubDate>Sat, 12 Sep 2009 01:20:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.cryptosmith.com/?p=779#comment-8212</guid>
		<description>Regarding my professional situation: I&#039;m keeping a faculty appointment at UST and will be teaching the security course again next semester. 

I think the tenure situation was influenced by low enrollments in computer science. Last year was the only year during which I was kept busy the whole time teaching CS courses. Previous years I had to teach engineering and/or graduate courses to fill up my schedule.

I&#039;m now busy as a consultant, with some time for writing projects.</description>
		<content:encoded><![CDATA[<p>Regarding my professional situation: I&#8217;m keeping a faculty appointment at UST and will be teaching the security course again next semester. </p>
<p>I think the tenure situation was influenced by low enrollments in computer science. Last year was the only year during which I was kept busy the whole time teaching CS courses. Previous years I had to teach engineering and/or graduate courses to fill up my schedule.</p>
<p>I&#8217;m now busy as a consultant, with some time for writing projects.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Boak&#8217;s Puzzle Revisited by James Heaney</title>
		<link>http://www.cryptosmith.com/archives/779/comment-page-1#comment-8211</link>
		<dc:creator>James Heaney</dc:creator>
		<pubDate>Fri, 11 Sep 2009 23:15:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.cryptosmith.com/?p=779#comment-8211</guid>
		<description>Still, progress!  Hooray!  Even this basic crypto is very, very tough.

I don&#039;t suppose we could just find Mr. Boak and ask him whether we&#039;ve cracked his code or not?  I know he&#039;d be very, very old by now, but is he actually dead?

In a complete aside, now that you&#039;ve become the latest casualty of UST&#039;s largely demented Tenure Committee... would you mind sharing with your readership what you&#039;re doing now?  Hopefully moving on to a university that _doesn&#039;t_ fire noted experts from fields it claims to teach?</description>
		<content:encoded><![CDATA[<p>Still, progress!  Hooray!  Even this basic crypto is very, very tough.</p>
<p>I don&#8217;t suppose we could just find Mr. Boak and ask him whether we&#8217;ve cracked his code or not?  I know he&#8217;d be very, very old by now, but is he actually dead?</p>
<p>In a complete aside, now that you&#8217;ve become the latest casualty of UST&#8217;s largely demented Tenure Committee&#8230; would you mind sharing with your readership what you&#8217;re doing now?  Hopefully moving on to a university that _doesn&#8217;t_ fire noted experts from fields it claims to teach?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Boak&#8217;s Puzzle: Disposing of Classified Trash by GregoryF</title>
		<link>http://www.cryptosmith.com/archives/565/comment-page-1#comment-8210</link>
		<dc:creator>GregoryF</dc:creator>
		<pubDate>Thu, 10 Sep 2009 03:58:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.cryptosmith.com/?p=565#comment-8210</guid>
		<description>I think it is a simple innocent text system, as advertised, with only one twist that slowed me down. Of course, I may be completely wrong.

I think the solution is: &quot;The telling ash was simple buried&quot; Allowing for one error, as mentioned in the text, this ought to be: &quot;The telling ash was simply buried.&quot;

There are six errors that can be corrected with a letter and six paragraphs on the page. I found that interesting. There was also one transposition error, which has no single unique letter. Hmm, not sure what to do with that - maybe that&#039;s a typographical error (and thus the one deliberate mistake).

In sequence, the errors, and the alphabetic position of the letter are:
1st error: E (5)
2nd error: F (6)
3rd error: N (14)
4th error: E (5)
? error: U/L Transposition
5th error: S (19)
6th error: B (2)

Selecting one word from each paragraph, whose position corresponed to the letter&#039;s alphabetic position, I obtained &quot;The telling ash was with you.&quot; The first four words made me think I had the solution, but the 5th and 6th words don&#039;t make sense.

So I reconsidered the possibility that the transposition error isn&#039;t a deliberate, non-cipher error. I think, instead that it&#039;s an indicator that the transposition code for the system is changed somehow.

Figuring out the shift is a challenge, because there are many possibilities, once the simple alphabet position is dropped; I decided to work backwards a bit. It seems that the only word in the sixth paragraph that is a really good candidate to finish the sentence is &quot;buried.&quot; Nothing in the fifth paragraph leaps out as well, but &quot;simple&quot; seems close to a word that popped into mind immediately after reading the first four words, &quot;simply.&quot;

Wishful thinking, perhaps. But I tried to see what I could work out for the position of these words. If I start counting from the second sentence of these respective paragraphs, the position is 18 for &quot;simple&quot; and 27 for &quot;buried.&quot; If you take the mod(26) operator for these, the two numnbers, 18 and 1, seem suspiciously close to the corresponding letter positions for the errors, 19 and 2, and have the correct spacing.

It is possible to arbitrarily define a shift to the transposition code after the transposition indicator, to make this fit the target text. The shift I posit is:
 1. start counting words from the second sentence
 2. add one to the basic alphabet cipher (or rotate the transposition so that B = 1)
 3. add 26 to the cipher number up to (or through) the letter L

This provides the solution I offered. I think the change after the transposition error is a bit arbitrary, which makes it a little unsatisfying, but if you believe the code is as simple as one word per error, it&#039;s about the only sentence that makes sense.</description>
		<content:encoded><![CDATA[<p>I think it is a simple innocent text system, as advertised, with only one twist that slowed me down. Of course, I may be completely wrong.</p>
<p>I think the solution is: &#8220;The telling ash was simple buried&#8221; Allowing for one error, as mentioned in the text, this ought to be: &#8220;The telling ash was simply buried.&#8221;</p>
<p>There are six errors that can be corrected with a letter and six paragraphs on the page. I found that interesting. There was also one transposition error, which has no single unique letter. Hmm, not sure what to do with that &#8211; maybe that&#8217;s a typographical error (and thus the one deliberate mistake).</p>
<p>In sequence, the errors, and the alphabetic position of the letter are:<br />
1st error: E (5)<br />
2nd error: F (6)<br />
3rd error: N (14)<br />
4th error: E (5)<br />
? error: U/L Transposition<br />
5th error: S (19)<br />
6th error: B (2)</p>
<p>Selecting one word from each paragraph, whose position corresponed to the letter&#8217;s alphabetic position, I obtained &#8220;The telling ash was with you.&#8221; The first four words made me think I had the solution, but the 5th and 6th words don&#8217;t make sense.</p>
<p>So I reconsidered the possibility that the transposition error isn&#8217;t a deliberate, non-cipher error. I think, instead that it&#8217;s an indicator that the transposition code for the system is changed somehow.</p>
<p>Figuring out the shift is a challenge, because there are many possibilities, once the simple alphabet position is dropped; I decided to work backwards a bit. It seems that the only word in the sixth paragraph that is a really good candidate to finish the sentence is &#8220;buried.&#8221; Nothing in the fifth paragraph leaps out as well, but &#8220;simple&#8221; seems close to a word that popped into mind immediately after reading the first four words, &#8220;simply.&#8221;</p>
<p>Wishful thinking, perhaps. But I tried to see what I could work out for the position of these words. If I start counting from the second sentence of these respective paragraphs, the position is 18 for &#8220;simple&#8221; and 27 for &#8220;buried.&#8221; If you take the mod(26) operator for these, the two numnbers, 18 and 1, seem suspiciously close to the corresponding letter positions for the errors, 19 and 2, and have the correct spacing.</p>
<p>It is possible to arbitrarily define a shift to the transposition code after the transposition indicator, to make this fit the target text. The shift I posit is:<br />
 1. start counting words from the second sentence<br />
 2. add one to the basic alphabet cipher (or rotate the transposition so that B = 1)<br />
 3. add 26 to the cipher number up to (or through) the letter L</p>
<p>This provides the solution I offered. I think the change after the transposition error is a bit arbitrary, which makes it a little unsatisfying, but if you believe the code is as simple as one word per error, it&#8217;s about the only sentence that makes sense.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Time &#8211; Again &#8211; For Trustworthy Computing by James Heaney</title>
		<link>http://www.cryptosmith.com/archives/734/comment-page-1#comment-8209</link>
		<dc:creator>James Heaney</dc:creator>
		<pubDate>Fri, 28 Aug 2009 17:47:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.cryptosmith.com/?p=734#comment-8209</guid>
		<description>&quot;I wish it were possible to run a computer without Acrobat Reader, since Adobe has done such a poor job of keeping it safe.&quot;

After the last... spate? (Run?  Plague?  Laughable systemic corporate failure?) of Adobe attacks, I switched myself over to Foxit Reader.  It&#039;s not open source, but it *is* free, and it&#039;s a heckuva lot less obnoxious than Acrobat.

Sadly, there isn&#039;t a good replacement for Flash yet.  Darn it, HTML5 working group!  Pull yourselves together and get a standard codec for the  tag!

Anyhow, I recommend Foxit.

As for the article... I&#039;m starting to think everyone should have a separate computer just for online banking.  But that would be surrender.  :P

--JH</description>
		<content:encoded><![CDATA[<p>&#8220;I wish it were possible to run a computer without Acrobat Reader, since Adobe has done such a poor job of keeping it safe.&#8221;</p>
<p>After the last&#8230; spate? (Run?  Plague?  Laughable systemic corporate failure?) of Adobe attacks, I switched myself over to Foxit Reader.  It&#8217;s not open source, but it *is* free, and it&#8217;s a heckuva lot less obnoxious than Acrobat.</p>
<p>Sadly, there isn&#8217;t a good replacement for Flash yet.  Darn it, HTML5 working group!  Pull yourselves together and get a standard codec for the  tag!</p>
<p>Anyhow, I recommend Foxit.</p>
<p>As for the article&#8230; I&#8217;m starting to think everyone should have a separate computer just for online banking.  But that would be surrender.  <img src='http://www.cryptosmith.com/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' /> </p>
<p>&#8211;JH</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Hacking Business Accounts by Rick (l) Admin</title>
		<link>http://www.cryptosmith.com/archives/687/comment-page-1#comment-8208</link>
		<dc:creator>Rick (l) Admin</dc:creator>
		<pubDate>Fri, 24 Jul 2009 17:19:14 +0000</pubDate>
		<guid isPermaLink="false">http://www.cryptosmith.com/?p=687#comment-8208</guid>
		<description>I have to say that the Bank of America phishers are pretty brazen - it&#039;s incredible to think they&#039;re telling people to install new public key certificates. 

The sad thing is that I know people will fall for it.

Actually, though, that makes the attack really too complex. It gives forewarning of where the domain will be for the actual attack.</description>
		<content:encoded><![CDATA[<p>I have to say that the Bank of America phishers are pretty brazen &#8211; it&#8217;s incredible to think they&#8217;re telling people to install new public key certificates. </p>
<p>The sad thing is that I know people will fall for it.</p>
<p>Actually, though, that makes the attack really too complex. It gives forewarning of where the domain will be for the actual attack.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
