js-sha3 0.5.3 → 0.5.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/src/sha3.js CHANGED
@@ -1,470 +1,475 @@
1
- /**
2
- * [js-sha3]{@link https://github.com/emn178/js-sha3}
3
- *
4
- * @version 0.5.3
5
- * @author Chen, Yi-Cyuan [emn178@gmail.com]
6
- * @copyright Chen, Yi-Cyuan 2015-2016
7
- * @license MIT
8
- */
9
- (function (root) {
10
- 'use strict';
11
-
12
- var NODE_JS = typeof process == 'object' && process.versions && process.versions.node;
13
- if (NODE_JS) {
14
- root = global;
15
- }
16
- var HEX_CHARS = '0123456789abcdef'.split('');
17
- var SHAKE_PADDING = [31, 7936, 2031616, 520093696];
18
- var KECCAK_PADDING = [1, 256, 65536, 16777216];
19
- var PADDING = [6, 1536, 393216, 100663296];
20
- var SHIFT = [0, 8, 16, 24];
21
- var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,
22
- 0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,
23
- 2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,
24
- 2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,
25
- 2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];
26
- var BITS = [224, 256, 384, 512];
27
- var SHAKE_BITS = [128, 256];
28
- var OUTPUT_TYPES = ['hex', 'buffer', 'array'];
29
-
30
- var createOutputMethod = function (bits, padding, outputType) {
31
- return function (message) {
32
- return new Keccak(bits, padding, bits).update(message)[outputType]();
33
- }
34
- };
35
-
36
- var createShakeOutputMethod = function (bits, padding, outputType) {
37
- return function (message, outputBits) {
38
- return new Keccak(bits, padding, outputBits).update(message)[outputType]();
39
- }
40
- };
41
-
42
- var createMethod = function (bits, padding) {
43
- var method = createOutputMethod(bits, padding, 'hex');
44
- method.create = function () {
45
- return new Keccak(bits, padding, bits);
46
- };
47
- method.update = function (message) {
48
- return method.create().update(message);
49
- };
50
- for (var i = 0;i < OUTPUT_TYPES.length;++i) {
51
- var type = OUTPUT_TYPES[i];
52
- method[type] = createOutputMethod(bits, padding, type);
53
- }
54
- return method;
55
- };
56
-
57
- var createShakeMethod = function (bits, padding) {
58
- var method = createShakeOutputMethod(bits, padding, 'hex');
59
- method.create = function (outputBits) {
60
- return new Keccak(bits, padding, outputBits);
61
- };
62
- method.update = function (message, outputBits) {
63
- return method.create(outputBits).update(message);
64
- };
65
- for (var i = 0;i < OUTPUT_TYPES.length;++i) {
66
- var type = OUTPUT_TYPES[i];
67
- method[type] = createShakeOutputMethod(bits, padding, type);
68
- }
69
- return method;
70
- };
71
-
72
- var algorithms = [
73
- {name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod},
74
- {name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod},
75
- {name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod}
76
- ];
77
-
78
- var methods = {};
79
-
80
- for (var i = 0;i < algorithms.length;++i) {
81
- var algorithm = algorithms[i];
82
- var bits = algorithm.bits;
83
- var createMethod = algorithm.createMethod;
84
- for (var j = 0;j < bits.length;++j) {
85
- var method = algorithm.createMethod(bits[j], algorithm.padding);
86
- methods[algorithm.name +'_' + bits[j]] = method;
87
- }
88
- }
89
-
90
- function Keccak(bits, padding, outputBits) {
91
- this.blocks = [];
92
- this.s = [];
93
- this.padding = padding;
94
- this.outputBits = outputBits;
95
- this.reset = true;
96
- this.block = 0;
97
- this.start = 0;
98
- this.blockCount = (1600 - (bits << 1)) >> 5;
99
- this.byteCount = this.blockCount << 2;
100
- this.outputBlocks = outputBits >> 5;
101
- this.extraBytes = (outputBits & 31) >> 3;
102
-
103
- for (var i = 0;i < 50;++i) {
104
- this.s[i] = 0;
105
- }
106
- };
107
-
108
- Keccak.prototype.update = function (message) {
109
- var notString = typeof message != 'string';
110
- if (notString && message.constructor == root.ArrayBuffer) {
111
- message = new Uint8Array(message);
112
- }
113
- var length = message.length, blocks = this.blocks, byteCount = this.byteCount,
114
- blockCount = this.blockCount, index = 0, s = this.s, i, code;
115
-
116
- while (index < length) {
117
- if (this.reset) {
118
- this.reset = false;
119
- blocks[0] = this.block;
120
- for (i = 1;i < blockCount + 1;++i) {
121
- blocks[i] = 0;
122
- }
123
- }
124
- if (notString) {
125
- for (i = this.start;index < length && i < byteCount;++index) {
126
- blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
127
- }
128
- } else {
129
- for (i = this.start;index < length && i < byteCount;++index) {
130
- code = message.charCodeAt(index);
131
- if (code < 0x80) {
132
- blocks[i >> 2] |= code << SHIFT[i++ & 3];
133
- } else if (code < 0x800) {
134
- blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];
135
- blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
136
- } else if (code < 0xd800 || code >= 0xe000) {
137
- blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];
138
- blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
139
- blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
140
- } else {
141
- code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
142
- blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];
143
- blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];
144
- blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
145
- blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
146
- }
147
- }
148
- }
149
- this.lastByteIndex = i;
150
- if (i >= byteCount) {
151
- this.start = i - byteCount;
152
- this.block = blocks[blockCount];
153
- for (i = 0;i < blockCount;++i) {
154
- s[i] ^= blocks[i];
155
- }
156
- f(s);
157
- this.reset = true;
158
- } else {
159
- this.start = i;
160
- }
161
- }
162
- return this;
163
- };
164
-
165
- Keccak.prototype.finalize = function () {
166
- var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;
167
- blocks[i >> 2] |= this.padding[i & 3];
168
- if (this.lastByteIndex == this.byteCount) {
169
- blocks[0] = blocks[blockCount];
170
- for (i = 1;i < blockCount + 1;++i) {
171
- blocks[i] = 0;
172
- }
173
- }
174
- blocks[blockCount - 1] |= 0x80000000;
175
- for (i = 0;i < blockCount;++i) {
176
- s[i] ^= blocks[i];
177
- }
178
- f(s);
179
- };
180
-
181
- Keccak.prototype.toString = Keccak.prototype.hex = function () {
182
- this.finalize();
183
-
184
- var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
185
- extraBytes = this.extraBytes, i = 0, j = 0;
186
- var hex = '', block;
187
- while (j < outputBlocks) {
188
- for (i = 0;i < blockCount && j < outputBlocks;++i, ++j) {
189
- block = s[i];
190
- hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +
191
- HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +
192
- HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +
193
- HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];
194
- }
195
- if (j % blockCount == 0) {
196
- f(s);
197
- i = 0;
198
- }
199
- }
200
- if (extraBytes) {
201
- block = s[i];
202
- if (extraBytes > 0) {
203
- hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];
204
- }
205
- if (extraBytes > 1) {
206
- hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];
207
- }
208
- if (extraBytes > 2) {
209
- hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];
210
- }
211
- }
212
- return hex;
213
- };
214
-
215
- Keccak.prototype.buffer = function () {
216
- this.finalize();
217
-
218
- var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
219
- extraBytes = this.extraBytes, i = 0, j = 0;
220
- var bytes = this.outputBits >> 3;
221
- var buffer;
222
- if (extraBytes) {
223
- buffer = new ArrayBuffer((outputBlocks + 1) << 2);
224
- } else {
225
- buffer = new ArrayBuffer(bytes);
226
- }
227
- var array = new Uint32Array(buffer);
228
- while (j < outputBlocks) {
229
- for (i = 0;i < blockCount && j < outputBlocks;++i, ++j) {
230
- array[j] = s[i];
231
- }
232
- if (j % blockCount == 0) {
233
- f(s);
234
- }
235
- }
236
- if (extraBytes) {
237
- array[i] = s[i];
238
- buffer = buffer.slice(0, bytes);
239
- }
240
- return buffer;
241
- };
242
-
243
- Keccak.prototype.digest = Keccak.prototype.array = function () {
244
- this.finalize();
245
-
246
- var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
247
- extraBytes = this.extraBytes, i = 0, j = 0;
248
- var array = [], offset, block;
249
- while (j < outputBlocks) {
250
- for (i = 0;i < blockCount && j < outputBlocks;++i, ++j) {
251
- offset = j << 2;
252
- block = s[i];
253
- array[offset] = block & 0xFF;
254
- array[offset + 1] = (block >> 8) & 0xFF;
255
- array[offset + 2] = (block >> 16) & 0xFF;
256
- array[offset + 3] = (block >> 24) & 0xFF;
257
- }
258
- if (j % blockCount == 0) {
259
- f(s);
260
- }
261
- }
262
- if (extraBytes) {
263
- offset = j << 2;
264
- block = s[i];
265
- if (extraBytes > 0) {
266
- array[offset] = block & 0xFF;
267
- }
268
- if (extraBytes > 1) {
269
- array[offset + 1] = (block >> 8) & 0xFF;
270
- }
271
- if (extraBytes > 2) {
272
- array[offset + 2] = (block >> 16) & 0xFF;
273
- }
274
- }
275
- return array;
276
- };
277
-
278
- var f = function (s) {
279
- var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,
280
- b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,
281
- b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,
282
- b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;
283
- for (n = 0;n < 48;n += 2) {
284
- c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];
285
- c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];
286
- c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];
287
- c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];
288
- c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];
289
- c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];
290
- c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];
291
- c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];
292
- c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];
293
- c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];
294
-
295
- h = c8 ^ ((c2 << 1) | (c3 >>> 31));
296
- l = c9 ^ ((c3 << 1) | (c2 >>> 31));
297
- s[0] ^= h;
298
- s[1] ^= l;
299
- s[10] ^= h;
300
- s[11] ^= l;
301
- s[20] ^= h;
302
- s[21] ^= l;
303
- s[30] ^= h;
304
- s[31] ^= l;
305
- s[40] ^= h;
306
- s[41] ^= l;
307
- h = c0 ^ ((c4 << 1) | (c5 >>> 31));
308
- l = c1 ^ ((c5 << 1) | (c4 >>> 31));
309
- s[2] ^= h;
310
- s[3] ^= l;
311
- s[12] ^= h;
312
- s[13] ^= l;
313
- s[22] ^= h;
314
- s[23] ^= l;
315
- s[32] ^= h;
316
- s[33] ^= l;
317
- s[42] ^= h;
318
- s[43] ^= l;
319
- h = c2 ^ ((c6 << 1) | (c7 >>> 31));
320
- l = c3 ^ ((c7 << 1) | (c6 >>> 31));
321
- s[4] ^= h;
322
- s[5] ^= l;
323
- s[14] ^= h;
324
- s[15] ^= l;
325
- s[24] ^= h;
326
- s[25] ^= l;
327
- s[34] ^= h;
328
- s[35] ^= l;
329
- s[44] ^= h;
330
- s[45] ^= l;
331
- h = c4 ^ ((c8 << 1) | (c9 >>> 31));
332
- l = c5 ^ ((c9 << 1) | (c8 >>> 31));
333
- s[6] ^= h;
334
- s[7] ^= l;
335
- s[16] ^= h;
336
- s[17] ^= l;
337
- s[26] ^= h;
338
- s[27] ^= l;
339
- s[36] ^= h;
340
- s[37] ^= l;
341
- s[46] ^= h;
342
- s[47] ^= l;
343
- h = c6 ^ ((c0 << 1) | (c1 >>> 31));
344
- l = c7 ^ ((c1 << 1) | (c0 >>> 31));
345
- s[8] ^= h;
346
- s[9] ^= l;
347
- s[18] ^= h;
348
- s[19] ^= l;
349
- s[28] ^= h;
350
- s[29] ^= l;
351
- s[38] ^= h;
352
- s[39] ^= l;
353
- s[48] ^= h;
354
- s[49] ^= l;
355
-
356
- b0 = s[0];
357
- b1 = s[1];
358
- b32 = (s[11] << 4) | (s[10] >>> 28);
359
- b33 = (s[10] << 4) | (s[11] >>> 28);
360
- b14 = (s[20] << 3) | (s[21] >>> 29);
361
- b15 = (s[21] << 3) | (s[20] >>> 29);
362
- b46 = (s[31] << 9) | (s[30] >>> 23);
363
- b47 = (s[30] << 9) | (s[31] >>> 23);
364
- b28 = (s[40] << 18) | (s[41] >>> 14);
365
- b29 = (s[41] << 18) | (s[40] >>> 14);
366
- b20 = (s[2] << 1) | (s[3] >>> 31);
367
- b21 = (s[3] << 1) | (s[2] >>> 31);
368
- b2 = (s[13] << 12) | (s[12] >>> 20);
369
- b3 = (s[12] << 12) | (s[13] >>> 20);
370
- b34 = (s[22] << 10) | (s[23] >>> 22);
371
- b35 = (s[23] << 10) | (s[22] >>> 22);
372
- b16 = (s[33] << 13) | (s[32] >>> 19);
373
- b17 = (s[32] << 13) | (s[33] >>> 19);
374
- b48 = (s[42] << 2) | (s[43] >>> 30);
375
- b49 = (s[43] << 2) | (s[42] >>> 30);
376
- b40 = (s[5] << 30) | (s[4] >>> 2);
377
- b41 = (s[4] << 30) | (s[5] >>> 2);
378
- b22 = (s[14] << 6) | (s[15] >>> 26);
379
- b23 = (s[15] << 6) | (s[14] >>> 26);
380
- b4 = (s[25] << 11) | (s[24] >>> 21);
381
- b5 = (s[24] << 11) | (s[25] >>> 21);
382
- b36 = (s[34] << 15) | (s[35] >>> 17);
383
- b37 = (s[35] << 15) | (s[34] >>> 17);
384
- b18 = (s[45] << 29) | (s[44] >>> 3);
385
- b19 = (s[44] << 29) | (s[45] >>> 3);
386
- b10 = (s[6] << 28) | (s[7] >>> 4);
387
- b11 = (s[7] << 28) | (s[6] >>> 4);
388
- b42 = (s[17] << 23) | (s[16] >>> 9);
389
- b43 = (s[16] << 23) | (s[17] >>> 9);
390
- b24 = (s[26] << 25) | (s[27] >>> 7);
391
- b25 = (s[27] << 25) | (s[26] >>> 7);
392
- b6 = (s[36] << 21) | (s[37] >>> 11);
393
- b7 = (s[37] << 21) | (s[36] >>> 11);
394
- b38 = (s[47] << 24) | (s[46] >>> 8);
395
- b39 = (s[46] << 24) | (s[47] >>> 8);
396
- b30 = (s[8] << 27) | (s[9] >>> 5);
397
- b31 = (s[9] << 27) | (s[8] >>> 5);
398
- b12 = (s[18] << 20) | (s[19] >>> 12);
399
- b13 = (s[19] << 20) | (s[18] >>> 12);
400
- b44 = (s[29] << 7) | (s[28] >>> 25);
401
- b45 = (s[28] << 7) | (s[29] >>> 25);
402
- b26 = (s[38] << 8) | (s[39] >>> 24);
403
- b27 = (s[39] << 8) | (s[38] >>> 24);
404
- b8 = (s[48] << 14) | (s[49] >>> 18);
405
- b9 = (s[49] << 14) | (s[48] >>> 18);
406
-
407
- s[0] = b0 ^ (~b2 & b4);
408
- s[1] = b1 ^ (~b3 & b5);
409
- s[10] = b10 ^ (~b12 & b14);
410
- s[11] = b11 ^ (~b13 & b15);
411
- s[20] = b20 ^ (~b22 & b24);
412
- s[21] = b21 ^ (~b23 & b25);
413
- s[30] = b30 ^ (~b32 & b34);
414
- s[31] = b31 ^ (~b33 & b35);
415
- s[40] = b40 ^ (~b42 & b44);
416
- s[41] = b41 ^ (~b43 & b45);
417
- s[2] = b2 ^ (~b4 & b6);
418
- s[3] = b3 ^ (~b5 & b7);
419
- s[12] = b12 ^ (~b14 & b16);
420
- s[13] = b13 ^ (~b15 & b17);
421
- s[22] = b22 ^ (~b24 & b26);
422
- s[23] = b23 ^ (~b25 & b27);
423
- s[32] = b32 ^ (~b34 & b36);
424
- s[33] = b33 ^ (~b35 & b37);
425
- s[42] = b42 ^ (~b44 & b46);
426
- s[43] = b43 ^ (~b45 & b47);
427
- s[4] = b4 ^ (~b6 & b8);
428
- s[5] = b5 ^ (~b7 & b9);
429
- s[14] = b14 ^ (~b16 & b18);
430
- s[15] = b15 ^ (~b17 & b19);
431
- s[24] = b24 ^ (~b26 & b28);
432
- s[25] = b25 ^ (~b27 & b29);
433
- s[34] = b34 ^ (~b36 & b38);
434
- s[35] = b35 ^ (~b37 & b39);
435
- s[44] = b44 ^ (~b46 & b48);
436
- s[45] = b45 ^ (~b47 & b49);
437
- s[6] = b6 ^ (~b8 & b0);
438
- s[7] = b7 ^ (~b9 & b1);
439
- s[16] = b16 ^ (~b18 & b10);
440
- s[17] = b17 ^ (~b19 & b11);
441
- s[26] = b26 ^ (~b28 & b20);
442
- s[27] = b27 ^ (~b29 & b21);
443
- s[36] = b36 ^ (~b38 & b30);
444
- s[37] = b37 ^ (~b39 & b31);
445
- s[46] = b46 ^ (~b48 & b40);
446
- s[47] = b47 ^ (~b49 & b41);
447
- s[8] = b8 ^ (~b0 & b2);
448
- s[9] = b9 ^ (~b1 & b3);
449
- s[18] = b18 ^ (~b10 & b12);
450
- s[19] = b19 ^ (~b11 & b13);
451
- s[28] = b28 ^ (~b20 & b22);
452
- s[29] = b29 ^ (~b21 & b23);
453
- s[38] = b38 ^ (~b30 & b32);
454
- s[39] = b39 ^ (~b31 & b33);
455
- s[48] = b48 ^ (~b40 & b42);
456
- s[49] = b49 ^ (~b41 & b43);
457
-
458
- s[0] ^= RC[n];
459
- s[1] ^= RC[n + 1];
460
- }
461
- }
462
-
463
- if (!root.JS_SHA3_TEST && NODE_JS) {
464
- module.exports = methods;
465
- } else if (root) {
466
- for (var key in methods) {
467
- root[key] = methods[key];
468
- }
469
- }
470
- }(this));
1
+ /**
2
+ * [js-sha3]{@link https://github.com/emn178/js-sha3}
3
+ *
4
+ * @version 0.5.7
5
+ * @author Chen, Yi-Cyuan [emn178@gmail.com]
6
+ * @copyright Chen, Yi-Cyuan 2015-2016
7
+ * @license MIT
8
+ */
9
+ /*jslint bitwise: true */
10
+ (function () {
11
+ 'use strict';
12
+
13
+ var root = typeof window === 'object' ? window : {};
14
+ var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;
15
+ if (NODE_JS) {
16
+ root = global;
17
+ }
18
+ var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;
19
+ var HEX_CHARS = '0123456789abcdef'.split('');
20
+ var SHAKE_PADDING = [31, 7936, 2031616, 520093696];
21
+ var KECCAK_PADDING = [1, 256, 65536, 16777216];
22
+ var PADDING = [6, 1536, 393216, 100663296];
23
+ var SHIFT = [0, 8, 16, 24];
24
+ var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,
25
+ 0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,
26
+ 2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,
27
+ 2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,
28
+ 2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];
29
+ var BITS = [224, 256, 384, 512];
30
+ var SHAKE_BITS = [128, 256];
31
+ var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array'];
32
+
33
+ var createOutputMethod = function (bits, padding, outputType) {
34
+ return function (message) {
35
+ return new Keccak(bits, padding, bits).update(message)[outputType]();
36
+ };
37
+ };
38
+
39
+ var createShakeOutputMethod = function (bits, padding, outputType) {
40
+ return function (message, outputBits) {
41
+ return new Keccak(bits, padding, outputBits).update(message)[outputType]();
42
+ };
43
+ };
44
+
45
+ var createMethod = function (bits, padding) {
46
+ var method = createOutputMethod(bits, padding, 'hex');
47
+ method.create = function () {
48
+ return new Keccak(bits, padding, bits);
49
+ };
50
+ method.update = function (message) {
51
+ return method.create().update(message);
52
+ };
53
+ for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
54
+ var type = OUTPUT_TYPES[i];
55
+ method[type] = createOutputMethod(bits, padding, type);
56
+ }
57
+ return method;
58
+ };
59
+
60
+ var createShakeMethod = function (bits, padding) {
61
+ var method = createShakeOutputMethod(bits, padding, 'hex');
62
+ method.create = function (outputBits) {
63
+ return new Keccak(bits, padding, outputBits);
64
+ };
65
+ method.update = function (message, outputBits) {
66
+ return method.create(outputBits).update(message);
67
+ };
68
+ for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
69
+ var type = OUTPUT_TYPES[i];
70
+ method[type] = createShakeOutputMethod(bits, padding, type);
71
+ }
72
+ return method;
73
+ };
74
+
75
+ var algorithms = [
76
+ {name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod},
77
+ {name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod},
78
+ {name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod}
79
+ ];
80
+
81
+ var methods = {}, methodNames = [];
82
+
83
+ for (var i = 0; i < algorithms.length; ++i) {
84
+ var algorithm = algorithms[i];
85
+ var bits = algorithm.bits;
86
+ for (var j = 0; j < bits.length; ++j) {
87
+ var methodName = algorithm.name +'_' + bits[j];
88
+ methodNames.push(methodName);
89
+ methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);
90
+ }
91
+ }
92
+
93
+ function Keccak(bits, padding, outputBits) {
94
+ this.blocks = [];
95
+ this.s = [];
96
+ this.padding = padding;
97
+ this.outputBits = outputBits;
98
+ this.reset = true;
99
+ this.block = 0;
100
+ this.start = 0;
101
+ this.blockCount = (1600 - (bits << 1)) >> 5;
102
+ this.byteCount = this.blockCount << 2;
103
+ this.outputBlocks = outputBits >> 5;
104
+ this.extraBytes = (outputBits & 31) >> 3;
105
+
106
+ for (var i = 0; i < 50; ++i) {
107
+ this.s[i] = 0;
108
+ }
109
+ }
110
+
111
+ Keccak.prototype.update = function (message) {
112
+ var notString = typeof message !== 'string';
113
+ if (notString && message.constructor === ArrayBuffer) {
114
+ message = new Uint8Array(message);
115
+ }
116
+ var length = message.length, blocks = this.blocks, byteCount = this.byteCount,
117
+ blockCount = this.blockCount, index = 0, s = this.s, i, code;
118
+
119
+ while (index < length) {
120
+ if (this.reset) {
121
+ this.reset = false;
122
+ blocks[0] = this.block;
123
+ for (i = 1; i < blockCount + 1; ++i) {
124
+ blocks[i] = 0;
125
+ }
126
+ }
127
+ if (notString) {
128
+ for (i = this.start; index < length && i < byteCount; ++index) {
129
+ blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
130
+ }
131
+ } else {
132
+ for (i = this.start; index < length && i < byteCount; ++index) {
133
+ code = message.charCodeAt(index);
134
+ if (code < 0x80) {
135
+ blocks[i >> 2] |= code << SHIFT[i++ & 3];
136
+ } else if (code < 0x800) {
137
+ blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];
138
+ blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
139
+ } else if (code < 0xd800 || code >= 0xe000) {
140
+ blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];
141
+ blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
142
+ blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
143
+ } else {
144
+ code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
145
+ blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];
146
+ blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];
147
+ blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
148
+ blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
149
+ }
150
+ }
151
+ }
152
+ this.lastByteIndex = i;
153
+ if (i >= byteCount) {
154
+ this.start = i - byteCount;
155
+ this.block = blocks[blockCount];
156
+ for (i = 0; i < blockCount; ++i) {
157
+ s[i] ^= blocks[i];
158
+ }
159
+ f(s);
160
+ this.reset = true;
161
+ } else {
162
+ this.start = i;
163
+ }
164
+ }
165
+ return this;
166
+ };
167
+
168
+ Keccak.prototype.finalize = function () {
169
+ var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;
170
+ blocks[i >> 2] |= this.padding[i & 3];
171
+ if (this.lastByteIndex === this.byteCount) {
172
+ blocks[0] = blocks[blockCount];
173
+ for (i = 1; i < blockCount + 1; ++i) {
174
+ blocks[i] = 0;
175
+ }
176
+ }
177
+ blocks[blockCount - 1] |= 0x80000000;
178
+ for (i = 0; i < blockCount; ++i) {
179
+ s[i] ^= blocks[i];
180
+ }
181
+ f(s);
182
+ };
183
+
184
+ Keccak.prototype.toString = Keccak.prototype.hex = function () {
185
+ this.finalize();
186
+
187
+ var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
188
+ extraBytes = this.extraBytes, i = 0, j = 0;
189
+ var hex = '', block;
190
+ while (j < outputBlocks) {
191
+ for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
192
+ block = s[i];
193
+ hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +
194
+ HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +
195
+ HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +
196
+ HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];
197
+ }
198
+ if (j % blockCount === 0) {
199
+ f(s);
200
+ i = 0;
201
+ }
202
+ }
203
+ if (extraBytes) {
204
+ block = s[i];
205
+ if (extraBytes > 0) {
206
+ hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];
207
+ }
208
+ if (extraBytes > 1) {
209
+ hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];
210
+ }
211
+ if (extraBytes > 2) {
212
+ hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];
213
+ }
214
+ }
215
+ return hex;
216
+ };
217
+
218
+ Keccak.prototype.arrayBuffer = function () {
219
+ this.finalize();
220
+
221
+ var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
222
+ extraBytes = this.extraBytes, i = 0, j = 0;
223
+ var bytes = this.outputBits >> 3;
224
+ var buffer;
225
+ if (extraBytes) {
226
+ buffer = new ArrayBuffer((outputBlocks + 1) << 2);
227
+ } else {
228
+ buffer = new ArrayBuffer(bytes);
229
+ }
230
+ var array = new Uint32Array(buffer);
231
+ while (j < outputBlocks) {
232
+ for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
233
+ array[j] = s[i];
234
+ }
235
+ if (j % blockCount === 0) {
236
+ f(s);
237
+ }
238
+ }
239
+ if (extraBytes) {
240
+ array[i] = s[i];
241
+ buffer = buffer.slice(0, bytes);
242
+ }
243
+ return buffer;
244
+ };
245
+
246
+ Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;
247
+
248
+ Keccak.prototype.digest = Keccak.prototype.array = function () {
249
+ this.finalize();
250
+
251
+ var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
252
+ extraBytes = this.extraBytes, i = 0, j = 0;
253
+ var array = [], offset, block;
254
+ while (j < outputBlocks) {
255
+ for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
256
+ offset = j << 2;
257
+ block = s[i];
258
+ array[offset] = block & 0xFF;
259
+ array[offset + 1] = (block >> 8) & 0xFF;
260
+ array[offset + 2] = (block >> 16) & 0xFF;
261
+ array[offset + 3] = (block >> 24) & 0xFF;
262
+ }
263
+ if (j % blockCount === 0) {
264
+ f(s);
265
+ }
266
+ }
267
+ if (extraBytes) {
268
+ offset = j << 2;
269
+ block = s[i];
270
+ if (extraBytes > 0) {
271
+ array[offset] = block & 0xFF;
272
+ }
273
+ if (extraBytes > 1) {
274
+ array[offset + 1] = (block >> 8) & 0xFF;
275
+ }
276
+ if (extraBytes > 2) {
277
+ array[offset + 2] = (block >> 16) & 0xFF;
278
+ }
279
+ }
280
+ return array;
281
+ };
282
+
283
+ var f = function (s) {
284
+ var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,
285
+ b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,
286
+ b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,
287
+ b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;
288
+ for (n = 0; n < 48; n += 2) {
289
+ c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];
290
+ c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];
291
+ c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];
292
+ c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];
293
+ c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];
294
+ c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];
295
+ c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];
296
+ c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];
297
+ c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];
298
+ c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];
299
+
300
+ h = c8 ^ ((c2 << 1) | (c3 >>> 31));
301
+ l = c9 ^ ((c3 << 1) | (c2 >>> 31));
302
+ s[0] ^= h;
303
+ s[1] ^= l;
304
+ s[10] ^= h;
305
+ s[11] ^= l;
306
+ s[20] ^= h;
307
+ s[21] ^= l;
308
+ s[30] ^= h;
309
+ s[31] ^= l;
310
+ s[40] ^= h;
311
+ s[41] ^= l;
312
+ h = c0 ^ ((c4 << 1) | (c5 >>> 31));
313
+ l = c1 ^ ((c5 << 1) | (c4 >>> 31));
314
+ s[2] ^= h;
315
+ s[3] ^= l;
316
+ s[12] ^= h;
317
+ s[13] ^= l;
318
+ s[22] ^= h;
319
+ s[23] ^= l;
320
+ s[32] ^= h;
321
+ s[33] ^= l;
322
+ s[42] ^= h;
323
+ s[43] ^= l;
324
+ h = c2 ^ ((c6 << 1) | (c7 >>> 31));
325
+ l = c3 ^ ((c7 << 1) | (c6 >>> 31));
326
+ s[4] ^= h;
327
+ s[5] ^= l;
328
+ s[14] ^= h;
329
+ s[15] ^= l;
330
+ s[24] ^= h;
331
+ s[25] ^= l;
332
+ s[34] ^= h;
333
+ s[35] ^= l;
334
+ s[44] ^= h;
335
+ s[45] ^= l;
336
+ h = c4 ^ ((c8 << 1) | (c9 >>> 31));
337
+ l = c5 ^ ((c9 << 1) | (c8 >>> 31));
338
+ s[6] ^= h;
339
+ s[7] ^= l;
340
+ s[16] ^= h;
341
+ s[17] ^= l;
342
+ s[26] ^= h;
343
+ s[27] ^= l;
344
+ s[36] ^= h;
345
+ s[37] ^= l;
346
+ s[46] ^= h;
347
+ s[47] ^= l;
348
+ h = c6 ^ ((c0 << 1) | (c1 >>> 31));
349
+ l = c7 ^ ((c1 << 1) | (c0 >>> 31));
350
+ s[8] ^= h;
351
+ s[9] ^= l;
352
+ s[18] ^= h;
353
+ s[19] ^= l;
354
+ s[28] ^= h;
355
+ s[29] ^= l;
356
+ s[38] ^= h;
357
+ s[39] ^= l;
358
+ s[48] ^= h;
359
+ s[49] ^= l;
360
+
361
+ b0 = s[0];
362
+ b1 = s[1];
363
+ b32 = (s[11] << 4) | (s[10] >>> 28);
364
+ b33 = (s[10] << 4) | (s[11] >>> 28);
365
+ b14 = (s[20] << 3) | (s[21] >>> 29);
366
+ b15 = (s[21] << 3) | (s[20] >>> 29);
367
+ b46 = (s[31] << 9) | (s[30] >>> 23);
368
+ b47 = (s[30] << 9) | (s[31] >>> 23);
369
+ b28 = (s[40] << 18) | (s[41] >>> 14);
370
+ b29 = (s[41] << 18) | (s[40] >>> 14);
371
+ b20 = (s[2] << 1) | (s[3] >>> 31);
372
+ b21 = (s[3] << 1) | (s[2] >>> 31);
373
+ b2 = (s[13] << 12) | (s[12] >>> 20);
374
+ b3 = (s[12] << 12) | (s[13] >>> 20);
375
+ b34 = (s[22] << 10) | (s[23] >>> 22);
376
+ b35 = (s[23] << 10) | (s[22] >>> 22);
377
+ b16 = (s[33] << 13) | (s[32] >>> 19);
378
+ b17 = (s[32] << 13) | (s[33] >>> 19);
379
+ b48 = (s[42] << 2) | (s[43] >>> 30);
380
+ b49 = (s[43] << 2) | (s[42] >>> 30);
381
+ b40 = (s[5] << 30) | (s[4] >>> 2);
382
+ b41 = (s[4] << 30) | (s[5] >>> 2);
383
+ b22 = (s[14] << 6) | (s[15] >>> 26);
384
+ b23 = (s[15] << 6) | (s[14] >>> 26);
385
+ b4 = (s[25] << 11) | (s[24] >>> 21);
386
+ b5 = (s[24] << 11) | (s[25] >>> 21);
387
+ b36 = (s[34] << 15) | (s[35] >>> 17);
388
+ b37 = (s[35] << 15) | (s[34] >>> 17);
389
+ b18 = (s[45] << 29) | (s[44] >>> 3);
390
+ b19 = (s[44] << 29) | (s[45] >>> 3);
391
+ b10 = (s[6] << 28) | (s[7] >>> 4);
392
+ b11 = (s[7] << 28) | (s[6] >>> 4);
393
+ b42 = (s[17] << 23) | (s[16] >>> 9);
394
+ b43 = (s[16] << 23) | (s[17] >>> 9);
395
+ b24 = (s[26] << 25) | (s[27] >>> 7);
396
+ b25 = (s[27] << 25) | (s[26] >>> 7);
397
+ b6 = (s[36] << 21) | (s[37] >>> 11);
398
+ b7 = (s[37] << 21) | (s[36] >>> 11);
399
+ b38 = (s[47] << 24) | (s[46] >>> 8);
400
+ b39 = (s[46] << 24) | (s[47] >>> 8);
401
+ b30 = (s[8] << 27) | (s[9] >>> 5);
402
+ b31 = (s[9] << 27) | (s[8] >>> 5);
403
+ b12 = (s[18] << 20) | (s[19] >>> 12);
404
+ b13 = (s[19] << 20) | (s[18] >>> 12);
405
+ b44 = (s[29] << 7) | (s[28] >>> 25);
406
+ b45 = (s[28] << 7) | (s[29] >>> 25);
407
+ b26 = (s[38] << 8) | (s[39] >>> 24);
408
+ b27 = (s[39] << 8) | (s[38] >>> 24);
409
+ b8 = (s[48] << 14) | (s[49] >>> 18);
410
+ b9 = (s[49] << 14) | (s[48] >>> 18);
411
+
412
+ s[0] = b0 ^ (~b2 & b4);
413
+ s[1] = b1 ^ (~b3 & b5);
414
+ s[10] = b10 ^ (~b12 & b14);
415
+ s[11] = b11 ^ (~b13 & b15);
416
+ s[20] = b20 ^ (~b22 & b24);
417
+ s[21] = b21 ^ (~b23 & b25);
418
+ s[30] = b30 ^ (~b32 & b34);
419
+ s[31] = b31 ^ (~b33 & b35);
420
+ s[40] = b40 ^ (~b42 & b44);
421
+ s[41] = b41 ^ (~b43 & b45);
422
+ s[2] = b2 ^ (~b4 & b6);
423
+ s[3] = b3 ^ (~b5 & b7);
424
+ s[12] = b12 ^ (~b14 & b16);
425
+ s[13] = b13 ^ (~b15 & b17);
426
+ s[22] = b22 ^ (~b24 & b26);
427
+ s[23] = b23 ^ (~b25 & b27);
428
+ s[32] = b32 ^ (~b34 & b36);
429
+ s[33] = b33 ^ (~b35 & b37);
430
+ s[42] = b42 ^ (~b44 & b46);
431
+ s[43] = b43 ^ (~b45 & b47);
432
+ s[4] = b4 ^ (~b6 & b8);
433
+ s[5] = b5 ^ (~b7 & b9);
434
+ s[14] = b14 ^ (~b16 & b18);
435
+ s[15] = b15 ^ (~b17 & b19);
436
+ s[24] = b24 ^ (~b26 & b28);
437
+ s[25] = b25 ^ (~b27 & b29);
438
+ s[34] = b34 ^ (~b36 & b38);
439
+ s[35] = b35 ^ (~b37 & b39);
440
+ s[44] = b44 ^ (~b46 & b48);
441
+ s[45] = b45 ^ (~b47 & b49);
442
+ s[6] = b6 ^ (~b8 & b0);
443
+ s[7] = b7 ^ (~b9 & b1);
444
+ s[16] = b16 ^ (~b18 & b10);
445
+ s[17] = b17 ^ (~b19 & b11);
446
+ s[26] = b26 ^ (~b28 & b20);
447
+ s[27] = b27 ^ (~b29 & b21);
448
+ s[36] = b36 ^ (~b38 & b30);
449
+ s[37] = b37 ^ (~b39 & b31);
450
+ s[46] = b46 ^ (~b48 & b40);
451
+ s[47] = b47 ^ (~b49 & b41);
452
+ s[8] = b8 ^ (~b0 & b2);
453
+ s[9] = b9 ^ (~b1 & b3);
454
+ s[18] = b18 ^ (~b10 & b12);
455
+ s[19] = b19 ^ (~b11 & b13);
456
+ s[28] = b28 ^ (~b20 & b22);
457
+ s[29] = b29 ^ (~b21 & b23);
458
+ s[38] = b38 ^ (~b30 & b32);
459
+ s[39] = b39 ^ (~b31 & b33);
460
+ s[48] = b48 ^ (~b40 & b42);
461
+ s[49] = b49 ^ (~b41 & b43);
462
+
463
+ s[0] ^= RC[n];
464
+ s[1] ^= RC[n + 1];
465
+ }
466
+ };
467
+
468
+ if (COMMON_JS) {
469
+ module.exports = methods;
470
+ } else {
471
+ for (var i = 0; i < methodNames.length; ++i) {
472
+ root[methodNames[i]] = methods[methodNames[i]];
473
+ }
474
+ }
475
+ })();