|
|
|
@ -1,19 +1,21 @@
|
|
|
|
|
/**
|
|
|
|
|
* [js-sha3]{@link https://github.com/emn178/js-sha3}
|
|
|
|
|
*
|
|
|
|
|
* @version 0.5.5
|
|
|
|
|
* @version 0.5.6
|
|
|
|
|
* @author Chen, Yi-Cyuan [emn178@gmail.com]
|
|
|
|
|
* @copyright Chen, Yi-Cyuan 2015-2016
|
|
|
|
|
* @license MIT
|
|
|
|
|
*/
|
|
|
|
|
(function (root) {
|
|
|
|
|
/*jslint bitwise: true */
|
|
|
|
|
(function () {
|
|
|
|
|
'use strict';
|
|
|
|
|
|
|
|
|
|
var NODE_JS = typeof process == 'object' && process.versions && process.versions.node;
|
|
|
|
|
var root = typeof window === 'object' ? window : {};
|
|
|
|
|
var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;
|
|
|
|
|
if (NODE_JS) {
|
|
|
|
|
root = global;
|
|
|
|
|
}
|
|
|
|
|
var COMMON_JS = !root.JS_SHA3_TEST && typeof module == 'object' && module.exports;
|
|
|
|
|
var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;
|
|
|
|
|
var HEX_CHARS = '0123456789abcdef'.split('');
|
|
|
|
|
var SHAKE_PADDING = [31, 7936, 2031616, 520093696];
|
|
|
|
|
var KECCAK_PADDING = [1, 256, 65536, 16777216];
|
|
|
|
@ -31,13 +33,13 @@
|
|
|
|
|
var createOutputMethod = function (bits, padding, outputType) {
|
|
|
|
|
return function (message) {
|
|
|
|
|
return new Keccak(bits, padding, bits).update(message)[outputType]();
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
var createShakeOutputMethod = function (bits, padding, outputType) {
|
|
|
|
|
return function (message, outputBits) {
|
|
|
|
|
return new Keccak(bits, padding, outputBits).update(message)[outputType]();
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
var createMethod = function (bits, padding) {
|
|
|
|
@ -48,7 +50,7 @@
|
|
|
|
|
method.update = function (message) {
|
|
|
|
|
return method.create().update(message);
|
|
|
|
|
};
|
|
|
|
|
for (var i = 0;i < OUTPUT_TYPES.length;++i) {
|
|
|
|
|
for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
|
|
|
|
|
var type = OUTPUT_TYPES[i];
|
|
|
|
|
method[type] = createOutputMethod(bits, padding, type);
|
|
|
|
|
}
|
|
|
|
@ -63,7 +65,7 @@
|
|
|
|
|
method.update = function (message, outputBits) {
|
|
|
|
|
return method.create(outputBits).update(message);
|
|
|
|
|
};
|
|
|
|
|
for (var i = 0;i < OUTPUT_TYPES.length;++i) {
|
|
|
|
|
for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
|
|
|
|
|
var type = OUTPUT_TYPES[i];
|
|
|
|
|
method[type] = createShakeOutputMethod(bits, padding, type);
|
|
|
|
|
}
|
|
|
|
@ -76,13 +78,15 @@
|
|
|
|
|
{name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod}
|
|
|
|
|
];
|
|
|
|
|
|
|
|
|
|
var methods = {};
|
|
|
|
|
var methods = {}, methodNames = [];
|
|
|
|
|
|
|
|
|
|
for (var i = 0;i < algorithms.length;++i) {
|
|
|
|
|
for (var i = 0; i < algorithms.length; ++i) {
|
|
|
|
|
var algorithm = algorithms[i];
|
|
|
|
|
var bits = algorithm.bits;
|
|
|
|
|
for (var j = 0;j < bits.length;++j) {
|
|
|
|
|
methods[algorithm.name +'_' + bits[j]] = algorithm.createMethod(bits[j], algorithm.padding);
|
|
|
|
|
for (var j = 0; j < bits.length; ++j) {
|
|
|
|
|
var methodName = algorithm.name +'_' + bits[j];
|
|
|
|
|
methodNames.push(methodName);
|
|
|
|
|
methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
@ -99,10 +103,10 @@
|
|
|
|
|
this.outputBlocks = outputBits >> 5;
|
|
|
|
|
this.extraBytes = (outputBits & 31) >> 3;
|
|
|
|
|
|
|
|
|
|
for (var i = 0;i < 50;++i) {
|
|
|
|
|
for (var i = 0; i < 50; ++i) {
|
|
|
|
|
this.s[i] = 0;
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Keccak.prototype.update = function (message) {
|
|
|
|
|
var notString = typeof message != 'string';
|
|
|
|
@ -116,16 +120,16 @@
|
|
|
|
|
if (this.reset) {
|
|
|
|
|
this.reset = false;
|
|
|
|
|
blocks[0] = this.block;
|
|
|
|
|
for (i = 1;i < blockCount + 1;++i) {
|
|
|
|
|
for (i = 1; i < blockCount + 1; ++i) {
|
|
|
|
|
blocks[i] = 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (notString) {
|
|
|
|
|
for (i = this.start;index < length && i < byteCount;++index) {
|
|
|
|
|
for (i = this.start; index < length && i < byteCount; ++index) {
|
|
|
|
|
blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
for (i = this.start;index < length && i < byteCount;++index) {
|
|
|
|
|
for (i = this.start; index < length && i < byteCount; ++index) {
|
|
|
|
|
code = message.charCodeAt(index);
|
|
|
|
|
if (code < 0x80) {
|
|
|
|
|
blocks[i >> 2] |= code << SHIFT[i++ & 3];
|
|
|
|
@ -149,7 +153,7 @@
|
|
|
|
|
if (i >= byteCount) {
|
|
|
|
|
this.start = i - byteCount;
|
|
|
|
|
this.block = blocks[blockCount];
|
|
|
|
|
for (i = 0;i < blockCount;++i) {
|
|
|
|
|
for (i = 0; i < blockCount; ++i) {
|
|
|
|
|
s[i] ^= blocks[i];
|
|
|
|
|
}
|
|
|
|
|
f(s);
|
|
|
|
@ -166,12 +170,12 @@
|
|
|
|
|
blocks[i >> 2] |= this.padding[i & 3];
|
|
|
|
|
if (this.lastByteIndex == this.byteCount) {
|
|
|
|
|
blocks[0] = blocks[blockCount];
|
|
|
|
|
for (i = 1;i < blockCount + 1;++i) {
|
|
|
|
|
for (i = 1; i < blockCount + 1; ++i) {
|
|
|
|
|
blocks[i] = 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
blocks[blockCount - 1] |= 0x80000000;
|
|
|
|
|
for (i = 0;i < blockCount;++i) {
|
|
|
|
|
for (i = 0; i < blockCount; ++i) {
|
|
|
|
|
s[i] ^= blocks[i];
|
|
|
|
|
}
|
|
|
|
|
f(s);
|
|
|
|
@ -184,14 +188,14 @@
|
|
|
|
|
extraBytes = this.extraBytes, i = 0, j = 0;
|
|
|
|
|
var hex = '', block;
|
|
|
|
|
while (j < outputBlocks) {
|
|
|
|
|
for (i = 0;i < blockCount && j < outputBlocks;++i, ++j) {
|
|
|
|
|
for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
|
|
|
|
|
block = s[i];
|
|
|
|
|
hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +
|
|
|
|
|
HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +
|
|
|
|
|
HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +
|
|
|
|
|
HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];
|
|
|
|
|
}
|
|
|
|
|
if (j % blockCount == 0) {
|
|
|
|
|
if (j % blockCount === 0) {
|
|
|
|
|
f(s);
|
|
|
|
|
i = 0;
|
|
|
|
|
}
|
|
|
|
@ -225,10 +229,10 @@
|
|
|
|
|
}
|
|
|
|
|
var array = new Uint32Array(buffer);
|
|
|
|
|
while (j < outputBlocks) {
|
|
|
|
|
for (i = 0;i < blockCount && j < outputBlocks;++i, ++j) {
|
|
|
|
|
for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
|
|
|
|
|
array[j] = s[i];
|
|
|
|
|
}
|
|
|
|
|
if (j % blockCount == 0) {
|
|
|
|
|
if (j % blockCount === 0) {
|
|
|
|
|
f(s);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
@ -248,7 +252,7 @@
|
|
|
|
|
extraBytes = this.extraBytes, i = 0, j = 0;
|
|
|
|
|
var array = [], offset, block;
|
|
|
|
|
while (j < outputBlocks) {
|
|
|
|
|
for (i = 0;i < blockCount && j < outputBlocks;++i, ++j) {
|
|
|
|
|
for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
|
|
|
|
|
offset = j << 2;
|
|
|
|
|
block = s[i];
|
|
|
|
|
array[offset] = block & 0xFF;
|
|
|
|
@ -256,7 +260,7 @@
|
|
|
|
|
array[offset + 2] = (block >> 16) & 0xFF;
|
|
|
|
|
array[offset + 3] = (block >> 24) & 0xFF;
|
|
|
|
|
}
|
|
|
|
|
if (j % blockCount == 0) {
|
|
|
|
|
if (j % blockCount === 0) {
|
|
|
|
|
f(s);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
@ -281,7 +285,7 @@
|
|
|
|
|
b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,
|
|
|
|
|
b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,
|
|
|
|
|
b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;
|
|
|
|
|
for (n = 0;n < 48;n += 2) {
|
|
|
|
|
for (n = 0; n < 48; n += 2) {
|
|
|
|
|
c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];
|
|
|
|
|
c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];
|
|
|
|
|
c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];
|
|
|
|
@ -459,13 +463,13 @@
|
|
|
|
|
s[0] ^= RC[n];
|
|
|
|
|
s[1] ^= RC[n + 1];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
if (COMMON_JS) {
|
|
|
|
|
module.exports = methods;
|
|
|
|
|
} else if (root) {
|
|
|
|
|
for (var key in methods) {
|
|
|
|
|
root[key] = methods[key];
|
|
|
|
|
} else {
|
|
|
|
|
for (var i = 0; i < methodNames.length; ++i) {
|
|
|
|
|
root[methodNames[i]] = methods[methodNames[i]];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}(this));
|
|
|
|
|
})();
|
|
|
|
|