MD4

From CryptoDox, The Online Encyclopedia on Cryptography and Information Security

The MD4 algorithm takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.

The algorithm was developed by Ronald Rivest in 1990.

It is conjectured that it is computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest. The MD4 algorithm is intended for digital signature applications, where a large file must be "compressed" in a secure manner before being encrypted with a private (secret) key under a public-key cryptosystem such as RSA.

The MD4 algorithm is designed to be quite fast on 32-bit machines. In addition, the MD4 algorithm does not require any large substitution tables; the algorithm can be coded quite compactly.

Contents 1 Examples 2 Reference Implementations 3 Attacks on MD4 4 See Also 5 Books of Interest 6 External Links

Examples

MD4("The quick brown fox jumps over the lazy dog") = 1bee69a46ba811185c194762abaeae90

Reference Implementations

• MD4 RFC - C Implementation
• Digest::MD4 - Perl interface to the MD4 Algorithm
• Tcl Support for MD4

Attacks on MD4

• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• MD4 and MD5 Collision Generators

See Also

• Hash Functions
• MD5

Books of Interest

External Links

• MD4 RFC
• What are MD2, MD4, and MD5?
• MD4 at Wikipedia