MDC-2

 

In cryptography, MDC-2 (Modification Detection Code 2, sometimes called Meyer-Schilling) is a cryptographic hash function. MDC-2 is a hash function based on a block cipher with a proof of security in the ideal-cipher model. The length of the output hash depends on the underlying block cipher used.

Contents

Algorithm

For a given message M to hash and a given block cipher encryption function E, the MDC-2 algorithm proceeds as follows. Let n be the block length, A_1, B_1 two different constants of size n. If M = M_1||..||M_m where each M_i has size n, then the hash V_m||W_m of the message is given by:

  • for i = 1 to m:
    • V_i = M_i oplus E(M_i,A_i)
    • W_i = M_i oplus E(M_i,B_i)
    • V_i^L || V_i^R = V_i
    • W_i^L || W_i^R = W_i
    • A_{i+1} = V_i^R||W_i^L
    • B_{i+1} = W_i^R||V_i^L
  • return A_{m+1}||B_{m+1}

MDC-2DES hashes

When MDC-2 uses the block cipher, the 128-bit (16-byte) MDC-2 hashes are typically represented as 32-digit numbers. The following demonstrates a 43-byte input and the corresponding MDC-2 hash:

MDC2("The quick brown fox jumps over the lazy og")  = 000ed54e093d61679aefbeae05bfe33a

Even a small change in the message will (with probability) result in a completely different hash, e.g. changing d to c:

MDC2("The quick brown fox jumps over the lazy og")  = 775f59f8e51aec29c57ac6ab850d58e8

The hash of the zero-length string is:

MDC2("")  = 52525252525252522525252525252525

Patent issues

MDC-2 was covered by , issued on March 13, 1990 but filed by IBM on August 28, 1987.
For this reason, support for MDC-2 has been disabled in on most Linux distributions and is not implemented by many other cryptographic libraries.

But the maximum lifespan of 20 years from filing date means that the could not have lasted beyond August 28, 2007 ; in fact it has expired in 2002, because IBM has not paid the renewal fee. The same goes for the Canadian patent. There is no patent for Europe. This means that MDC-2 can be freely used.

See Also on BitcoinWiki

Notes

 

Source

http://wikipedia.org/