-
Notifications
You must be signed in to change notification settings - Fork 2
/
index.js
295 lines (239 loc) · 6.21 KB
/
index.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
/**
* component-sha1
*/
/**
* Configurable variables
*/
var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
var b64pad = "="; /* base-64 pad character. "=" for strict RFC compliance */
var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
/**
* Perform a simple self-test to see if the VM is working
*/
var sha1_vm_test = function() {
return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
};
/**
* Calculate the SHA-1 of an array of big-endian words, and a bit length
*/
var core_sha1 = function(x, len) {
/* append padding */
x[len >> 5] |= 0x80 << (24 - len % 32);
x[((len + 64 >> 9) << 4) + 15] = len;
var w = Array(80);
var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;
var e = -1009589776;
var i;
var j;
for(i = 0; i < x.length; i += 16) {
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;
var olde = e;
for(j = 0; j < 80; j += 1) {
if(j < 16) {
w[j] = x[i + j];
} else {
w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
}
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)));
e = d;
d = c;
c = rol(b, 30);
b = a;
a = t;
}
a = safe_add(a, olda);
b = safe_add(b, oldb);
c = safe_add(c, oldc);
d = safe_add(d, oldd);
e = safe_add(e, olde);
}
return Array(a, b, c, d, e);
};
/**
* Perform the appropriate triplet combination function
* for the current iteration
*/
var sha1_ft = function(t, b, c, d) {
if(t < 20) return (b & c) | ((~b) & d);
if(t < 40) return b ^ c ^ d;
if(t < 60) return (b & c) | (b & d) | (c & d);
return b ^ c ^ d;
};
/**
* Determine the appropriate additive constant for the current iteration
*/
var sha1_kt = function(t) {
return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :
(t < 60) ? -1894007588 : -899497514;
};
/**
* Calculate the HMAC-SHA1 of a key and some data
*/
var core_hmac_sha1 = function(key, data) {
var bkey = str2binb(key);
if (bkey.length > 16) {
bkey = core_sha1(bkey, key.length * chrsz);
}
var ipad = Array(16);
var opad = Array(16);
var i;
for (i = 0; i < 16; i += 1) {
ipad[i] = bkey[i] ^ 0x36363636;
opad[i] = bkey[i] ^ 0x5C5C5C5C;
}
var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
return core_sha1(opad.concat(hash), 512 + 160);
};
/**
* Add integers, wrapping at 2^32.
* This uses 16-bit operations internally to work around bugs in some JS interpreters.
*/
var safe_add = function(x, y) {
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
};
/**
* Bitwise rotate a 32-bit number to the left.
*/
var rol = function(num, cnt){
return (num << cnt) | (num >>> (32 - cnt));
};
/**
* Convert an 8-bit or 16-bit string to an array of big-endian words
* In 8-bit function, characters >255 have their hi-byte silently ignored.
*/
var str2binb = function(str) {
var bin = [];
var mask = (1 << chrsz) - 1;
var i;
for(i = 0; i < str.length * chrsz; i += chrsz) {
bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);
}
return bin;
};
/**
* Convert an array of big-endian words to a string
*/
var binb2str = function(bin) {
var str = "";
var mask = (1 << chrsz) - 1;
var i;
for(i = 0; i < bin.length * 32; i += chrsz) {
str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);
}
return str;
};
/*
* Convert an array of big-endian words to a hex string.
*/
var binb2hex = function(binarray) {
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var str = "";
var i;
for(i = 0; i < binarray.length * 4; i += 1) {
str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF);
}
return str;
};
/**
* Convert an array of big-endian words to a base-64 string
*/
var binb2b64 = function(binarray) {
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
var str = "";
var i;
var j;
for(i = 0; i < binarray.length * 4; i += 3) {
var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16)
| (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
| ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);
for(j = 0; j < 4; j += 1) {
if (i * 8 + j * 6 > binarray.length * 32) {
str += b64pad;
} else {
str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
}
}
}
return str;
};
/**
* hex
* Hashes a string using SHA1 and returns a hex representation of it.
*
* @param {String} s
* @returns {String}
* @api public
*/
exports.hex = function(s) {
return binb2hex(core_sha1(str2binb(s), s.length * chrsz));
};
/**
* base64
* Hashes a string using SHA1 and returns a base64 representation of it.
*
* @param {String} s
* @returns {String}
* @api public
*/
exports.base64 = function(s) {
return binb2b64(core_sha1(str2binb(s),s.length * chrsz));
};
/**
* str
* Hashes a string using SHA1 and returns a string representation of it.
*
* @param {String} s
* @returns {String}
* @api public
*/
exports.str = function(s) {
return binb2str(core_sha1(str2binb(s),s.length * chrsz));
};
/**
* hex_hmac
* Calculates the HMAC-SHA1 of a key and some data,
* returning a hex representation of it.
*
* @param {String} key
* @param {String} data
* @returns {String}
* @api public
*/
exports.hex_hmac = function(key, data) {
return binb2hex(core_hmac_sha1(key, data));
};
/**
* base64_hmac
* Calculates the HMAC-SHA1 of a key and some data,
* returning a base64 representation of it.
*
* @param {String} key
* @param {String} data
* @returns {String}
* @api public
*/
exports.base64_hmac = function(key, data) {
return binb2b64(core_hmac_sha1(key, data));
};
/**
* str_hmac
* Calculates the HMAC-SHA1 of a key and some data,
* returning a string representation of it.
*
* @param {String} key
* @param {String} data
* @returns {String}
* @api public
*/
exports.str_hmac = function(key, data) {
return binb2str(core_hmac_sha1(key, data));
};