<?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: Thought Exercise: Automated Vulnerability Creation</title>
	<atom:link href="http://www.veracode.com/blog/2007/11/thought-exercise-automated-vulnerability-creation/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.veracode.com/blog/2007/11/thought-exercise-automated-vulnerability-creation/</link>
	<description>Application security testing, analysis, and metrics</description>
	<lastBuildDate>Tue, 15 May 2012 22:16:53 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Chris Eng</title>
		<link>http://www.veracode.com/blog/2007/11/thought-exercise-automated-vulnerability-creation/comment-page-1/#comment-642</link>
		<dc:creator>Chris Eng</dc:creator>
		<pubDate>Tue, 20 Nov 2007 20:29:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=70#comment-642</guid>
		<description>@Andy: As ds pointed out, it would be impractical to try and keep the hash the same -- that would require a major cryptographic breakthrough.  The point was more along the lines of auto-generating test cases for code review tools, as opposed to creating undetectable backdoors.  

If you think about it, the effort involved in creating arbitrarily complex test cases is significant.  You can use synthetic cases such as SAMATE but these don&#039;t approach the level of code complexity that a real-world codebase would have.  Similarly, you can benchmark yourself against publicly-disclosed vulnerabilities in real-world code but that is a labor intensive process to catalog all the data.</description>
		<content:encoded><![CDATA[<p>@Andy: As ds pointed out, it would be impractical to try and keep the hash the same &#8212; that would require a major cryptographic breakthrough.  The point was more along the lines of auto-generating test cases for code review tools, as opposed to creating undetectable backdoors.  </p>
<p>If you think about it, the effort involved in creating arbitrarily complex test cases is significant.  You can use synthetic cases such as SAMATE but these don&#8217;t approach the level of code complexity that a real-world codebase would have.  Similarly, you can benchmark yourself against publicly-disclosed vulnerabilities in real-world code but that is a labor intensive process to catalog all the data.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ds</title>
		<link>http://www.veracode.com/blog/2007/11/thought-exercise-automated-vulnerability-creation/comment-page-1/#comment-639</link>
		<dc:creator>ds</dc:creator>
		<pubDate>Mon, 19 Nov 2007 20:31:11 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=70#comment-639</guid>
		<description>You are probably already familiar with the paper &quot;Reflections on Trusting Trust&quot;, published in 1984 by Ken Thompson (he of C).  

http://cm.bell-labs.com/who/ken/trust.html

Worth a read by those interested in this topic.

As for Commenter Andy&#039;s suggestion on making the program have an identical hash value... if that were possible, then the hash algorithm in use would be broken and (hopefully) not in use anymore.  

-ds</description>
		<content:encoded><![CDATA[<p>You are probably already familiar with the paper &#8220;Reflections on Trusting Trust&#8221;, published in 1984 by Ken Thompson (he of C).  </p>
<p><a href="http://cm.bell-labs.com/who/ken/trust.html" rel="nofollow">http://cm.bell-labs.com/who/ken/trust.html</a></p>
<p>Worth a read by those interested in this topic.</p>
<p>As for Commenter Andy&#8217;s suggestion on making the program have an identical hash value&#8230; if that were possible, then the hash algorithm in use would be broken and (hopefully) not in use anymore.  </p>
<p>-ds</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andy Steingruebl</title>
		<link>http://www.veracode.com/blog/2007/11/thought-exercise-automated-vulnerability-creation/comment-page-1/#comment-631</link>
		<dc:creator>Andy Steingruebl</dc:creator>
		<pubDate>Sat, 17 Nov 2007 22:45:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=70#comment-631</guid>
		<description>The real trick would be to make one that exhibits one or more of these behaviors and has the same hash.  Its pretty obvious when a trojan doesn&#039;t do the right then generally.  Its an entirely different matter for it to behave almost identically, have the same hash, but have a few backdoors inserted.

A thought exercise only I hope - not looking forward to this being practical :)</description>
		<content:encoded><![CDATA[<p>The real trick would be to make one that exhibits one or more of these behaviors and has the same hash.  Its pretty obvious when a trojan doesn&#8217;t do the right then generally.  Its an entirely different matter for it to behave almost identically, have the same hash, but have a few backdoors inserted.</p>
<p>A thought exercise only I hope &#8211; not looking forward to this being practical :)</p>
]]></content:encoded>
	</item>
</channel>
</rss>

