<?xml version="1.0"?>
<?xml-stylesheet type="text/css" href="http://test.amule.szerverem.hu/w/skins/common/feed.css?303"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://test.amule.szerverem.hu/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=204.186.210.188</id>
		<title>AMule Project FAQ - User contributions [en]</title>
		<link rel="self" type="application/atom+xml" href="http://test.amule.szerverem.hu/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=204.186.210.188"/>
		<link rel="alternate" type="text/html" href="http://test.amule.szerverem.hu/wiki/Special:Contributions/204.186.210.188"/>
		<updated>2026-04-05T10:37:56Z</updated>
		<subtitle>User contributions</subtitle>
		<generator>MediaWiki 1.23.3</generator>

	<entry>
		<id>http://test.amule.szerverem.hu/wiki/MD4_hash</id>
		<title>MD4 hash</title>
		<link rel="alternate" type="text/html" href="http://test.amule.szerverem.hu/wiki/MD4_hash"/>
				<updated>2006-01-14T07:06:24Z</updated>
		
		<summary type="html">&lt;p&gt;204.186.210.188: MD4 security update&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;An [http://www.faqs.org/rfcs/rfc1320.html MD4] hash is a unique value given as a result of a mathematical expression following the [http://www.faqs.org/rfcs/rfc1320.html MD4 algorithm] which claims to ensure data integrity.&amp;lt;br&amp;gt;&lt;br /&gt;
It provides a 128-bit (16 [[byte]]s, 32 hex chars) message digest from the data input (the input may be of any length) that is claimed to be unique.&lt;br /&gt;
&lt;br /&gt;
[http://www.faqs.org/rfcs/rfc1320.html MD4] was developed by [http://theory.lcs.mit.edu/~rivest Professor Ronald L. Rivest] of [http://web.mit.edu MIT] and accepted by the [http://www.rsa.com RSA] on [http://www.faqs.org/rfcs/rfc1186.html October 1990] and then redesigned on [http://www.faqs.org/rfcs/rfc1320.html April 1992].&lt;br /&gt;
&lt;br /&gt;
Both [http://www.faqs.org/rfcs/rfc1320.html MD4] and its successor [http://userpages.umbc.edu/~mabzug1/cs/md5/md5.html MD5] (which is an extension of [http://www.faqs.org/rfcs/rfc1320.html MD4]) are optimized for 32-bit machines, while its predecessor [http://www.faqs.org/rfcs/rfc1319.html MD2] was optimized for 8-bit machines.&lt;br /&gt;
&lt;br /&gt;
[http://www.faqs.org/rfcs/rfc1320.html MD4] is known to be fast, but possibly not absolutely secure. On the other hand, [http://userpages.umbc.edu/~mabzug1/cs/md5/md5.html MD5] is not as fast as the [http://www.faqs.org/rfcs/rfc1320.html MD4] algorithm, but offers much more assurance of data security.&lt;br /&gt;
: This is a bit out of date, or just uninformed. MD5 is questionable, these days (the currently existing attacks on it aren't serious for most applications, but the door is open for more), and MD4 is known to be absolutely hopeless, and collisions can be found with very little in the way of computational effort. The upshot of which is that it would be theoretically pretty easy for a rogue node to cause undetectable corruption to files on ed2k.&lt;br /&gt;
&lt;br /&gt;
[[aMule]] incorporates the [http://www.faqs.org/rfcs/rfc1320.html MD4] algorithm based on the [[libcrypto|Crypto++]]'s library sources (in some beta [[aMule]] v2 releases, it did actually use [[libcrypto|Crypto++]]).&lt;/div&gt;</summary>
		<author><name>204.186.210.188</name></author>	</entry>

	</feed>