<?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=Snefru</id>
	<title>Snefru - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Snefru"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Snefru&amp;action=history"/>
	<updated>2026-05-15T08:07:19Z</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=Snefru&amp;diff=6867&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;'''Snefru''' is a cryptographic hash function invented by Ralph Merkle in 1990 while working at Xerox PARC. The function supports 128-bit and 256-bit output. It wa...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Snefru&amp;diff=6867&amp;oldid=prev"/>
		<updated>2019-07-16T09:03:13Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Snefru&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; invented by &lt;a href=&quot;/index.php?title=Ralph_Merkle&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Ralph Merkle (page does not exist)&quot;&gt;Ralph Merkle&lt;/a&gt; in 1990 while working at &lt;a href=&quot;/index.php?title=Xerox_PARC&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Xerox PARC (page does not exist)&quot;&gt;Xerox PARC&lt;/a&gt;. The function supports 128-bit and 256-bit output. It wa...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Snefru''' is a [[cryptographic hash function]] invented by [[Ralph Merkle]]&lt;br /&gt;
in 1990 while working at [[Xerox PARC]].&lt;br /&gt;
The function supports 128-bit and 256-bit output. It was named after the [[Ancient Egypt|Egyptian]] [[Pharaoh]] [[Sneferu]], continuing the tradition of the [[Khufu and Khafre#Khufu|Khufu]] and [[Khufu and Khafre#Khafre|Khafre]] [[block cipher]]s.&lt;br /&gt;
&lt;br /&gt;
The original design of Snefru was shown to be insecure by [[Eli Biham]] and [[Adi Shamir]] who were able to use [[differential cryptanalysis]] to find hash collisions. The design was then modified by increasing the number of iterations of the main pass of the algorithm from two to eight. Although differential cryptanalysis can break the revised version with less complexity than [[brute force attack|brute force search]] (a certificational weakness), the attack requires &amp;lt;math&amp;gt;2^{88.5}&amp;lt;/math&amp;gt; operations and is thus not currently feasible in practice.&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
&lt;br /&gt;
[[Category:Cryptography]]&lt;br /&gt;
==See Also on BitcoinWiki==&lt;br /&gt;
* [[Redpill]]&lt;br /&gt;
* [[Aworker]]&lt;br /&gt;
* [[Helix3]]&lt;br /&gt;
* [[Tradelize]]&lt;br /&gt;
* [[PlanEx]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>