devexpress-richedit
Version:
DevExpress Rich Text Editor is an advanced word-processing tool designed for working with rich text documents.
153 lines (152 loc) • 5.51 kB
JavaScript
export class RIPEMD160 {
constructor() {
this._zl = [
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
];
this._zr = [
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
];
this._sl = [
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
];
this._sr = [
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
];
this._hl = [0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E];
this._hr = [0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000];
}
computeHashCore(M) {
const offset = 0;
for (let i = 0; i < 16; i++) {
const offset_i = offset + i;
const M_offset_i = M[offset_i];
M[offset_i] = ((((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
(((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00));
}
const H = this._hash;
const hl = this._hl;
const hr = this._hr;
const zl = this._zl;
const zr = this._zr;
const sl = this._sl;
const sr = this._sr;
let al, bl, cl, dl, el;
let ar, br, cr, dr, er;
ar = al = H[0];
br = bl = H[1];
cr = cl = H[2];
dr = dl = H[3];
er = el = H[4];
let t;
for (let i = 0; i < 80; i += 1) {
t = (al + M[offset + zl[i]]) | 0;
if (i < 16) {
t += this.f1(bl, cl, dl) + hl[0];
}
else if (i < 32) {
t += this.f2(bl, cl, dl) + hl[1];
}
else if (i < 48) {
t += this.f3(bl, cl, dl) + hl[2];
}
else if (i < 64) {
t += this.f4(bl, cl, dl) + hl[3];
}
else {
t += this.f5(bl, cl, dl) + hl[4];
}
t = t | 0;
t = this.rotl(t, sl[i]);
t = (t + el) | 0;
al = el;
el = dl;
dl = this.rotl(cl, 10);
cl = bl;
bl = t;
t = (ar + M[offset + zr[i]]) | 0;
if (i < 16) {
t += this.f5(br, cr, dr) + hr[0];
}
else if (i < 32) {
t += this.f4(br, cr, dr) + hr[1];
}
else if (i < 48) {
t += this.f3(br, cr, dr) + hr[2];
}
else if (i < 64) {
t += this.f2(br, cr, dr) + hr[3];
}
else {
t += this.f1(br, cr, dr) + hr[4];
}
t = t | 0;
t = this.rotl(t, sr[i]);
t = (t + er) | 0;
ar = er;
er = dr;
dr = this.rotl(cr, 10);
cr = br;
br = t;
}
t = (H[1] + cl + dr) | 0;
H[1] = (H[2] + dl + er) | 0;
H[2] = (H[3] + el + ar) | 0;
H[3] = (H[4] + al + br) | 0;
H[4] = (H[0] + bl + cr) | 0;
H[0] = t;
}
f1(x, y, z) {
return ((x) ^ (y) ^ (z));
}
f2(x, y, z) {
return (((x) & (y)) | ((~x) & (z)));
}
f3(x, y, z) {
return (((x) | (~(y))) ^ (z));
}
f4(x, y, z) {
return (((x) & (z)) | ((y) & (~(z))));
}
f5(x, y, z) {
return ((x) ^ ((y) | (~(z))));
}
rotl(x, n) {
return (x << n) | (x >>> (32 - n));
}
resetCache() {
this._hash = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0];
}
computeHash(source) {
this.resetCache();
const dataWords = source;
const nBitsTotal = source.length * 4 * 8;
const nBitsLeft = source.length * 4 * 8;
dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = ((((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |
(((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00));
const H = this._hash;
this.computeHashCore(dataWords);
for (let i = 0; i < 5; i++) {
const H_i = H[i];
H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
(((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
}
return this._hash;
}
}