MDC-2

In cryptography, MDC-2 (Modification Detection Code 2, sometimes called Meyer–Schilling, standardized in ISO 10118-2) 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.[1] The length of the output hash depends on the underlying block cipher used.

Algorithm

For a given message ${\displaystyle M}$ to hash and a given block cipher encryption function ${\displaystyle E}$, the MDC-2 algorithm proceeds as follows. Let ${\displaystyle n}$ be the block length, ${\displaystyle A_{1},B_{1}}$ two different constants of size ${\displaystyle n}$. If ${\displaystyle M=M_{1}||..||M_{m}}$ where each ${\displaystyle M_{i}}$ has size ${\displaystyle n}$, then the hash ${\displaystyle V_{m}||W_{m}}$ of the message is given by:

• for ${\displaystyle i=1}$ to ${\displaystyle m}$:
  • ${\displaystyle V_{i}=M_{i}\oplus E(M_{i},A_{i})}$
  • ${\displaystyle W_{i}=M_{i}\oplus E(M_{i},B_{i})}$
  • ${\displaystyle V_{i}^{L}||V_{i}^{R}=V_{i}}$
  • ${\displaystyle W_{i}^{L}||W_{i}^{R}=W_{i}}$
  • ${\displaystyle A_{i+1}=V_{i}^{R}||W_{i}^{L}}$
  • ${\displaystyle B_{i+1}=W_{i}^{R}||V_{i}^{L}}$
• return ${\displaystyle A_{m+1}||B_{m+1}}$

MDC-2DES hashes

When MDC-2 uses the DES block cipher, the 128-bit (16-byte) MDC-2 hashes are typically represented as 32-digit hexadecimal numbers. ${\displaystyle A_{1}}$is chosen as the 8-byte string 5252525252525252 and ${\displaystyle B_{1}}$is chosen as the 8-byte string 2525252525252525 (written as hexdigits). Additionally, before each iteration the first byte A[0] of ${\displaystyle A}$ recalculated as (A[0] & 0x9f) ^ 0x20 and the first byte B[0] of ${\displaystyle B}$ is recalculated as (A[0] & 0x9f) ^ 0x20.

The following demonstrates a 43-byte ASCII input (which is padded with five zero-bytes so its length is a multiple of the DES block size of 8 bytes) and the corresponding MDC-2 hash:

 MDC2("The quick brown fox jumps over the lazy dog") 
  = 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 cog") 
  = 775f59f8e51aec29c57ac6ab850d58e8

The hash of the zero-length string is:

 MDC2("") 
  = 52525252525252522525252525252525

Patent issues

MDC-2 was covered by U.S. Patent 4,908,861, issued on March 13, 1990 but filed by IBM on August 28, 1987. Because of patent concerns support for MDC-2 has been disabled in OpenSSL on most Linux distributions and is not implemented by many other cryptographic libraries. It is implemented in GPG's libgcrypt.

The patent was due to expire on August 28, 2007, twenty years after the filing date. It actually expired in 2002[2] because IBM did not pay the renewal fee. The Canadian patent was not renewed and no European patent was granted so MDC-2 can now be freely used.

See also

• One-way compression function

Notes

1. Steinberger, John (June 23, 2007). "The Collision Intractability of MDC-2 in the Ideal-Cipher Model". Advances in Cryptology - EUROCRYPT 2007. Springer-Verlag. pp. 34–51. doi:10.1007/978-3-540-72540-4_3. Retrieved January 31, 2008.
2. "USPTO - Patent Maintenance Fees". United States Patent Office. March 13, 2002. Retrieved 2008-01-31. Cite journal requires |journal= (help) (Click on "Bibliographic data".)