!!! Overview The MD4 [Message Digest|Message-Digest] Algorithm is a [cryptographic] [Hash Function] developed by Ronald Rivest in 1990.[1] [{$pagename}] digest length is 128 bits. [{$pagename}] has influenced later designs, such as the [MD5], [SHA-1] and [RIPEMD] algorithms. One [MD4] operation : * [{$pagename}] consists of 48 of these operations * grouped in three rounds of 16 operations. * F is a nonlinear function; * one function is used in each round. * Mi denotes a 32-bit block of the message input * Ki denotes a 32-bit constant * different for each operation. The security of [{$pagename}] has been __severely__ compromised and is considered [Cryptographically Weak] and lacks [Collision Resistance]. The first full [collision attack|Vulnerability] against [{$pagename}] was published in 1995 and several newer attacks have been published since then. As of 2007, an attack can generate collisions in less than 2 MD4 hash operations. A theoretical preimage attack also exists. A variant of [{$pagename}] is used in the ed2k URI scheme to provide a unique identifier for a file in the popular eDonkey2000 / eMule P2P networks. [{$pagename}] was also used by the rsync protocol (prior to version 3.0.0.) [{$pagename}] is used to compute [NTLM] password-derived key digests on Microsoft Windows NT, XP, Vista, 7, 8, and 10.[4] !! More Information There might be more information for this subject on one of the following: [{ReferringPagesPlugin before='*' after='\n' }]