<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=MD6</id>
	<title>MD6 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=MD6"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=MD6&amp;action=history"/>
	<updated>2026-05-15T20:11:47Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=MD6&amp;diff=2435&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;The '''MD6 Message-Digest Algorithm''' is a cryptographic hash function. It uses a Merkle tree-like structure to allow for immense parallel computation of hashes for v...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=MD6&amp;diff=2435&amp;oldid=prev"/>
		<updated>2019-03-22T03:46:33Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;The &amp;#039;&amp;#039;&amp;#039;MD6 Message-Digest Algorithm&amp;#039;&amp;#039;&amp;#039; is a &lt;a href=&quot;/Cryptographic_hash_function&quot; title=&quot;Cryptographic hash function&quot;&gt;cryptographic hash function&lt;/a&gt;. It uses a &lt;a href=&quot;/Merkle_tree&quot; title=&quot;Merkle tree&quot;&gt;Merkle tree&lt;/a&gt;-like structure to allow for immense parallel computation of hashes for v...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The '''MD6 Message-Digest Algorithm''' is a [[cryptographic hash function]]. It uses a [[Merkle tree]]-like structure to allow for immense parallel computation of hashes for very long inputs. Authors claim a performance of 28 [[cycles per byte]] for MD6-256 on an [[Intel Core 2 Duo]] and provable resistance against [[differential cryptanalysis]]. The [[source code]] of the [[reference implementation]] was released under [[MIT license]].&lt;br /&gt;
&lt;br /&gt;
Speeds in excess of 1 GB/s have been reported to be possible for long messages on 16-core CPU architecture.&lt;br /&gt;
&lt;br /&gt;
MD6 was submitted to the [[NIST hash function competition|NIST SHA-3 competition]]. However, on July 1, 2009, Rivest posted a comment at NIST that MD6 is not yet ready to be a candidate for SHA-3 because of speed issues, a &amp;quot;gap in the proof that the submitted version of MD6 is resistant to differential attacks&amp;quot;, and an inability to supply such a proof for a faster reduced-round version, although Rivest also stated at the MD6 website that it is not withdrawn formally. MD6 did not advance to the second round of the SHA-3 competition. In September 2011, a paper presenting an improved proof that MD6 and faster reduced-round versions are resistant to differential attacks was posted to the MD6 website.&lt;br /&gt;
&lt;br /&gt;
The algorithm's first known production use was in the [[Conficker|Conficker.B]] worm in December 2008; the worm's authors subsequently updated Conficker with the corrected implementation once the buffer overflow vulnerability became known.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Comparison of cryptographic hash functions]]&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>