<?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 SHA512 Sum</title>
	<atom:link href="http://danielmiessler.com/blog/a-sha512-sum/feed" rel="self" type="application/rss+xml" />
	<link>http://danielmiessler.com/blog/a-sha512-sum</link>
	<description>grep understanding</description>
	<lastBuildDate>Sun, 29 Jan 2012 20:44:46 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: TIMM</title>
		<link>http://danielmiessler.com/blog/a-sha512-sum/comment-page-1#comment-140627</link>
		<dc:creator>TIMM</dc:creator>
		<pubDate>Thu, 01 May 2008 18:23:05 +0000</pubDate>
		<guid isPermaLink="false">http://dmiessler.com/?p=2332#comment-140627</guid>
		<description>&lt;p&gt;intereesting from wikipedia:&lt;/p&gt;

&lt;p&gt;&quot;The security of SHA-1 has been somewhat compromised by cryptography researchers.[1] Although no attacks have yet been reported on the SHA-2 variants, they are algorithmically similar to SHA-1 and so efforts are underway to develop improved alternative hashing algorithms.[2][3] An open competition for a new SHA-3 function was formally announced in the Federal Register on November 2, 2007.[4] &quot;NIST is initiating an effort to develop one or more additional hash algorithms through a public competition, similar to the development process for the Advanced Encryption Standard (AES).&quot;[5] Submissions are due October 31, 2008 and the proclamation of a winner and publication of the new standard are scheduled to take place in 2012.&quot;&lt;/p&gt;

&lt;p&gt;http://en.wikipedia.org/wiki/SHA&lt;em&gt;hash&lt;/em&gt;functions&lt;/p&gt;

&lt;p&gt;-=T=-&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>intereesting from wikipedia:</p>

<p>&#8220;The security of SHA-1 has been somewhat compromised by cryptography researchers.[1] Although no attacks have yet been reported on the SHA-2 variants, they are algorithmically similar to SHA-1 and so efforts are underway to develop improved alternative hashing algorithms.[2][3] An open competition for a new SHA-3 function was formally announced in the Federal Register on November 2, 2007.[4] &#8220;NIST is initiating an effort to develop one or more additional hash algorithms through a public competition, similar to the development process for the Advanced Encryption Standard (AES).&#8221;[5] Submissions are due October 31, 2008 and the proclamation of a winner and publication of the new standard are scheduled to take place in 2012.&#8221;</p>

<p><a href="http://en.wikipedia.org/wiki/SHA" rel="nofollow">http://en.wikipedia.org/wiki/SHA</a><em>hash</em>functions</p>

<p>-=T=-</p>]]></content:encoded>
	</item>
	<item>
		<title>By: TIMM</title>
		<link>http://danielmiessler.com/blog/a-sha512-sum/comment-page-1#comment-251549</link>
		<dc:creator>TIMM</dc:creator>
		<pubDate>Thu, 01 May 2008 18:23:00 +0000</pubDate>
		<guid isPermaLink="false">http://dmiessler.com/?p=2332#comment-251549</guid>
		<description>&lt;p&gt;intereesting from wikipedia:&lt;/p&gt;

&lt;p&gt;&quot;The security of SHA-1 has been somewhat compromised by cryptography researchers.[1] Although no attacks have yet been reported on the SHA-2 variants, they are algorithmically similar to SHA-1 and so efforts are underway to develop improved alternative hashing algorithms.[2][3] An open competition for a new SHA-3 function was formally announced in the Federal Register on November 2, 2007.[4] &quot;NIST is initiating an effort to develop one or more additional hash algorithms through a public competition, similar to the development process for the Advanced Encryption Standard (AES).&quot;[5] Submissions are due October 31, 2008 and the proclamation of a winner and publication of the new standard are scheduled to take place in 2012.&quot;&lt;/p&gt;

&lt;p&gt;http://en.wikipedia.org/wiki/SHA&lt;em&gt;hash&lt;/em&gt;functions&lt;/p&gt;

&lt;p&gt;-=T=-&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>intereesting from wikipedia:</p>

<p>&#8220;The security of SHA-1 has been somewhat compromised by cryptography researchers.[1] Although no attacks have yet been reported on the SHA-2 variants, they are algorithmically similar to SHA-1 and so efforts are underway to develop improved alternative hashing algorithms.[2][3] An open competition for a new SHA-3 function was formally announced in the Federal Register on November 2, 2007.[4] &#8220;NIST is initiating an effort to develop one or more additional hash algorithms through a public competition, similar to the development process for the Advanced Encryption Standard (AES).&#8221;[5] Submissions are due October 31, 2008 and the proclamation of a winner and publication of the new standard are scheduled to take place in 2012.&#8221;</p>

<p><a href="http://en.wikipedia.org/wiki/SHA" rel="nofollow">http://en.wikipedia.org/wiki/SHA</a><em>hash</em>functions</p>

<p>-=T=-</p>]]></content:encoded>
	</item>
</channel>
</rss>

