https://aimp.ru/forum/Themes/default/scripts/sha1.js

1/*
2 * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
3 * in FIPS PUB 180-1
4 * Version 2.1 Copyright Paul Johnston 2000 - 2002.
5 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
6 * Distributed under the BSD License
7 * See http://pajhome.org.uk/crypt/md5 for details.
8 */
9
10/*
11 * Configurable variables. You may need to tweak these to be compatible with
12 * the server-side, but the defaults work in most cases.
13 */
14var hexcase = 0;  /* hex output format. 0 - lowercase; 1 - uppercase        */
15var b64pad  = ""; /* base-64 pad character. "=" for strict RFC compliance   */
16var chrsz   = 8;  /* bits per input character. 8 - ASCII; 16 - Unicode      */
17
18/*
19 * These are the functions you'll usually want to call
20 * They take string arguments and return either hex or base-64 encoded strings
21 */
22function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}
23function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}
24function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}
25function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}
26function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}
27function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}
28
29/*
30 * Perform a simple self-test to see if the VM is working
31 */
32function sha1_vm_test()
33{
34	return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
35}
36
37/*
38 * Calculate the SHA-1 of an array of big-endian words, and a bit length
39 */
40function core_sha1(x, len)
41{
42	/* append padding */
43	x[len >> 5] |= 0x80 << (24 - len % 32);
44	x[((len + 64 >> 9) << 4) + 15] = len;
45
46	var w = Array(80);
47	var a =  1732584193;
48	var b = -271733879;

49	var c = -1732584194;
50	var d =  271733878;
51	var e = -1009589776;
52
53	for (var i = 0; i < x.length; i += 16)
54	{
55		var olda = a;
56		var oldb = b;
57		var oldc = c;
58		var oldd = d;
59		var olde = e;
60
61		for (var j = 0; j < 80; j++)
62		{
63			if (j < 16) w[j] = x[i + j];
64			else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
65			var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), safe_add(safe_add(e, w[j]), sha1_kt(j)));
66			e = d;
67			d = c;
68			c = rol(b, 30);
69			b = a;
70			a = t;
71		}
72
73		a = safe_add(a, olda);
74		b = safe_add(b, oldb);
75		c = safe_add(c, oldc);
76		d = safe_add(d, oldd);
77		e = safe_add(e, olde);
78	}
79	return Array(a, b, c, d, e);
80}
81
82/*
83 * Perform the appropriate triplet combination function for the current
84 * iteration
85 */
86function sha1_ft(t, b, c, d)
87{
88	if (t < 20) return (b & c) | ((~b) & d);
89	if (t < 40) return b ^ c ^ d;
90	if (t < 60) return (b & c) | (b & d) | (c & d);
91	return b ^ c ^ d;
92}
93
94/*
95 * Determine the appropriate additive constant for the current iteration
96 */
97function sha1_kt(t)
98{
99	return	(t < 20) ?  1518500249 : (t < 40) ? 1859775393 :
100			(t < 60) ? -1894007588 : -899497514;
101}
102
103/*
104 * Calculate the HMAC-SHA1 of a key and some data
105 */
106function core_hmac_sha1(key, data)
107{
108	var bkey = str2binb(key);
109	if (bkey.length >

109 16) bkey = core_sha1(bkey, key.length * chrsz);
110
111	var ipad = Array(16), opad = Array(16);
112	for (var i = 0; i < 16; i++)
113	{
114		ipad[i] = bkey[i] ^ 0x36363636;
115		opad[i] = bkey[i] ^ 0x5C5C5C5C;
116	}
117
118	var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
119	return core_sha1(opad.concat(hash), 512 + 160);
120}
121
122/*
123 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
124 * to work around bugs in some JS interpreters.
125 */
126function safe_add(x, y)
127{
128	var lsw = (x & 0xFFFF) + (y & 0xFFFF);
129	var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
130	return (msw << 16) | (lsw & 0xFFFF);
131}
132
133/*
134 * Bitwise rotate a 32-bit number to the left.
135 */
136function rol(num, cnt)
137{
138	return (num << cnt) | (num >>> (32 - cnt));
139}
140
141/*
142 * Convert an 8-bit or 16-bit string to an array of big-endian words
143 * In 8-bit function, characters >255 have their hi-byte silently ignored.
144 */
145function str2binb(str)
146{
147	var bin = Array();
148
149	for (var i = 0, n = 1 + ((str.length * chrsz) >> 5); i < n; i++)
150		bin[i] = 0;
151
152	var mask = (1 << chrsz) - 1;
153	for (var i = 0; i < str.length * chrsz; i += chrsz)
154		bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - i % 32);
155	return bin;
156}
157
158/*
159 * Convert an array of big-endian words to a string
160 */
161function binb2str(bin)
162{
163	var str = "";
164	var mask = (1 << chrsz) - 1;
165	for (var i = 0; i < bin.length * 32; i += chrsz)
166		str += String.fromCharCode((bin[i>>5] >>> (24 - i%32)) & mask);
167	return str;
168}
169
170/*
171 * Convert an array of big-endian words to a hex string.
172 */
173function binb2hex(binarray)
174{
175	var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
176	var str = "";
177	for (var i = 0; i < binarray.length * 4; i++)
178	{
179		str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
180			   hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8  )) & 0xF);
181	}
182	return str;
183}
184
185/*
186 * Convert an array of big-endian words to a base-64 string
187 */
188function binb2b64(binarray)
189{
190	var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
191	var str = "";
192	for (var i = 0; i < binarray.length * 4; i += 3)
193	{
194		var triplet = (((binarray[i   >> 2] >> 8 * (3 -  i   %4)) & 0xFF) << 16)
195					| (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
196					|  ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);
197		for (var j = 0; j < 4; j++)
198		{
199			if (i * 8 + j * 6 > binarray.length * 32) str += b64pad;
200			else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
201		}
202	}
203	return str;
204}
205