<?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=SIMD_%28hash_function%29</id>
	<title>SIMD (hash function) - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=SIMD_%28hash_function%29"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=SIMD_(hash_function)&amp;action=history"/>
	<updated>2026-05-15T09:07:41Z</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=SIMD_(hash_function)&amp;diff=6670&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;'''SIMD''' is a cryptographic hash function based on the Merkle–Damgård construction submitted to the NIST hash function competition by Gaëtan Leurent. It is o...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=SIMD_(hash_function)&amp;diff=6670&amp;oldid=prev"/>
		<updated>2019-07-06T13:12:15Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;SIMD&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; based on the &lt;a href=&quot;/Merkle%E2%80%93Damg%C3%A5rd_construction&quot; title=&quot;Merkle–Damgård construction&quot;&gt;Merkle–Damgård construction&lt;/a&gt; submitted to the &lt;a href=&quot;/NIST_hash_function_competition&quot; title=&quot;NIST hash function competition&quot;&gt;NIST hash function competition&lt;/a&gt; by Gaëtan Leurent. It is o...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''SIMD''' is a [[cryptographic hash function]] based on the [[Merkle–Damgård construction]] submitted to the [[NIST hash function competition]] by Gaëtan Leurent. It is one of fourteen entries to be accepted into round two of the competition, but was not shortlisted for the third and final round.&lt;br /&gt;
&lt;br /&gt;
The designer states that the &amp;quot;most important component of SIMD is its message expansion, which is designed to give a high minimal distance&amp;quot;. The algorithm's speed is claimed to be 11-13 [[cycles per byte]].&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;br /&gt;
[[Category:Cryptographic algorithms]]&lt;br /&gt;
==See Also on BitcoinWiki==&lt;br /&gt;
* [[Triffic]]&lt;br /&gt;
* [[Bixtrim]]&lt;br /&gt;
* [[MEvU]]&lt;br /&gt;
* [[Buglab]]&lt;br /&gt;
* [[GrabAMeal]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>