对MD5算法简要的叙述可以为:MD5以512位分组来处理输入的信息,且每一分组又被划分为16个32位子分组,经过了一系列的处理后,算法的输出由四个32位分组组成,将这四个32位分组级联后将生成一个128位散列值。
Java代码
1.function MD5(sMessage) {
2.function RotateLeft(lValue, iShiftBits) { return (lValue<<iShiftBits) | (lValue>>>(32-iShiftBits)); }
3.function AddUnsigned(lX,lY) {
4. var lX4,lY4,lX8,lY8,lResult;
5. lX8 = (lX & 0x80000000);
6. lY8 = (lY & 0x80000000);
7. lX4 = (lX & 0x40000000);
8. lY4 = (lY & 0x40000000);
9. lResult = (lX & 0x3FFFFFFF)+(lY & 0x3FFFFFFF);
10. if (lX4 & lY4) return (lResult ^ 0x80000000 ^ lX8 ^ lY8);
11. if (lX4 | lY4) {
12. if (lResult & 0x40000000) return (lResult ^ 0xC0000000 ^ lX8 ^ lY8);
13. else return (lResult ^ 0x40000000 ^ lX8 ^ lY8);
14. } else return (lResult ^ lX8 ^ lY8);
15.}
16.function F(x,y,z) { return (x & y) | ((~x) & z); }
17.function G(x,y,z) { return (x & z) | (y & (~z)); }
18.function H(x,y,z) { return (x ^ y ^ z); }
19.function I(x,y,z) { return (y ^ (x | (~z))); }
20.function FF(a,b,c,d,x,s,ac) {
21. a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac));
22. return AddUnsigned(RotateLeft(a, s), b);
23.}
24.function GG(a,b,c,d,x,s,ac) {
25. a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d>http://www.0771ybyy.com/sunshang/1788.html<), x), ac));
26. return AddUnsigned(RotateLeft(>http://www.0771ybyy.com/sunshang/1789.html<a, s), b);
27.}
28.function HH(a,b,c,d,x,s,ac) {
29. a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac));
30. return AddUnsigned(RotateLeft(a>http://www.0771ybyy.com/zc/1790.html<, s), b);
31.}
32.function II(a,b,c,d,x,s,ac) {
33. a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac));
34. return AddUnsigned(RotateLeft(a, s), b);
35.}
36.function ConvertToWordA>http://www.0771ybyy.com/zc/1791.html<rray(sMessage) {
37. var lWordCount;
38. var lMessageLength = sMessage.length;
39. var lNumberOfWords_temp1=lMessageLength + 8;
40. var lNumberOfWords_temp2=(lNumberOfWords_temp1-(lNumberOfWords_temp1 % 64))/64;
41. var lNumberOfWords = (lNumberOfWords_temp2+1)*16;
42. var lWordArray=Array(lNumberOfWords-1);
43. var lBytePosition = 0;
44. var lByteCount = 0;
45. while ( lByteCount < lMessage>http://www.0771ybyy.com/zc/1792.html<Length ) {
46. lWordCount = (lByteCount-(lByteCount % 4))/4;
47. lBytePosition = (lByteCount % 4)*8;
48. lWordArray[lWordCount]>http://www.0771ybyy.com/zc/1793.html< = (lWordArray[lWordCount] | (sMessage.charCodeAt(lByteCount)<<lBytePosition));
49. lByteCount++;
50. }
51. lWordCount = (lByteCount-(lByteCount % 4))/4;
52. lBytePosition = (lByteCount % 4)*8;
53. lWordArray[lWordCount] =>http://www.0771ybyy.com/zc/1794.html< lWordArray[lWordCount] | (0x80<<lBytePosition);
54. lWordArray[lNumberOfWords-2] = lMessageLength<<3;
55. lWordArray[lNumberOfWords-1]>http://www.0771ybyy.com/zc/1795.html< = lMessageLength>>>29;
56. return lWordArray;
57.}
58.function WordToHex(lValue) {
59. var WordToHexValue="",WordToHexValue_temp="",lByte,lCount;
60. for (lCount = 0;lCount<=3;lCount++) {
61. lByte = (lValue>>>(lCount*8)) & 255;
62. WordToHexValue_temp = "0" >http://www.0771ybyy.com/case/zhichuangjibing/1775.html<+ lByte.toString(16);
63. WordToHexValue = WordToHexValue + WordToHexValue_temp.substr(WordToHexValue_temp.length-2,2);
64. }
65. return WordToHexValue;
66.}
67. var x=Array();
68. var k,AA,BB,CC,DD,a,b,c,d
69. var S11=7, S12=12, S13=17, S14=22;
70. var S21=5, S22=9 , S23=14, S24=20;
71. var S31=4, S32=11, S33=16, S34=23;
72. var S41=6, S42=10, S43=15, S44=21;
73. // Steps 1 and 2. Append padding bits >http://www.0771ybyy.com/case/zhichuangjibing/1776.html<and length and convert to words
74. x = ConvertToWordArray(sMessage);
75. // Step 3. Initialise
76. a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476;
77. // Step 4. Process the message in 16-word blocks
78. for (k=0;k<x.length;k+=16) {
79. AA=a; BB=b; CC=c; DD=d;
80. a=FF(a,b,c,d,x[k+0], S11,0xD76AA478);
81. d=FF(d,a,b,c,x[k+1], S12,0xE8C7B756);
82. c=FF(c,d,a,b,x[k+2], S13,0x242070DB);
83. b=FF(b,c,d,a,x[k+3], S14,0xC1BDCEEE);
84. a=FF(a,b,c,d,x[k+4], S11,0xF57C0FAF);
85. d=FF(d,a,b,c,x[k+5], S12,0x4787C62A);
86. c=FF(c,d,a,b,x[k+6], S13,0xA8304613);
87. b=FF(b,c,d,a,x[k+7], S14,0xFD469501);
88. a=FF(a,b,c,d,x[k+8], S11,0x698098D8);
89. d=FF(d,a,b,c,x[k+9], S12,0x8B44F7AF);
90. c=FF(c,d,a,b,x[k+10],S13,0xFFFF5BB1);
91. b=FF(b,c,d,a,x[k+11],S14,0x895CD7BE);
92. a=FF(a,b,c,d,x[k+12],S11,0x6B901122);
93. d=FF(d,a,b,c,x[k+13],S12,0xFD987193);
94. c=FF(c,d,a,b,x[k+14],S13,0xA679438E);
95. b=FF(b,c,d,a,x[k+15],S14,0x49B40821);
96. a=GG(a,b,c,d,x[k+1], S21,0xF61E2562);
97. d=GG(d,a,b,c,x[k+6], S22,0xC040B340);
98. c=GG(c,d,a,b,x[k+11],S23,0x265E5A51);
99. b=GG(b,c,d,a,x[k+0], S24,0xE9B6C7AA);
100. a=GG(a,b,c,d,x[k+5], S21,0xD62F105D);
101. d=GG(d,a,b,c,x[k+10],S22,0x2441453);
102. c=GG(c,d,a,b,x[k+15],S23,0xD8A1E681);
103. b=GG(b,c,d,a,x[k+4], S24,0xE7D3FBC8);
104. a=GG(a,b,c,d,x[k+9], S21,0x21E1CDE6);
105. d=GG(d,a,b,c,x[k+14],S22,0xC33707D6);
106. c=GG(c,d,a,b,x[k+3], S23,0xF4D50D87);
107. b=GG(b,c,d,a,x[k+8], S24,0x455A14ED);
108. a=GG(a,b,c,d,x[k+13],S21,0xA9E3E905);
109. d=GG(d,a,b,c,x[k+2], S22,0xFCEFA3F8);
110. c=GG(c,d,a,b,x[k+7], S23,0x676F02D9);
111. b=GG(b,c,d,a,x[k+12],S24,0x8D2A4C8A);
112. a=HH(a,b,c,d,x[k+5], S31,0xFFFA3942);
113. d=HH(d,a,b,c,x[k+8], S32,0x8771F681);
114. c=HH(c,d,a,b,x[k+11],S33,0x6D9D6122);
115. b=HH(b,c,d,a,x[k+14],S34,0xFDE5380C);
116. a=HH(a,b,c,d,x[k+1], S31,0xA4BEEA44);
117. d=HH(d,a,b,c,x[k+4], S32,0x4BDECFA9);
118. c=HH(c,d,a,b,x[k+7], S33,0xF6BB4B60);
119. b=HH(b,c,d,a,x[k+10],S34,0xBEBFBC70);
120. a=HH(a,b,c,d,x[k+13],S31,0x289B7EC6);
121. d=HH(d,a,b,c,x[k+0], S32,0xEAA127FA);
122. c=HH(c,d,a,b,x[k+3], S33,0xD4EF3085);
123. b=HH(b,c,d,a,x[k+6], S34,0x4881D05);
124. a=HH(a,b,c,d,x[k+9], S31,0xD9D4D039);
125. d=HH(d,a,b,c,x[k+12],S32,0xE6DB99E5);
126. c=HH(c,d,a,b,x[k+15],S33,0x1FA27CF8);
127. b=HH(b,c,d,a,x[k+2], S34,0xC4AC5665);
128. a=II(a,b,c,d,x[k+0], S41,0xF4292244);
129. d=II(d,a,b,c,x[k+7], S42,0x432AFF97);
130. c=II(c,d,a,b,x[k+14],S43,0xAB9423A7);
131. b=II(b,c,d,a,x[k+5], S44,0xFC93A039);
132. a=II(a,b,c,d,x[k+12],S41,0x655B59C3);
133. d=II(d,a,b,c,x[k+3], S42,0x8F0CCC92);
134. c=II(c,d,a,b,x[k+10],S43,0xFFEFF47D);
135. b=II(b,c,d,a,x[k+1], S44,0x85845DD1);
136. a=II(a,b,c,d,x[k+8], S41,0x6FA87E4F);
137. d=II(d,a,b,c,x[k+15],S42,0xFE2CE6E0);
138. c=II(c,d,a,b,x[k+6], S43,0xA3014314);
139. b=II(b,c,d,a,x[k+13],S44,0x4E0811A1);
140. a=II(a,b,c,d,x[k+4], S41,0xF7537E82);
141. d=II(d,a,b,c,x[k+11],S42,0xBD3AF235);
142. c=II(c,d,a,b,x[k+2], S43,0x2AD7D2BB);
143. b=II(b,c,d,a,x[k+9], S44,0xEB86D391);
144. a=AddUnsigned(a,AA); b=AddUnsigned(b,BB); c=AddUnsigned(c,CC); d=AddUnsigned(d,DD);
145. }
146. // Step 5. Output the 128 bit digest
147. var temp= WordToHex(a)+WordToHex(b)+WordToHex(c)+WordToHex(d);
148. return temp.toLowerCase();
149.}