Information AboutMd5 |
| CATEGORIES ABOUT MD5 | |
| cryptographic hash functions | |
| checksum algorithms | |
|
MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function, MD4 . In 1996 , a flaw was found with the design of MD5; while it was not a clearly fatal weakness, cryptographers began to recommend using other algorithms, such as SHA-1 (recent claims suggest that SHA-1 has been broken, however). In 2004 , more serious flaws were discovered making further use of the algorithm for security purposes questionable. HISTORY AND CRYPTANALYSIS (one of the inventors of the RSA algorithm) in 1991.]] MD5 is one of a series of message digest algorithms designed by Professor Ronald Rivest of MIT (Rivest, 1994). When analytic work indicated that MD5's predecessor — MD4 — was likely to be insecure, MD5 was designed in 1991 to be a secure replacement (weaknesses were indeed subsequently found in MD4 by Hans Dobbertin ). In 1993, den Boer and Bosselaers gave an early, although limited, result of finding a "pseudo-collision" of the MD5 compression function; that is, two different Initialisation Vector s and with 4-bit difference between them, such that: : In 1996, Dobbertin announced a collision of the compression function of MD5 (Dobbertin, 1996). While this was not an attack on the full MD5 hash function, it was close enough for cryptographers to recommend switching to a replacement, such as WHIRLPOOL , SHA-1 or RIPEMD-160 . The size of the hash — 128 bits — is small enough to contemplate a Birthday Attack . MD5CRK was a Distributed Project started in March 2004 with the aim of demonstrating that MD5 is practically insecure by finding a collision using a birthday attack. However, MD5CRK ended shortly after cluster. On 1 March 2005 , Arjen Lenstra, Xiaoyun Wang, and Benne de Weger demonstrated construction of two X.509 certificates with different public keys and the same MD5 hash, a demonstrably practical collision. The construction included private keys for both public keys. And a few days later, Vlastimil Klima described [http://eprint.iacr.org/2005/075 an improved algorithm, able to construct MD5 collisions in a few hours on a single notebook computer. On 18 March 2006 , Vlastimil Klima published an algorithm {Link without Title} that can find a collision within one minute on a single notebook computer, using a method he calls tunneling. VULNERABILITY Because MD5 makes only one pass over the data, if two prefixes with the same hash can be constructed, a common suffix can be added to both to make the collision more reasonable. And because the current collision-finding techniques allow the preceding hash state to be specified arbitrarily, a collision can be found for any desired prefix—for any given string of characters X, two colliding files can be determined which both begin with X. All that is required to generate two colliding files is a template file, with a 128-byte block of data aligned on a 64-byte boundary, that can be changed freely by the collision-finding algorithm. APPLICATIONS MD5 digests have been widely used in the software world to provide some assurance that a downloaded file has not been altered. A user can compare a published MD5 sum with the Checksum of a downloaded file. Now that it is easy to generate MD5 collisions, though, it is possible for the person who creates the file to create a second file with the same checksum, so this technique cannot protect against some forms of malicious tampering. It is also often the case that the checksum cannot be trusted (for example, it was obtained over the same channel as the downloaded file), in which case MD5 can only provide error-checking functionality: it will recognize a corrupt or incomplete download, which becomes more likely when downloading larger files. MD5 is widely used to store Passwords . A number of MD5 reverse lookup databases exist, which make it easy to decrypt password hashed with plain MD5. To prevent such attacks you can add a Salt to your passwords before hashing them. Also, it is a good idea to apply the hashing function (MD5 in this case) more than once—see Key Strengthening . It increases the time needed to encrypt a password and discourages Dictionary Attack s. ALGORITHM ''s'' denotes a left bit rotation by ''s'' places; ''s'' varies for each operation. denotes addition modulo 232. MD5 processes a variable length message into a fixed-length output of 128 bits. The input message is broken up into chunks of 512-bit blocks; the message is Padded so that its length is divisible by 512. The padding works as follows: first a single bit, 1, is appended to the end of the message. This is followed by as many zeros as are required to bring the length of the message up to 64 bits fewer than a multiple of 512. The remaining bits are filled up with a 64-bit integer representing the length of the original message. The main MD5 algorithm operates on a 128-bit state, divided into four 32-bit words, denoted ''A'', ''B'', ''C'' and ''D''. These are initialized to certain fixed constants. The main algorithm then operates on each 512-bit message block in turn, each block modifying the state. The processing of a message block consists of four similar stages, termed ''rounds''; each round is composed of 16 similar operations based on a non-linear function ''F'', modular addition, and left rotation. Figure 1 illustrates one operation within a round. There are four possible functions ''F'', a different one is used in each round: : : : : denote the XOR, AND, OR and NOT operations respectively. PSEUDOCODE Pseudocode for the MD5 algorithm follows. //''Note: All variables are unsigned 32 bits and wrap modulo 2^32 when calculating'' //''Define r as the following'' var ''int'' {Link without Title} r, k r 0..15 := {7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22} r {Link without Title} := {5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20} r {Link without Title} := {4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23} r {Link without Title} := {6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21} //''Use binary integer part of the sines of integers as constants:'' for i '''from''' 0 '''to''' 63 k {Link without Title} := floor(abs(sin(i + 1)) × 2^32) //''Initialize variables:'' var ''int'' h0 := 0x67452301 var ''int'' h1 := 0xEFCDAB89 var ''int'' h2 := 0x98BADCFE var ''int'' h3 := 0x10325476 //''Pre-processing:'' append "1" bit '''to''' message append "0" bits '''until''' message length in bits ≡ 448 (mod 512) append bit length of message '''as''' ''64-bit little-endian integer'' '''to''' message //''Process the message in successive 512-bit chunks:'' for each ''512-bit'' chunk '''of''' message break chunk into sixteen 32-bit little-endian words w(i), 0 ≤ i ≤ 15 //''Initialize hash value for this chunk:'' var ''int'' a := h0 var ''int'' b := h1 var ''int'' c := h2 var ''int'' d := h3 //''Main loop:'' for i '''from''' 0 '''to''' 63 if 0 ≤ i ≤ 15 '''then''' f := (b and c) '''or''' (('''not''' b) and d) g := i else if 16 ≤ i ≤ 31 f := (d and b) '''or''' (('''not''' d) and c) g := (5×i + 1) mod 16 else if 32 ≤ i ≤ 47 f := b xor c xor d g := (3×i + 5) mod 16 else if 48 ≤ i ≤ 63 f := c xor (b '''or''' ('''not''' d)) g := (7×i) mod 16 temp := d d := c c := b b := ((a + f + k(i) + w(g)) leftrotate r(i)) + b a := temp //''Add this chunk's hash to result so far:'' h0 := h0 + a h1 := h1 + b h2 := h2 + c h3 := h3 + d var ''int'' digest := h0 '''append''' h1 '''append''' h2 '''append''' h3 //''(expressed as little-endian)'' ''Note: Instead of the formulation from the original RFC 1321 shown, the following may be used for improved efficiency:'' (0 ≤ i ≤ 15): f := d xor (b '''and''' (c xor d)) (16 ≤ i ≤ 31): f := c xor (d '''and''' (b xor c)) MD5 HASHES The 128-bit (16-byte) MD5 hashes (also termed ''message digests'') are typically represented as a sequence of 32 Hexadecimal digits. The following demonstrates a 43-byte ASCII input and the corresponding MD5 hash: MD5("The quick brown fox jumps over the lazy dog") = 9e107d9d372bb6826bd81d3542a419d6 Even a small change in the message will (with overwhelming probability) result in a completely different hash, e.g. changing d to c: MD5("The quick brown fox jumps over the lazy cog") = 1055d3e698d289f2af8663725127bd4b The hash of the zero-length string is: MD5("") = d41d8cd98f00b204e9800998ecf8427e SEE ALSO REFERENCES
EXTERNAL LINKS
Collisions
|
|
|