Skip to content

Commit

Permalink
rewrite all the other files and update unit test code
Browse files Browse the repository at this point in the history
  • Loading branch information
Alanscut committed Nov 7, 2019
1 parent fe6c3a9 commit d9770e4
Show file tree
Hide file tree
Showing 102 changed files with 7,705 additions and 913 deletions.
7 changes: 2 additions & 5 deletions build/rollup.config.js
Original file line number Diff line number Diff line change
@@ -1,9 +1,6 @@
const path = require('path');
const pkg = require('../package.json');
const resolve = require('rollup-plugin-node-resolve');
// const commonjs = require('rollup-plugin-commonjs');
// const babel = require('rollup-plugin-babel');
// const json = require('rollup-plugin-json');


const banner = `/*
@license
Expand All @@ -23,7 +20,7 @@ module.exports = {
output: {
file: uniqResolve('../lib/index.js'),
format: 'umd',
name: 'crypto',
name: 'CryptoJS',
banner
}
}
20 changes: 10 additions & 10 deletions src/md5.js → src/algo/hash/md5.js
Original file line number Diff line number Diff line change
@@ -1,13 +1,13 @@
import {
WordArray,
Hasher
} from './core.js';
WordArray
} from '../../core/core.js';
import { Hasher } from '../../core/hasher';

// Constants table
const T = [];

// Compute constants
for (let i = 0; i < 64; i += 1) {
for (let i = 0; i < 64; i++) {
T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0;
}

Expand Down Expand Up @@ -48,14 +48,14 @@ export class MD5Algo extends Hasher {
const _M = M;

// Swap endian
for (let i = 0; i < 16; i += 1) {
for (let i = 0; i < 16; i++) {
// Shortcuts
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)
| (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
);
}

Expand All @@ -79,7 +79,7 @@ export class MD5Algo extends Hasher {
const M_offset_14 = _M[offset + 14];
const M_offset_15 = _M[offset + 15];

// Working varialbes
// Working variables
let a = H[0];
let b = H[1];
let c = H[2];
Expand Down Expand Up @@ -177,11 +177,11 @@ export class MD5Algo extends Hasher {
const nBitsTotalL = nBitsTotal;
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = (
(((nBitsTotalH << 8) | (nBitsTotalH >>> 24)) & 0x00ff00ff)
| (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00)
| (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00)
);
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
(((nBitsTotalL << 8) | (nBitsTotalL >>> 24)) & 0x00ff00ff)
| (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00)
| (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00)
);

data.sigBytes = (dataWords.length + 1) * 4;
Expand All @@ -194,7 +194,7 @@ export class MD5Algo extends Hasher {
const H = hash.words;

// Swap endian
for (let i = 0; i < 4; i += 1) {
for (let i = 0; i < 4; i++) {
// Shortcut
const H_i = H[i];

Expand Down
243 changes: 243 additions & 0 deletions src/algo/hash/ripemd160.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,243 @@
/** @preserve
(c) 2012 by Cédric Mesnil. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted
provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice, this list of
conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice, this list
of conditions and the following disclaimer in the documentation and/or other materials
provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS
OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY
WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

import {
WordArray
} from '../../core/core.js';

import { Hasher } from '../../core/hasher';

// Constants table
const _zl = new WordArray([
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 = new WordArray([
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 = new WordArray([
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 = new WordArray([
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 = new WordArray([0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]);
const _hr = new WordArray([0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]);

const f1 = (x, y, z) => (x) ^ (y) ^ (z);

const f2 = (x, y, z) => ((x) & (y)) | ((~x) & (z));

const f3 = (x, y, z) => ((x) | (~(y))) ^ (z);

const f4 = (x, y, z) => ((x) & (z)) | ((y) & (~(z)));

const f5 = (x, y, z) => (x) ^ ((y) | (~(z)));

const rotl = (x, n) => (x << n) | (x >>> (32 - n));

/**
* RIPEMD160 hash algorithm.
*/
export class RIPEMD160Algo extends Hasher {
_doReset() {
this._hash = new WordArray([0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]);
}

_doProcessBlock(M, offset) {
const _M = M;

// Swap endian
for (let i = 0; i < 16; i++) {
// Shortcuts
const offset_i = offset + i;
const M_offset_i = _M[offset_i];

// Swap
_M[offset_i] = (
(((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff)
| (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
);
}
// Shortcut
const H = this._hash.words;
const hl = _hl.words;
const hr = _hr.words;
const zl = _zl.words;
const zr = _zr.words;
const sl = _sl.words;
const sr = _sr.words;

// Working variables
let al = H[0];
let bl = H[1];
let cl = H[2];
let dl = H[3];
let el = H[4];
let ar = H[0];
let br = H[1];
let cr = H[2];
let dr = H[3];
let er = H[4];

// Computation
let t;
for (let i = 0; i < 80; i++) {
t = (al + _M[offset + zl[i]]) | 0;
if (i < 16) {
t += f1(bl, cl, dl) + hl[0];
} else if (i < 32) {
t += f2(bl, cl, dl) + hl[1];
} else if (i < 48) {
t += f3(bl, cl, dl) + hl[2];
} else if (i < 64) {
t += f4(bl, cl, dl) + hl[3];
} else { // if (i<80) {
t += f5(bl, cl, dl) + hl[4];
}
t = t | 0;
t = rotl(t, sl[i]);
t = (t + el) | 0;
al = el;
el = dl;
dl = rotl(cl, 10);
cl = bl;
bl = t;

t = (ar + _M[offset + zr[i]]) | 0;
if (i < 16) {
t += f5(br, cr, dr) + hr[0];
} else if (i < 32) {
t += f4(br, cr, dr) + hr[1];
} else if (i < 48) {
t += f3(br, cr, dr) + hr[2];
} else if (i < 64) {
t += f2(br, cr, dr) + hr[3];
} else { // if (i<80) {
t += f1(br, cr, dr) + hr[4];
}
t |= 0;
t = rotl(t, sr[i]);
t = (t + er) | 0;
ar = er;
er = dr;
dr = rotl(cr, 10);
cr = br;
br = t;
}
// Intermediate hash value
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;
}

_doFinalize() {
// Shortcuts
const data = this._data;
const dataWords = data.words;

const nBitsTotal = this._nDataBytes * 8;
const nBitsLeft = data.sigBytes * 8;

// Add padding
dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - (nBitsLeft % 32));
dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
(((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff)
| (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)
);
data.sigBytes = (dataWords.length + 1) * 4;

// Hash final blocks
this._process();

// Shortcuts
const hash = this._hash;
const H = hash.words;

// Swap endian
for (let i = 0; i < 5; i++) {
// Shortcut
const H_i = H[i];

// Swap
H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff)
| (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
}

// Return final computed hash
return hash;
}

clone() {
const clone = super.clone.call(this);
clone._hash = this._hash.clone();

return clone;
}
}

/**
* Shortcut function to the hasher's object interface.
*
* @param {WordArray|string} message The message to hash.
*
* @return {WordArray} The hash.
*
* @static
*
* @example
*
* var hash = CryptoJS.RIPEMD160('message');
* var hash = CryptoJS.RIPEMD160(wordArray);
*/
export const RIPEMD160 = Hasher._createHelper(RIPEMD160Algo);

/**
* Shortcut function to the HMAC's object interface.
*
* @param {WordArray|string} message The message to hash.
* @param {WordArray|string} key The secret key.
*
* @return {WordArray} The HMAC.
*
* @static
*
* @example
*
* var hmac = CryptoJS.HmacRIPEMD160(message, key);
*/
export const HmacRIPEMD160 = Hasher._createHmacHelper(RIPEMD160Algo);
Loading

0 comments on commit d9770e4

Please sign in to comment.