mirror of
https://github.com/Qortal/qortal-ui.git
synced 2025-02-11 17:55:51 +00:00
229 lines
7.6 KiB
JavaScript
229 lines
7.6 KiB
JavaScript
// Extracted from https://github.com/crypto-browserify/ripemd160
|
|
|
|
const ARRAY16 = new Array(16);
|
|
|
|
const zl = initU8Array([
|
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
|
|
7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
|
|
3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,
|
|
1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,
|
|
4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13
|
|
]);
|
|
const zr = initU8Array([
|
|
5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,
|
|
6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,
|
|
15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,
|
|
8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,
|
|
12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11
|
|
]);
|
|
const sl = initU8Array([
|
|
11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,
|
|
7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,
|
|
11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,
|
|
11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,
|
|
9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6
|
|
]);
|
|
const sr = initU8Array([
|
|
8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,
|
|
9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,
|
|
9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,
|
|
15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,
|
|
8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11
|
|
]);
|
|
const hl = initU32Array([0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]);
|
|
const hr = initU32Array([0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]);
|
|
function rotl(x, n) {
|
|
return (x << n) | (x >>> (32 - n));
|
|
}
|
|
function fn1(a, b, c, d, e, m, k, s) {
|
|
return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0;
|
|
}
|
|
function fn2(a, b, c, d, e, m, k, s) {
|
|
return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + e) | 0;
|
|
}
|
|
function fn3(a, b, c, d, e, m, k, s) {
|
|
return (rotl((a + ((b | (~c)) ^ d) + m + k) | 0, s) + e) | 0;
|
|
}
|
|
function fn4(a, b, c, d, e, m, k, s) {
|
|
return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + e) | 0;
|
|
}
|
|
function fn5(a, b, c, d, e, m, k, s) {
|
|
return (rotl((a + (b ^ (c | (~d))) + m + k) | 0, s) + e) | 0;
|
|
}
|
|
function readInt32LE(buffer, offset) {
|
|
offset >>>= 0;
|
|
return (buffer[offset])
|
|
| (buffer[offset + 1] << 8)
|
|
| (buffer[offset + 2] << 16)
|
|
| (buffer[offset + 3] << 24);
|
|
}
|
|
function writeUInt32LE(buffer, value, offset) {
|
|
value = +value;
|
|
offset >>>= 0;
|
|
buffer[offset + 3] = (value >>> 24);
|
|
buffer[offset + 2] = (value >>> 16);
|
|
buffer[offset + 1] = (value >>> 8);
|
|
buffer[offset] = (value & 0xff);
|
|
return offset + 4;
|
|
}
|
|
function writeInt32LE(buffer, value, offset) {
|
|
value = +value;
|
|
offset >>>= 0;
|
|
buffer[offset] = (value & 0xff);
|
|
buffer[offset + 1] = (value >>> 8);
|
|
buffer[offset + 2] = (value >>> 16);
|
|
buffer[offset + 3] = (value >>> 24);
|
|
return offset + 4;
|
|
}
|
|
function initU32Array(data) {
|
|
if (typeof Uint32Array !== 'undefined') {
|
|
return new Uint32Array(data);
|
|
}
|
|
else {
|
|
return data;
|
|
}
|
|
}
|
|
function initU8Array(data) {
|
|
if (typeof Uint8Array !== 'undefined') {
|
|
return new Uint8Array(data);
|
|
}
|
|
else {
|
|
return data;
|
|
}
|
|
}
|
|
function createU8Array(size) {
|
|
if (typeof Uint8Array !== 'undefined') {
|
|
return new Uint8Array(size);
|
|
}
|
|
else {
|
|
return new Array(size);
|
|
}
|
|
}
|
|
export class RIPEMD160 {
|
|
constructor() {
|
|
this._block = createU8Array(64);
|
|
this._blockSize = 64;
|
|
this._blockOffset = 0;
|
|
this._length = [0, 0, 0, 0];
|
|
this._finalized = false;
|
|
this._a = 0x67452301;
|
|
this._b = 0xefcdab89;
|
|
this._c = 0x98badcfe;
|
|
this._d = 0x10325476;
|
|
this._e = 0xc3d2e1f0;
|
|
}
|
|
update(data) {
|
|
if (this._finalized)
|
|
throw new Error('Digest already called');
|
|
// consume data
|
|
const block = this._block;
|
|
let offset = 0;
|
|
while (this._blockOffset + data.length - offset >= this._blockSize) {
|
|
for (let i = this._blockOffset; i < this._blockSize;)
|
|
block[i++] = data[offset++];
|
|
this._update();
|
|
this._blockOffset = 0;
|
|
}
|
|
while (offset < data.length)
|
|
block[this._blockOffset++] = data[offset++];
|
|
// update length
|
|
for (let j = 0, carry = data.length * 8; carry > 0; ++j) {
|
|
this._length[j] += carry;
|
|
carry = (this._length[j] / 0x0100000000) | 0;
|
|
if (carry > 0)
|
|
this._length[j] -= 0x0100000000 * carry;
|
|
}
|
|
return this;
|
|
}
|
|
_update() {
|
|
const words = ARRAY16;
|
|
for (let j = 0; j < 16; ++j) {
|
|
words[j] = readInt32LE(this._block, j * 4);
|
|
}
|
|
let al = this._a | 0;
|
|
let bl = this._b | 0;
|
|
let cl = this._c | 0;
|
|
let dl = this._d | 0;
|
|
let el = this._e | 0;
|
|
let ar = this._a | 0;
|
|
let br = this._b | 0;
|
|
let cr = this._c | 0;
|
|
let dr = this._d | 0;
|
|
let er = this._e | 0;
|
|
// computation
|
|
for (let i = 0; i < 80; i += 1) {
|
|
let tl;
|
|
let tr;
|
|
if (i < 16) {
|
|
tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i]);
|
|
tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i]);
|
|
}
|
|
else if (i < 32) {
|
|
tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i]);
|
|
tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i]);
|
|
}
|
|
else if (i < 48) {
|
|
tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i]);
|
|
tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i]);
|
|
}
|
|
else if (i < 64) {
|
|
tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i]);
|
|
tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i]);
|
|
}
|
|
else { // if (i<80) {
|
|
tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i]);
|
|
tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]);
|
|
}
|
|
al = el;
|
|
el = dl;
|
|
dl = rotl(cl, 10);
|
|
cl = bl;
|
|
bl = tl;
|
|
ar = er;
|
|
er = dr;
|
|
dr = rotl(cr, 10);
|
|
cr = br;
|
|
br = tr;
|
|
}
|
|
// update state
|
|
const t = (this._b + cl + dr) | 0;
|
|
this._b = (this._c + dl + er) | 0;
|
|
this._c = (this._d + el + ar) | 0;
|
|
this._d = (this._e + al + br) | 0;
|
|
this._e = (this._a + bl + cr) | 0;
|
|
this._a = t;
|
|
}
|
|
digest() {
|
|
if (this._finalized) {
|
|
throw new Error('Digest already called');
|
|
}
|
|
this._finalized = true;
|
|
// create padding and handle blocks
|
|
this._block[this._blockOffset++] = 0x80;
|
|
if (this._blockOffset > 56) {
|
|
this._block.fill(0, this._blockOffset, 64);
|
|
this._update();
|
|
this._blockOffset = 0;
|
|
}
|
|
this._block.fill(0, this._blockOffset, 56);
|
|
writeUInt32LE(this._block, this._length[0], 56);
|
|
writeUInt32LE(this._block, this._length[1], 60);
|
|
this._update();
|
|
// produce result
|
|
const buffer = createU8Array(20);
|
|
writeInt32LE(buffer, this._a, 0);
|
|
writeInt32LE(buffer, this._b, 4);
|
|
writeInt32LE(buffer, this._c, 8);
|
|
writeInt32LE(buffer, this._d, 12);
|
|
writeInt32LE(buffer, this._e, 16);
|
|
// reset state
|
|
this._block.fill(0);
|
|
this._blockOffset = 0;
|
|
for (let i = 0; i < 4; ++i) {
|
|
this._length[i] = 0;
|
|
}
|
|
return buffer;
|
|
}
|
|
}
|
|
export default RIPEMD160;
|