1/* 2 * http://www.myersdaily.org/joseph/javascript/md5-text.html 3 */ 4(function(global) { 5 const md5cycle = function(x, k) { 6 let a = x[0], 7 b = x[1], 8 c = x[2], 9 d = x[3]; 10 11 a = ff(a, b, c, d, k[0], 7, -680876936); 12 d = ff(d, a, b, c, k[1], 12, -389564586); 13 c = ff(c, d, a, b, k[2], 17, 606105819); 14 b = ff(b, c, d, a, k[3], 22, -1044525330); 15 a = ff(a, b, c, d, k[4], 7, -176418897); 16 d = ff(d, a, b, c, k[5], 12, 1200080426); 17 c = ff(c, d, a, b, k[6], 17, -1473231341); 18 b = ff(b, c, d, a, k[7], 22, -45705983); 19 a = ff(a, b, c, d, k[8], 7, 1770035416); 20 d = ff(d, a, b, c, k[9], 12, -1958414417); 21 c = ff(c, d, a, b, k[10], 17, -42063); 22 b = ff(b, c, d, a, k[11], 22, -1990404162); 23 a = ff(a, b, c, d, k[12], 7, 1804603682); 24 d = ff(d, a, b, c, k[13], 12, -40341101); 25 c = ff(c, d, a, b, k[14], 17, -1502002290); 26 b = ff(b, c, d, a, k[15], 22, 1236535329); 27 28 a = gg(a, b, c, d, k[1], 5, -165796510); 29 d = gg(d, a, b, c, k[6], 9, -1069501632); 30 c = gg(c, d, a, b, k[11], 14, 643717713); 31 b = gg(b, c, d, a, k[0], 20, -373897302); 32 a = gg(a, b, c, d, k[5], 5, -701558691); 33 d = gg(d, a, b, c, k[10], 9, 38016083); 34 c = gg(c, d, a, b, k[15], 14, -660478335); 35 b = gg(b, c, d, a, k[4], 20, -405537848); 36 a = gg(a, b, c, d, k[9], 5, 568446438); 37 d = gg(d, a, b, c, k[14], 9, -1019803690); 38 c = gg(c, d, a, b, k[3], 14, -187363961); 39 b = gg(b, c, d, a, k[8], 20, 1163531501); 40 a = gg(a, b, c, d, k[13], 5, -1444681467); 41 d = gg(d, a, b, c, k[2], 9, -51403784); 42 c = gg(c, d, a, b, k[7], 14, 1735328473); 43 b = gg(b, c, d, a, k[12], 20, -1926607734); 44 45 a = hh(a, b, c, d, k[5], 4, -378558); 46 d = hh(d, a, b, c, k[8], 11, -2022574463); 47 c = hh(c, d, a, b, k[11], 16, 1839030562); 48 b = hh(b, c, d, a, k[14], 23, -35309556); 49 a = hh(a, b, c, d, k[1], 4, -1530992060); 50 d = hh(d, a, b, c, k[4], 11, 1272893353); 51 c = hh(c, d, a, b, k[7], 16, -155497632); 52 b = hh(b, c, d, a, k[10], 23, -1094730640); 53 a = hh(a, b, c, d, k[13], 4, 681279174); 54 d = hh(d, a, b, c, k[0], 11, -358537222); 55 c = hh(c, d, a, b, k[3], 16, -722521979); 56 b = hh(b, c, d, a, k[6], 23, 76029189); 57 a = hh(a, b, c, d, k[9], 4, -640364487); 58 d = hh(d, a, b, c, k[12], 11, -421815835); 59 c = hh(c, d, a, b, k[15], 16, 530742520); 60 b = hh(b, c, d, a, k[2], 23, -995338651); 61 62 a = ii(a, b, c, d, k[0], 6, -198630844); 63 d = ii(d, a, b, c, k[7], 10, 1126891415); 64 c = ii(c, d, a, b, k[14], 15, -1416354905); 65 b = ii(b, c, d, a, k[5], 21, -57434055); 66 a = ii(a, b, c, d, k[12], 6, 1700485571); 67 d = ii(d, a, b, c, k[3], 10, -1894986606); 68 c = ii(c, d, a, b, k[10], 15, -1051523); 69 b = ii(b, c, d, a, k[1], 21, -2054922799); 70 a = ii(a, b, c, d, k[8], 6, 1873313359); 71 d = ii(d, a, b, c, k[15], 10, -30611744); 72 c = ii(c, d, a, b, k[6], 15, -1560198380); 73 b = ii(b, c, d, a, k[13], 21, 1309151649); 74 a = ii(a, b, c, d, k[4], 6, -145523070); 75 d = ii(d, a, b, c, k[11], 10, -1120210379); 76 c = ii(c, d, a, b, k[2], 15, 718787259); 77 b = ii(b, c, d, a, k[9], 21, -343485551); 78 79 x[0] = add32(a, x[0]); 80 x[1] = add32(b, x[1]); 81 x[2] = add32(c, x[2]); 82 x[3] = add32(d, x[3]); 83 }; 84 85 const cmn = function(q, a, b, x, s, t) { 86 a = add32(add32(a, q), add32(x, t)); 87 return add32((a << s) | (a >>> (32 - s)), b); 88 }; 89 90 var ff = function(a, b, c, d, x, s, t) { 91 return cmn((b & c) | (~b & d), a, b, x, s, t); 92 }; 93 94 var gg = function(a, b, c, d, x, s, t) { 95 return cmn((b & d) | (c & ~d), a, b, x, s, t); 96 }; 97 98 var hh = function(a, b, c, d, x, s, t) { 99 return cmn(b ^ c ^ d, a, b, x, s, t); 100 }; 101 102 var ii = function(a, b, c, d, x, s, t) { 103 return cmn(c ^ (b | ~d), a, b, x, s, t); 104 }; 105 106 const md51 = function(s) { 107 let txt = "", 108 n = s.length, 109 state = [1732584193, -271733879, -1732584194, 271733878], 110 i; 111 for (i = 64; i <= s.length; i += 64) { 112 md5cycle(state, md5blk(s.substring(i - 64, i))); 113 } 114 s = s.substring(i - 64); 115 const tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; 116 for (i = 0; i < s.length; i++) 117 tail[i >>
117 2] |= s.charCodeAt(i) << (i % 4 << 3); 118 tail[i >> 2] |= 0x80 << (i % 4 << 3); 119 if (i > 55) { 120 md5cycle(state, tail); 121 for (i = 0; i < 16; i++) tail[i] = 0; 122 } 123 tail[14] = n * 8; 124 md5cycle(state, tail); 125 return state; 126 }; 127 128 /* there needs to be support for Unicode here, 129 * unless we pretend that we can redefine the MD-5 130 * algorithm for multi-byte characters (perhaps 131 * by adding every four 16-bit characters and 132 * shortening the sum to 32 bits). Otherwise 133 * I suggest performing MD-5 as if every character 134 * was two bytes--e.g., 0040 0025 = @%--but then 135 * how will an ordinary MD-5 sum be matched? 136 * There is no way to standardize text to something 137 * like UTF-8 before transformation; speed cost is 138 * utterly prohibitive. The JavaScript standard 139 * itself needs to look at this: it should start 140 * providing access to strings as preformed UTF-8 141 * 8-bit unsigned value arrays. 142 */ 143 var md5blk = function(s) { 144 /* I figured global was faster. */ 145 let md5blks = [], 146 i; /* Andy King said do it this way. */ 147 for (i = 0; i < 64; i += 4) { 148 md5blks[i >> 2] = 149 s.charCodeAt(i) + 150 (s.charCodeAt(i + 1) << 8) + 151 (s.charCodeAt(i + 2) << 16) + 152 (s.charCodeAt(i + 3) << 24); 153 } 154 return md5blks; 155 }; 156 157 const hex_chr = "0123456789abcdef".split(""); 158 159 const rhex = function(n) { 160 let s = "", 161 j = 0; 162 for (; j < 4; j++) 163 s += hex_chr[(n >> (j * 8 + 4)) & 0x0f] + hex_chr[(n >> (j * 8)) & 0x0f]; 164 return s; 165 }; 166 167 const hex = function(x) { 168 for (let i = 0; i < x.length; i++) x[i] = rhex(x[i]); 169 return x.join(""); 170 }; 171 172 const md5 = (global.md5 = function(s) { 173 return hex(md51(s)); 174 }); 175 176 /* this function is much faster, 177 so if possible we use it. Some IEs 178 are the only ones I know of that 179 need the idiotic second function, 180 generated by an if clause. */ 181 182 var add32 = function(a, b) { 183 return (a + b) & 0xffffffff; 184 }; 185 186 if (md5("hello") != "5d41402abc4b2a76b9719d911017c592") { 187 var add32 = function(x, y) { 188 const lsw = (x & 0xffff) + (y & 0xffff), 189 msw = (x >> 16) + (y >> 16) + (lsw >> 16); 190 return (msw << 16) | (lsw & 0xffff); 191 }; 192 } 193})(window);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.