# Difference between revisions of "MD4 hash"

m |
|||

Line 1: | Line 1: | ||

− | 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 | + | 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.<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. | It provides a 128-bit message digest from the data input (the input may be of any length) that is claimed to be unique. | ||

− | [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 | + | [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]. |

− | Both [http://www.faqs.org/rfcs/rfc1320.html MD4] and | + | 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. |

[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. | [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. | ||

[[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++]]). | [[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++]]). |

## Revision as of 14:56, 1 December 2005

An MD4 hash is a unique value given as a result of a mathematical expression following the MD4 algorithm which claims to ensure data integrity.

It provides a 128-bit message digest from the data input (the input may be of any length) that is claimed to be unique.

MD4 was developed by Professor Ronald L. Rivest of MIT and accepted by the RSA on October 1990 and then redesigned on April 1992.

Both MD4 and its successor MD5 (which is an extension of MD4) are optimized for 32-bit machines, while its predecessor MD2 was optimized for 8-bit machines.

MD4 is known to be fast, but possibly not absolutely secure. On the other hand, MD5 is not as fast as the MD4 algorithm, but offers much more assurance of data security.

aMule incorporates the MD4 algorithm based on the Crypto++'s library sources (in some beta aMule v2 releases, it did actually use Crypto++).