<?xml version="1.0" encoding="UTF-8"?> <rss
version="2.0"
xmlns:content="http://purl.org/rss/1.0/modules/content/"
xmlns:wfw="http://wellformedweb.org/CommentAPI/"
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/"
xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
><channel><title>M32 Security &#187; md4</title> <atom:link href="http://m32consulting.com/tag/md4/feed/" rel="self" type="application/rss+xml" /><link>http://m32consulting.com</link> <description>Network Security Info, News, and Resources</description> <lastBuildDate>Sun, 22 Jan 2012 23:37:02 +0000</lastBuildDate> <language>en</language> <sy:updatePeriod>hourly</sy:updatePeriod> <sy:updateFrequency>1</sy:updateFrequency> <item><title>SHA-1 hash collision predicted within the year</title><link>http://m32consulting.com/2009/06/sha-1-hash-collision-predicted-within-the-year/?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=sha-1-hash-collision-predicted-within-the-year</link> <comments>http://m32consulting.com/2009/06/sha-1-hash-collision-predicted-within-the-year/#comments</comments> <pubDate>Wed, 17 Jun 2009 03:02:41 +0000</pubDate> <dc:creator>Kyle</dc:creator> <category><![CDATA[Cryptography]]></category> <category><![CDATA[Security]]></category> <category><![CDATA[attack]]></category> <category><![CDATA[bruce schneier]]></category> <category><![CDATA[collisions]]></category> <category><![CDATA[computational]]></category> <category><![CDATA[cryptanalysis]]></category> <category><![CDATA[Cryptanalytic]]></category> <category><![CDATA[data security]]></category> <category><![CDATA[hash collision]]></category> <category><![CDATA[Hashing]]></category> <category><![CDATA[hashing algorithm]]></category> <category><![CDATA[md4]]></category> <category><![CDATA[md5]]></category> <category><![CDATA[nist]]></category> <category><![CDATA[real world]]></category> <category><![CDATA[sha]]></category> <category><![CDATA[sha algorithm]]></category><guid
isPermaLink="false">http://m32consulting.com/?p=30</guid> <description><![CDATA[Bruce Schneier writes about a new cryptanalysis attack published recently brings the SHA-1 hashing algorithm increasingly closer to a realistic collision. Considering the SHA-1 algorithm is designed closeley to the principles of MD4 and MD5 hashing algorithms, it seems not a question of if, but a question of when. Bruce writes: A new attack can, [...]]]></description> <content:encoded><![CDATA[<p>Bruce Schneier writes about a new cryptanalysis attack published recently brings the SHA-1 hashing algorithm increasingly closer to a realistic <a
title="Hashing collision (Wikipedia)" href="http://en.wikipedia.org/wiki/Hash_collision" target="_blank">collision</a>. Considering the SHA-1 algorithm is designed closeley to the principles of MD4 and MD5 hashing algorithms, it seems not a question of if, but a question of when. Bruce writes:</p><blockquote><p><em>A <a
href="http://eprint.iacr.org/2009/259">new attack</a> can, at  least in theory, find collisions in 2<sup>52</sup> hash operations &#8212;  well within the realm of computational possibility.  Assuming the  cryptanalysis is correct, we should expect to see an actual SHA-1  collision within the year.</em></p></blockquote><p>This has little immediate real-world implications on data security since most have moved on to stronger or the SHA-2 family of algorithms which, for now, are safe. Nontheless, the NIST has already begun development on a &#8220;SHA-3&#8243; algorithm with publication to be expected in 2012.</p><p><a
title="Ever Better Cryptanalytic Results Against SHA-1" href="http://www.schneier.com/blog/archives/2009/06/ever_better_cry.html" target="_self">More on Bruce Schneier&#8217;s blog post.</a></p>Tags: <a
href="http://m32consulting.com/tag/attack/" title="attack" rel="tag">attack</a>, <a
href="http://m32consulting.com/tag/bruce-schneier/" title="bruce schneier" rel="tag">bruce schneier</a>, <a
href="http://m32consulting.com/tag/collisions/" title="collisions" rel="tag">collisions</a>, <a
href="http://m32consulting.com/tag/computational/" title="computational" rel="tag">computational</a>, <a
href="http://m32consulting.com/tag/cryptanalysis/" title="cryptanalysis" rel="tag">cryptanalysis</a>, <a
href="http://m32consulting.com/tag/cryptanalytic/" title="Cryptanalytic" rel="tag">Cryptanalytic</a>, <a
href="http://m32consulting.com/tag/data-security/" title="data security" rel="tag">data security</a>, <a
href="http://m32consulting.com/tag/hash-collision/" title="hash collision" rel="tag">hash collision</a>, <a
href="http://m32consulting.com/tag/hashing/" title="Hashing" rel="tag">Hashing</a>, <a
href="http://m32consulting.com/tag/hashing-algorithm/" title="hashing algorithm" rel="tag">hashing algorithm</a>, <a
href="http://m32consulting.com/tag/md4/" title="md4" rel="tag">md4</a>, <a
href="http://m32consulting.com/tag/md5/" title="md5" rel="tag">md5</a>, <a
href="http://m32consulting.com/tag/nist/" title="nist" rel="tag">nist</a>, <a
href="http://m32consulting.com/tag/real-world/" title="real world" rel="tag">real world</a>, <a
href="http://m32consulting.com/tag/sha/" title="sha" rel="tag">sha</a>, <a
href="http://m32consulting.com/tag/sha-algorithm/" title="sha algorithm" rel="tag">sha algorithm</a><br
/> ]]></content:encoded> <wfw:commentRss>http://m32consulting.com/2009/06/sha-1-hash-collision-predicted-within-the-year/feed/</wfw:commentRss> <slash:comments>0</slash:comments> </item> </channel> </rss>
<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using disk: basic
Page Caching using disk: enhanced
Database Caching 4/16 queries in 0.018 seconds using disk: basic
Object Caching 938/963 objects using disk: basic

Served from: m32consulting.com @ 2012-02-05 19:28:43 -->
