<?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: A pin maybe found in a haystack</title>
	<atom:link href="http://gondwanaland.com/mlog/2004/08/16/a-pin-maybe-found-in-a-haystack/feed/" rel="self" type="application/rss+xml" />
	<link>http://gondwanaland.com/mlog/2004/08/16/a-pin-maybe-found-in-a-haystack/</link>
	<description>My opinions only. I do not represent any organization in this publication.</description>
	<lastBuildDate>Sat, 12 May 2012 23:12:14 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Gordon Mohr</title>
		<link>http://gondwanaland.com/mlog/2004/08/16/a-pin-maybe-found-in-a-haystack/#comment-44</link>
		<dc:creator>Gordon Mohr</dc:creator>
		<pubDate>Tue, 17 Aug 2004 05:55:56 +0000</pubDate>
		<guid isPermaLink="false">//?p=#comment-44</guid>
		<description>Even if you can&#039;t create a collision with a specific  target hash, if you are able to create pairs of preimages with the same end hash, mischief is possible. 

For example, you create two files, one with something desirable, one with something undesirable (a trojan). You jiggle them both in insignificant ways until they match hashes. You then promote the desirable file, giving it (and its hash) a good reputation. (Perhaps, third parties have even reviewed and endorsed its contents.)

Then, you release the trojan version, which can piggyback the good reputation of the first version to many more places than it would have otherwise reached. 

It&#039;s not as bad as if a collision for arbitrary content could be found, but it still makes the hash function less-than-ideal for many purposes.</description>
		<content:encoded><![CDATA[<p>Even if you can&#8217;t create a collision with a specific  target hash, if you are able to create pairs of preimages with the same end hash, mischief is possible. </p>
<p>For example, you create two files, one with something desirable, one with something undesirable (a trojan). You jiggle them both in insignificant ways until they match hashes. You then promote the desirable file, giving it (and its hash) a good reputation. (Perhaps, third parties have even reviewed and endorsed its contents.)</p>
<p>Then, you release the trojan version, which can piggyback the good reputation of the first version to many more places than it would have otherwise reached. </p>
<p>It&#8217;s not as bad as if a collision for arbitrary content could be found, but it still makes the hash function less-than-ideal for many purposes.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

