<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
     xmlns:admin="http://webns.net/mvcb/"
     xmlns:content="http://purl.org/rss/1.0/modules/content/"
     xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<channel> 

	<title>Comments on: Being Digital's Fortress</title>
	<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress/</link>
	<description>Comments on Ask MetaFilter post Being Digital's Fortress</description>
	<pubDate>Wed, 14 Nov 2007 12:03:54 -0800</pubDate>
	<lastBuildDate>Wed, 14 Nov 2007 12:03:54 -0800</lastBuildDate>
	<language>en-us</language>
	<docs>http://blogs.law.harvard.edu/tech/rss</docs>
	<ttl>60</ttl>

	<item>
		<title>Question: Being Digital&apos;s Fortress</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress</link>	
		<description>Did anyone ever crack the Negroponte Code? &lt;br /&gt;&lt;br /&gt; In 1995, long before One Laptop per Child, tech evangelist Nicholas Negroponte authored a book, &lt;i&gt;Being Digital&lt;/i&gt;, that challenged readers to crack an &quot;unbreakable&quot; binary code of his own devising. Negroponte was so certain this code couldn&apos;t be broken that he offered a $100,000 prize out of his own pocket. (The offer was later revoked for legal reasons &#8211; details at the bottom of &lt;a href=&quot;http://www-tech.mit.edu/V115/N47/negroponte.47n.html&quot;&gt;this ancient interview&lt;/a&gt;.) &lt;br&gt;
&lt;br&gt;
Does anyone know the current status of Negroponte&apos;s challenge?&lt;br&gt;
&lt;br&gt;
&lt;small&gt;This was keeping me up last night.&lt;/small&gt;</description>
		<guid isPermaLink="false">post:ask.metafilter.com,2007:site.76267</guid>
		<pubDate>Wed, 14 Nov 2007 11:54:09 -0800</pubDate>
		<dc:creator>roger ackroyd</dc:creator>
		
			<category>Negroponte</category>
		
			<category>code</category>
		
			<category>binary</category>
		
			<category>digital</category>
		
			<category>Wired</category>
		
	</item> <item>
		<title>By: indyz</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress#1133139</link>	
		<description>Well, if the key is truly random and as long as the message, then it is a &lt;a href=&quot;http://en.wikipedia.org/wiki/One-time_pad&quot;&gt;one-time pad&lt;/a&gt; and really is 100% unbreakable without knowledge of the key.  With $100,000 on the line, he&apos;d be stupid to use anything else.</description>
		<guid isPermaLink="false">comment:ask.metafilter.com,2007:site.76267-1133139</guid>
		<pubDate>Wed, 14 Nov 2007 12:03:54 -0800</pubDate>
		<dc:creator>indyz</dc:creator>
	</item><item>
		<title>By: Kadin2048</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress#1133224</link>	
		<description>Either it&apos;s a one-time-pad or Negroponte is an idiot.&lt;br&gt;
&lt;br&gt;
Since determining whether it&apos;s really a OTP  is probably harder than determining whether Negroponte is an idiot, that&apos;s the approach I&apos;d use.</description>
		<guid isPermaLink="false">comment:ask.metafilter.com,2007:site.76267-1133224</guid>
		<pubDate>Wed, 14 Nov 2007 13:08:18 -0800</pubDate>
		<dc:creator>Kadin2048</dc:creator>
	</item><item>
		<title>By: phrontist</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress#1133318</link>	
		<description>Nonsense. Many sensible people think straight RSA with huge keys (not an RSA hybrid) will remain unbreakable as long as primes are a computationally hard problem (which, unless the NSA understands physics or math in ways we don&apos;t, it still is).</description>
		<guid isPermaLink="false">comment:ask.metafilter.com,2007:site.76267-1133318</guid>
		<pubDate>Wed, 14 Nov 2007 14:37:37 -0800</pubDate>
		<dc:creator>phrontist</dc:creator>
	</item><item>
		<title>By: metric space</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress#1133387</link>	
		<description>It sounds like he was trying to make a political point about the then-proposed &lt;a href=&quot;http://en.wikipedia.org/wiki/Clipper_chip&quot;&gt;Clipper chip&lt;/a&gt;, not come up with a new encryption algorithm.  His remarks about &quot;layering&quot; and use of &quot;unbreakable&quot;, as well as his statements &lt;a href=&quot;http://web.media.mit.edu/~nicholas/Wired/WIRED3-03.html&quot;&gt;here&lt;/a&gt; that the method does not need to be complex, all seem to me indicate that he was talking about using a one-time pad on the plaintext, as others have stated above, before submitting it to a Clipper chip.  His point being that even once the NSA recovered the original &quot;plaintext&quot; of some Clipper-encrypted message through a back door, that text could be useless to them.  The spine of his book allegedly illustrates this point.&lt;br&gt;
&lt;br&gt;
How do you know the code was &quot;of his own devising?&quot;  I don&apos;t get that explicitly from your article or the one I linked.  If it was, it is important to note that the (presumably) unsolved state of this problem says absolutely nothing one way or another about the merits of his algorithm.  Bruce Schneier puts it well &lt;a href=&quot;http://www.schneier.com/crypto-gram-9812.html#1&quot;&gt;here&lt;/a&gt;.  For those same reasons, it&apos;s unlikely that anyone with real expertise has tried very hard to solve it.</description>
		<guid isPermaLink="false">comment:ask.metafilter.com,2007:site.76267-1133387</guid>
		<pubDate>Wed, 14 Nov 2007 15:50:08 -0800</pubDate>
		<dc:creator>metric space</dc:creator>
	</item><item>
		<title>By: blacklite</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress#1133773</link>	
		<description>He also could have just made it random noise, which would be a sensible thing to do, if dishonest.</description>
		<guid isPermaLink="false">comment:ask.metafilter.com,2007:site.76267-1133773</guid>
		<pubDate>Wed, 14 Nov 2007 22:04:30 -0800</pubDate>
		<dc:creator>blacklite</dc:creator>
	</item><item>
		<title>By: roger ackroyd</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress#1133861</link>	
		<description>Metric Space: I don&apos;t remember much about the code besides the fact that it existed and seemed very interesting at the time &#8211; so I was probably mistaken when I said it was of Negroponte&apos;s own devising. The background information on the Clipper chip certainly gives me context for the challenge. &lt;br&gt;
&lt;br&gt;
...and thanks for the Schneier link.</description>
		<guid isPermaLink="false">comment:ask.metafilter.com,2007:site.76267-1133861</guid>
		<pubDate>Thu, 15 Nov 2007 00:28:46 -0800</pubDate>
		<dc:creator>roger ackroyd</dc:creator>
	</item><item>
		<title>By: metric space</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress#1133998</link>	
		<description>&lt;i&gt;thanks for the Schneier link&lt;/i&gt;&lt;br&gt;
&lt;br&gt;
Sure, glad you liked it.&lt;br&gt;
&lt;br&gt;
&lt;i&gt;He also could have just made it random noise, which would be a sensible thing to do, if dishonest.&lt;/i&gt;&lt;br&gt;
&lt;br&gt;
It&apos;s also interesting to note that under a one-time pad encryption, &lt;i&gt;any&lt;/i&gt; solution of an appropriate length is feasible, since any key is possible.  So in the absence of a third-party verifier a cheater could certainly encrypt a legitimate plaintext message.  Then in the very unlikely event that the correct solution was somehow proposed, he or she could easily and plausibly deny its correctness by simply claiming that the original message was something else.</description>
		<guid isPermaLink="false">comment:ask.metafilter.com,2007:site.76267-1133998</guid>
		<pubDate>Thu, 15 Nov 2007 06:47:14 -0800</pubDate>
		<dc:creator>metric space</dc:creator>
	</item><item>
		<title>By: LobsterMitten</title>
		<link>http://ask.metafilter.com/76267/Being-Digitals-Fortress#1134825</link>	
		<description>If you like unsolved crypto challenges, there are &lt;a href=&quot;http://www.metafilter.com/56684/BETWEEN-SUBTLE-SHADING-AND-THE-ABSENCE-OF-LIGHT-LIES-THE-NUANCE-OF-IQLUSION&quot;&gt;several&lt;/a&gt;  more &lt;a href=&quot;http://www.elonka.com/UnsolvedCodes.html&quot;&gt;still out there&lt;/a&gt;.</description>
		<guid isPermaLink="false">comment:ask.metafilter.com,2007:site.76267-1134825</guid>
		<pubDate>Thu, 15 Nov 2007 16:05:47 -0800</pubDate>
		<dc:creator>LobsterMitten</dc:creator>
	</item>
	</channel>
</rss>
