http://test.amule.szerverem.hu/w/api.php?action=feedcontributions&feedformat=atom&user=203.217.56.128 2026-04-05T11:03:01Z User contributions MediaWiki 1.23.3 http://test.amule.szerverem.hu/wiki/MD4_hash 2005-12-01T12:56:34Z

<p>203.217.56.128: </p> <hr /> <div>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.&lt;br&gt;<br /> It provides a 128-bit message digest from the data input (the input may be of any length) that is claimed to be unique.<br /> <br /> [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].<br /> <br /> 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.<br /> <br /> [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.<br /> <br /> [[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++]]).</div>

203.217.56.128