PageSourceSearch

https://ztf.im/js/md5.js?v=8.6

js ztf.im collected 2026-10-07 22:39:12 UTC 5,954 bytes, 195 lines download raw bytes

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

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.