<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=MDC-2</id>
	<title>MDC-2 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=MDC-2"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=MDC-2&amp;action=history"/>
	<updated>2026-05-15T12:00:48Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=MDC-2&amp;diff=2434&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;In cryptography, '''MDC-2 (Modification Detection Code 2, sometimes called Meyer-Schilling)''' is a cryptographic hash function. MDC-2 is a One-way compression funct...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=MDC-2&amp;diff=2434&amp;oldid=prev"/>
		<updated>2019-03-22T03:46:10Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;In &lt;a href=&quot;/index.php?title=Cryptography&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Cryptography (page does not exist)&quot;&gt;cryptography&lt;/a&gt;, &amp;#039;&amp;#039;&amp;#039;MDC-2 (Modification Detection Code 2, sometimes called Meyer-Schilling)&amp;#039;&amp;#039;&amp;#039; is a &lt;a href=&quot;/Cryptographic_hash_function&quot; title=&quot;Cryptographic hash function&quot;&gt;cryptographic hash function&lt;/a&gt;. MDC-2 is a One-way compression funct...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[cryptography]], '''MDC-2 (Modification Detection Code 2, sometimes called Meyer-Schilling)''' is a [[cryptographic hash function]]. MDC-2 is a [[One-way compression function|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.&lt;br /&gt;
&lt;br /&gt;
== Algorithm ==&lt;br /&gt;
For a given message &amp;lt;math&amp;gt;M&amp;lt;/math&amp;gt; to hash and a given block cipher encryption function &amp;lt;math&amp;gt;E&amp;lt;/math&amp;gt;, the MDC-2 algorithm proceeds as follows. Let &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; be the block length, &amp;lt;math&amp;gt;A_1, B_1&amp;lt;/math&amp;gt; two different constants of size &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. If &amp;lt;math&amp;gt;M = M_1||..||M_m&amp;lt;/math&amp;gt; where each &amp;lt;math&amp;gt;M_i&amp;lt;/math&amp;gt; has size &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;, then the hash &amp;lt;math&amp;gt;V_m||W_m&amp;lt;/math&amp;gt; of the message is given by:&lt;br /&gt;
*for &amp;lt;math&amp;gt;i = 1&amp;lt;/math&amp;gt; to &amp;lt;math&amp;gt;m&amp;lt;/math&amp;gt;:&lt;br /&gt;
**&amp;lt;math&amp;gt;V_i = M_i \oplus E(M_i,A_i)&amp;lt;/math&amp;gt;&lt;br /&gt;
**&amp;lt;math&amp;gt;W_i = M_i \oplus E(M_i,B_i)&amp;lt;/math&amp;gt;&lt;br /&gt;
**&amp;lt;math&amp;gt;V_i^L || V_i^R = V_i&amp;lt;/math&amp;gt;&lt;br /&gt;
**&amp;lt;math&amp;gt;W_i^L || W_i^R = W_i&amp;lt;/math&amp;gt;&lt;br /&gt;
**&amp;lt;math&amp;gt;A_{i+1} = V_i^R||W_i^L&amp;lt;/math&amp;gt;&lt;br /&gt;
**&amp;lt;math&amp;gt;B_{i+1} = W_i^R||V_i^L&amp;lt;/math&amp;gt;&lt;br /&gt;
*return &amp;lt;math&amp;gt;A_{m+1}||B_{m+1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==MDC-2DES hashes==&lt;br /&gt;
When MDC-2 uses the [[Data Encryption Standard|DES]] block cipher, the 128-bit (16-byte) MDC-2 hashes are typically represented as 32-digit [[hexadecimal]] numbers. The following demonstrates a 43-byte [[ASCII]] input and the corresponding MDC-2 hash:&lt;br /&gt;
&lt;br /&gt;
 MDC2(&amp;quot;The quick brown fox jumps over the lazy og&amp;quot;) &lt;br /&gt;
 = 000ed54e093d61679aefbeae05bfe33a&lt;br /&gt;
&lt;br /&gt;
Even a small change in the message will (with probability) result in a completely different hash, e.g. changing &amp;lt;tt&amp;gt;d&amp;lt;/tt&amp;gt; to &amp;lt;tt&amp;gt;c&amp;lt;/tt&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
 MDC2(&amp;quot;The quick brown fox jumps over the lazy og&amp;quot;) &lt;br /&gt;
 = 775f59f8e51aec29c57ac6ab850d58e8&lt;br /&gt;
&lt;br /&gt;
The hash of the zero-length string is:&lt;br /&gt;
&lt;br /&gt;
 MDC2(&amp;quot;&amp;quot;) &lt;br /&gt;
 = 52525252525252522525252525252525&lt;br /&gt;
&lt;br /&gt;
==Patent issues==&lt;br /&gt;
&lt;br /&gt;
MDC-2 was covered by , issued on March 13, 1990 but filed by [[IBM]] on August 28, 1987.&amp;lt;br /&amp;gt;&lt;br /&gt;
For this reason, support for MDC-2 has been disabled in [[OpenSSL]] on most [[Linux]] distributions and is not implemented by many other cryptographic libraries.&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[One-way compression function]]&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>