From 7323499dae206693b90e3ce16fcec1437bbb5983 Mon Sep 17 00:00:00 2001 From: yutent Date: Mon, 13 Feb 2023 19:18:15 +0800 Subject: [PATCH] 1.0.0 --- .gitignore | 15 + .npmignore | 3 + .prettierrc.yaml | 11 + Readme.md | 76 +++++ build.js | 16 + package.json | 26 ++ src/base64.js | 141 +++++++++ src/crypto.js | 98 +++++++ src/helper.js | 13 + src/index.js | 3 + src/md5.js | 748 +++++++++++++++++++++++++++++++++++++++++++++++ 11 files changed, 1150 insertions(+) create mode 100644 .gitignore create mode 100644 .npmignore create mode 100644 .prettierrc.yaml create mode 100644 Readme.md create mode 100644 build.js create mode 100644 package.json create mode 100644 src/base64.js create mode 100644 src/crypto.js create mode 100644 src/helper.js create mode 100644 src/index.js create mode 100644 src/md5.js diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..929c0f2 --- /dev/null +++ b/.gitignore @@ -0,0 +1,15 @@ +dist +node_modules + +*.sublime-project +*.sublime-workspace +package-lock.json + +._* + +.Spotlight-V100 +.Trashes +.DS_Store +.AppleDouble +.LSOverride + diff --git a/.npmignore b/.npmignore new file mode 100644 index 0000000..b387d78 --- /dev/null +++ b/.npmignore @@ -0,0 +1,3 @@ +src/ +build.js +.prettierrc.yaml \ No newline at end of file diff --git a/.prettierrc.yaml b/.prettierrc.yaml new file mode 100644 index 0000000..8c33f1a --- /dev/null +++ b/.prettierrc.yaml @@ -0,0 +1,11 @@ + +jsxBracketSameLine: true +jsxSingleQuote: true +semi: false +singleQuote: true +printWidth: 100 +useTabs: false +tabWidth: 2 +trailingComma: none +bracketSpacing: true +arrowParens: avoid diff --git a/Readme.md b/Readme.md new file mode 100644 index 0000000..ed7ed06 --- /dev/null +++ b/Readme.md @@ -0,0 +1,76 @@ +## crypto.js浏览器版本,提供常用的加密封装 + + +感谢以下2个优秀的开源库: + +1. [spark-md5](https://github.com/satazor/js-spark-md5), 这个经本人测试, 确实是纯js版, 性能最高的一个, 本仓库引入进来, 调整为ESM方式使用。 +2. [base64](https://github.com/beatgammit/base64-js), 完整的base64库, 相比原生的 btoa()方法, 这个支持对中文进行编码。 + + +以上这2个库, 在index.js中有引入。对体积有要求的, 可以单独使用。 + + +```js +import crypto, { md5, base64encode } from '//unpkg.com/crypto.web.js/dist/index.js' +import crypto, { md5, base64encode } from '//jscdn.ink/crypto.web.js/1.0.0/index.js' // 大陆用户可使用此加速地址 + +import { md5, md5Sum } from '//jscdn.ink/crypto.web.js/1.0.0/md5.js' + +import { base64encode, base64decode } from '//jscdn.ink/crypto.web.js/1.0.0/base64.js' + + +``` + +### APIs + +#### 1. md5(str``) +> 常规的md5函数, 可对字符串(数字类型也可以), 进行加密。 + + +#### 2. md5Sum(ab``) +> 该方法可用于对文件求md5值, 需传入`ArrayBuffer`对象, 可用 `FileReader`得到`arraybuffer`值, 新浏览器的`Blob`对象,也有个`arraybuffer`原型方法。 + + +#### 3. base64encode(str``) +> base64编码, 支持中文。 + + +#### 4. base64decode(str``) +> base64解码。 + + +#### 5. uuid() +> 生成一个唯一的24位的随机字符串。 只保证单机唯一。 + + +#### 6. ab2hex(ab``) +> 将一个`arraybuffer`对象, 转为 十六进制字符串。 + + +#### 7. ab2bin(ab``) +> 将一个`arraybuffer`对象, 转为 `Binary` 符串。 + + +#### 8. sha1(str``) +> 对指定字符串求 `sha1`值。 +>> 注意: 该方法返回的不是字符串, 而是一个Promise对象。 + + +#### 9. sha256(str``) +> 对指定字符串求 `sha256`值。 +>> 注意: 该方法返回的不是字符串, 而是一个Promise对象。 + + +#### 10. sha512(str``) +> 对指定字符串求 `sha512`值。 +>> 注意: 该方法返回的不是字符串, 而是一个Promise对象。 + + +#### 11. hash(algorithm``, data`|`) +> 散列算法(也称为哈希算法)，用来实现一些重要数据的模糊处理，以达到隐藏明文的目的。 上面的sha1、sha256等，其实就是基于这个再次封装的结果; algorithm，可选值有: SHA-1, SHA-256, SHA-384, SHA-512。 +>> 注意: 该方法返回的不是字符串, 而是一个Promise对象。 + + +#### 12. hmac(algorithm``, data`|`, key``, outEncode``) +> HMAC算法，是在散列算法的基础上，与一个密钥结合在一起，以阻止对签名完整性的破坏。 与上面的散列算法相比，多了一个密钥的参数key。 +>> 注意: 该方法返回的不是字符串, 而是一个Promise对象。 \ No newline at end of file diff --git a/build.js b/build.js new file mode 100644 index 0000000..5e96bf0 --- /dev/null +++ b/build.js @@ -0,0 +1,16 @@ +/** + * {build} + * @author yutent + * @date 2021/08/09 11:59:41 + */ + +import Es from 'esbuild' + +Es.build({ + entryPoints: ['src/index.js', 'src/crypto.js', 'src/md5.js', 'src/base64.js'], + outdir: 'dist', + target: 'es2017', + format: 'esm', + bundle: true, + minify: true +}) diff --git a/package.json b/package.json new file mode 100644 index 0000000..11c758d --- /dev/null +++ b/package.json @@ -0,0 +1,26 @@ +{ + "name": "crypto.web.js", + "version": "1.0.0", + "type": "module", + "description": "crypto.js浏览器版本,提供常用的加密封装", + "keywords": [ + "md5", + "sha1", + "sha256", + "sha512", + "hmac", + "base64", + "crypto", + "crypto-js", + "crypto.js" + ], + "author": "Yutent ", + "scripts": { + "start": "node ./build.js" + }, + "repository": { + "type": "git", + "url": "git+https://github.com/bytedo/crypto.web.js.git" + }, + "license": "MIT" +} diff --git a/src/base64.js b/src/base64.js new file mode 100644 index 0000000..97dff4d --- /dev/null +++ b/src/base64.js @@ -0,0 +1,141 @@ +import { str2uint, buf2str } from './helper.js' + +var lookup = [] +var revLookup = [] +var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array + +var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/' +for (var i = 0, len = code.length; i < len; ++i) { + lookup[i] = code[i] + revLookup[code.charCodeAt(i)] = i +} + +// Support decoding URL-safe base64 strings, as Node.js does. +// See: https://en.wikipedia.org/wiki/Base64#URL_applications +revLookup['-'.charCodeAt(0)] = 62 +revLookup['_'.charCodeAt(0)] = 63 + +function getLens(b64) { + var len = b64.length + + // 补足 = + while (len % 4 > 0) { + b64 += '=' + len++ + } + + // Trim off extra bytes after placeholder bytes are found + // See: https://github.com/beatgammit/base64-js/issues/42 + var validLen = b64.indexOf('=') + if (validLen === -1) validLen = len + + var placeHoldersLen = validLen === len ? 0 : 4 - (validLen % 4) + + return [validLen, placeHoldersLen] +} + +// base64 is 4/3 + up to two characters of the original data +function byteLength(b64) { + var lens = getLens(b64) + var validLen = lens[0] + var placeHoldersLen = lens[1] + return ((validLen + placeHoldersLen) * 3) / 4 - placeHoldersLen +} + +function _byteLength(b64, validLen, placeHoldersLen) { + return ((validLen + placeHoldersLen) * 3) / 4 - placeHoldersLen +} + +function toByteArray(b64) { + var tmp + var lens = getLens(b64) + var validLen = lens[0] + var placeHoldersLen = lens[1] + + var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen)) + + var curByte = 0 + + // if there are placeholders, only get up to the last complete 4 chars + var len = placeHoldersLen > 0 ? validLen - 4 : validLen + + var i + for (i = 0; i < len; i += 4) { + tmp = + (revLookup[b64.charCodeAt(i)] << 18) | + (revLookup[b64.charCodeAt(i + 1)] << 12) | + (revLookup[b64.charCodeAt(i + 2)] << 6) | + revLookup[b64.charCodeAt(i + 3)] + arr[curByte++] = (tmp >> 16) & 0xff + arr[curByte++] = (tmp >> 8) & 0xff + arr[curByte++] = tmp & 0xff + } + + if (placeHoldersLen === 2) { + tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4) + arr[curByte++] = tmp & 0xff + } + + if (placeHoldersLen === 1) { + tmp = + (revLookup[b64.charCodeAt(i)] << 10) | + (revLookup[b64.charCodeAt(i + 1)] << 4) | + (revLookup[b64.charCodeAt(i + 2)] >> 2) + arr[curByte++] = (tmp >> 8) & 0xff + arr[curByte++] = tmp & 0xff + } + + return arr +} + +function tripletToBase64(num) { + return ( + lookup[(num >> 18) & 0x3f] + + lookup[(num >> 12) & 0x3f] + + lookup[(num >> 6) & 0x3f] + + lookup[num & 0x3f] + ) +} + +function encodeChunk(uint8, start, end) { + var tmp + var output = [] + for (var i = start; i < end; i += 3) { + tmp = ((uint8[i] << 16) & 0xff0000) + ((uint8[i + 1] << 8) & 0xff00) + (uint8[i + 2] & 0xff) + output.push(tripletToBase64(tmp)) + } + return output.join('') +} + +function fromByteArray(uint8) { + var tmp + var len = uint8.length + var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes + var parts = [] + var maxChunkLength = 16383 // must be multiple of 3 + + // go through the array every three bytes, we'll deal with trailing stuff later + for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) { + parts.push(encodeChunk(uint8, i, i + maxChunkLength > len2 ? len2 : i + maxChunkLength)) + } + + // pad the end with zeros, but make sure to not forget the extra bytes + if (extraBytes === 1) { + tmp = uint8[len - 1] + parts.push(lookup[tmp >> 2] + lookup[(tmp << 4) & 0x3f] + '==') + } else if (extraBytes === 2) { + tmp = (uint8[len - 2] << 8) + uint8[len - 1] + parts.push(lookup[tmp >> 10] + lookup[(tmp >> 4) & 0x3f] + lookup[(tmp << 2) & 0x3f] + '=') + } + + return parts.join('') +} + +// 支持对中文的base64编码 +export function base64encode(str) { + return fromByteArray(str2uint(str)) +} + +export function base64decode(str) { + return buf2str(toByteArray(str)) +} diff --git a/src/crypto.js b/src/crypto.js new file mode 100644 index 0000000..ddce485 --- /dev/null +++ b/src/crypto.js @@ -0,0 +1,98 @@ +import { str2uint } from './helper.js' + +const subtle = window.crypto.subtle + +var __stamp__ = 0 +var __inc__ = 0 //用于生成保证唯一的uuid种子 + +export function uuid() { + var rand = Math.random().toString(16).slice(2) + Math.random().toString(16).slice(2) + var now = (~~(Date.now() / 1000)).toString(16) + + if (__stamp__ === now) { + __inc__++ + } else { + __stamp__ = now + __inc__ = 0 + } + rand = __stamp__ + __inc__.toString(16) + rand + return rand.slice(0, 24) +} + +/** + * ArrayBuffer 转 hex + */ +export function ab2hex(buf) { + var uint8 = new Uint8Array(buf) + return [...uint8].map(n => n.toString(16).padStart(2, '0')).join('') +} + +/** + * ArrayBuffer 转 Binary + */ +export function ab2bin(buf) { + var bin = '' + var uint8 = new Uint8Array(buf) + for (var i = 0; i < uint8.length; i++) { + bin += String.fromCharCode(uint8[i]) + } + return bin +} + +/* ------------------------------------- */ + +/** + * @return Promise + */ +export function hash(type, str) { + if (typeof str === 'string') { + str = str2uint(str) + } + return subtle.digest(type, str).then(buf => ab2hex(buf)) +} + +export function sha1(str) { + return hash('SHA-1', str) +} + +export function sha256(str) { + return hash('SHA-256', str) +} + +export function sha512(str) { + return hash('SHA-512', str) +} + +export function hmac(mode, str, key = '', encode) { + if (key) { + if (typeof key === 'string') { + key = str2uint(key) + } + } else { + key = new Uint8Array(16) + } + return subtle + .importKey('raw', key, { name: 'HMAC', hash: { name: mode } }, true, ['sign', 'verify']) + .then(cKey => { + return subtle.sign('HMAC', cKey, str2uint(str)).then(ab => { + var output = ab + + switch (encode) { + case 'binary': + output = ab2bin(ab) + break + case 'hex': + output = ab2hex(ab) + break + case 'base64': + output = window.btoa(ab2bin(ab)) + break + case 'buffer': + output = new Uint8Array(ab) + break + } + + return output + }) + }) +} diff --git a/src/helper.js b/src/helper.js new file mode 100644 index 0000000..1921102 --- /dev/null +++ b/src/helper.js @@ -0,0 +1,13 @@ +const encoder = new TextEncoder() +const decoder = new TextDecoder() + +/** + * String 转 Uint8Array + */ +export function str2uint(txt) { + return encoder.encode(txt) +} + +export function buf2str(buf) { + return decoder.decode(buf) +} diff --git a/src/index.js b/src/index.js new file mode 100644 index 0000000..3a199a8 --- /dev/null +++ b/src/index.js @@ -0,0 +1,3 @@ +export { base64encode, base64decode } from './base64.js' +export { md5, md5Sum } from './md5.js' +export { uuid, ab2hex, ab2bin, sha1, sha256, sha512, hash, hmac } from './crypto.js' diff --git a/src/md5.js b/src/md5.js new file mode 100644 index 0000000..cccf844 --- /dev/null +++ b/src/md5.js @@ -0,0 +1,748 @@ +/* + * Fastest md5 implementation around (JKM md5). + * Credits: Joseph Myers + * + * @see http://www.myersdaily.org/joseph/javascript/md5-text.html + * @see http://jsperf.com/md5-shootout/7 + */ + +/* this function is much faster, + so if possible we use it. Some IEs + are the only ones I know of that + need the idiotic second function, + generated by an if clause. */ +var add32 = function (a, b) { + return (a + b) & 0xffffffff + }, + hex_chr = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'] + +function cmn(q, a, b, x, s, t) { + a = add32(add32(a, q), add32(x, t)) + return add32((a << s) | (a >>> (32 - s)), b) +} + +function md5cycle(x, k) { + var a = x[0], + b = x[1], + c = x[2], + d = x[3] + + a += (((b & c) | (~b & d)) + k[0] - 680876936) | 0 + a = (((a << 7) | (a >>> 25)) + b) | 0 + d += (((a & b) | (~a & c)) + k[1] - 389564586) | 0 + d = (((d << 12) | (d >>> 20)) + a) | 0 + c += (((d & a) | (~d & b)) + k[2] + 606105819) | 0 + c = (((c << 17) | (c >>> 15)) + d) | 0 + b += (((c & d) | (~c & a)) + k[3] - 1044525330) | 0 + b = (((b << 22) | (b >>> 10)) + c) | 0 + a += (((b & c) | (~b & d)) + k[4] - 176418897) | 0 + a = (((a << 7) | (a >>> 25)) + b) | 0 + d += (((a & b) | (~a & c)) + k[5] + 1200080426) | 0 + d = (((d << 12) | (d >>> 20)) + a) | 0 + c += (((d & a) | (~d & b)) + k[6] - 1473231341) | 0 + c = (((c << 17) | (c >>> 15)) + d) | 0 + b += (((c & d) | (~c & a)) + k[7] - 45705983) | 0 + b = (((b << 22) | (b >>> 10)) + c) | 0 + a += (((b & c) | (~b & d)) + k[8] + 1770035416) | 0 + a = (((a << 7) | (a >>> 25)) + b) | 0 + d += (((a & b) | (~a & c)) + k[9] - 1958414417) | 0 + d = (((d << 12) | (d >>> 20)) + a) | 0 + c += (((d & a) | (~d & b)) + k[10] - 42063) | 0 + c = (((c << 17) | (c >>> 15)) + d) | 0 + b += (((c & d) | (~c & a)) + k[11] - 1990404162) | 0 + b = (((b << 22) | (b >>> 10)) + c) | 0 + a += (((b & c) | (~b & d)) + k[12] + 1804603682) | 0 + a = (((a << 7) | (a >>> 25)) + b) | 0 + d += (((a & b) | (~a & c)) + k[13] - 40341101) | 0 + d = (((d << 12) | (d >>> 20)) + a) | 0 + c += (((d & a) | (~d & b)) + k[14] - 1502002290) | 0 + c = (((c << 17) | (c >>> 15)) + d) | 0 + b += (((c & d) | (~c & a)) + k[15] + 1236535329) | 0 + b = (((b << 22) | (b >>> 10)) + c) | 0 + + a += (((b & d) | (c & ~d)) + k[1] - 165796510) | 0 + a = (((a << 5) | (a >>> 27)) + b) | 0 + d += (((a & c) | (b & ~c)) + k[6] - 1069501632) | 0 + d = (((d << 9) | (d >>> 23)) + a) | 0 + c += (((d & b) | (a & ~b)) + k[11] + 643717713) | 0 + c = (((c << 14) | (c >>> 18)) + d) | 0 + b += (((c & a) | (d & ~a)) + k[0] - 373897302) | 0 + b = (((b << 20) | (b >>> 12)) + c) | 0 + a += (((b & d) | (c & ~d)) + k[5] - 701558691) | 0 + a = (((a << 5) | (a >>> 27)) + b) | 0 + d += (((a & c) | (b & ~c)) + k[10] + 38016083) | 0 + d = (((d << 9) | (d >>> 23)) + a) | 0 + c += (((d & b) | (a & ~b)) + k[15] - 660478335) | 0 + c = (((c << 14) | (c >>> 18)) + d) | 0 + b += (((c & a) | (d & ~a)) + k[4] - 405537848) | 0 + b = (((b << 20) | (b >>> 12)) + c) | 0 + a += (((b & d) | (c & ~d)) + k[9] + 568446438) | 0 + a = (((a << 5) | (a >>> 27)) + b) | 0 + d += (((a & c) | (b & ~c)) + k[14] - 1019803690) | 0 + d = (((d << 9) | (d >>> 23)) + a) | 0 + c += (((d & b) | (a & ~b)) + k[3] - 187363961) | 0 + c = (((c << 14) | (c >>> 18)) + d) | 0 + b += (((c & a) | (d & ~a)) + k[8] + 1163531501) | 0 + b = (((b << 20) | (b >>> 12)) + c) | 0 + a += (((b & d) | (c & ~d)) + k[13] - 1444681467) | 0 + a = (((a << 5) | (a >>> 27)) + b) | 0 + d += (((a & c) | (b & ~c)) + k[2] - 51403784) | 0 + d = (((d << 9) | (d >>> 23)) + a) | 0 + c += (((d & b) | (a & ~b)) + k[7] + 1735328473) | 0 + c = (((c << 14) | (c >>> 18)) + d) | 0 + b += (((c & a) | (d & ~a)) + k[12] - 1926607734) | 0 + b = (((b << 20) | (b >>> 12)) + c) | 0 + + a += ((b ^ c ^ d) + k[5] - 378558) | 0 + a = (((a << 4) | (a >>> 28)) + b) | 0 + d += ((a ^ b ^ c) + k[8] - 2022574463) | 0 + d = (((d << 11) | (d >>> 21)) + a) | 0 + c += ((d ^ a ^ b) + k[11] + 1839030562) | 0 + c = (((c << 16) | (c >>> 16)) + d) | 0 + b += ((c ^ d ^ a) + k[14] - 35309556) | 0 + b = (((b << 23) | (b >>> 9)) + c) | 0 + a += ((b ^ c ^ d) + k[1] - 1530992060) | 0 + a = (((a << 4) | (a >>> 28)) + b) | 0 + d += ((a ^ b ^ c) + k[4] + 1272893353) | 0 + d = (((d << 11) | (d >>> 21)) + a) | 0 + c += ((d ^ a ^ b) + k[7] - 155497632) | 0 + c = (((c << 16) | (c >>> 16)) + d) | 0 + b += ((c ^ d ^ a) + k[10] - 1094730640) | 0 + b = (((b << 23) | (b >>> 9)) + c) | 0 + a += ((b ^ c ^ d) + k[13] + 681279174) | 0 + a = (((a << 4) | (a >>> 28)) + b) | 0 + d += ((a ^ b ^ c) + k[0] - 358537222) | 0 + d = (((d << 11) | (d >>> 21)) + a) | 0 + c += ((d ^ a ^ b) + k[3] - 722521979) | 0 + c = (((c << 16) | (c >>> 16)) + d) | 0 + b += ((c ^ d ^ a) + k[6] + 76029189) | 0 + b = (((b << 23) | (b >>> 9)) + c) | 0 + a += ((b ^ c ^ d) + k[9] - 640364487) | 0 + a = (((a << 4) | (a >>> 28)) + b) | 0 + d += ((a ^ b ^ c) + k[12] - 421815835) | 0 + d = (((d << 11) | (d >>> 21)) + a) | 0 + c += ((d ^ a ^ b) + k[15] + 530742520) | 0 + c = (((c << 16) | (c >>> 16)) + d) | 0 + b += ((c ^ d ^ a) + k[2] - 995338651) | 0 + b = (((b << 23) | (b >>> 9)) + c) | 0 + + a += ((c ^ (b | ~d)) + k[0] - 198630844) | 0 + a = (((a << 6) | (a >>> 26)) + b) | 0 + d += ((b ^ (a | ~c)) + k[7] + 1126891415) | 0 + d = (((d << 10) | (d >>> 22)) + a) | 0 + c += ((a ^ (d | ~b)) + k[14] - 1416354905) | 0 + c = (((c << 15) | (c >>> 17)) + d) | 0 + b += ((d ^ (c | ~a)) + k[5] - 57434055) | 0 + b = (((b << 21) | (b >>> 11)) + c) | 0 + a += ((c ^ (b | ~d)) + k[12] + 1700485571) | 0 + a = (((a << 6) | (a >>> 26)) + b) | 0 + d += ((b ^ (a | ~c)) + k[3] - 1894986606) | 0 + d = (((d << 10) | (d >>> 22)) + a) | 0 + c += ((a ^ (d | ~b)) + k[10] - 1051523) | 0 + c = (((c << 15) | (c >>> 17)) + d) | 0 + b += ((d ^ (c | ~a)) + k[1] - 2054922799) | 0 + b = (((b << 21) | (b >>> 11)) + c) | 0 + a += ((c ^ (b | ~d)) + k[8] + 1873313359) | 0 + a = (((a << 6) | (a >>> 26)) + b) | 0 + d += ((b ^ (a | ~c)) + k[15] - 30611744) | 0 + d = (((d << 10) | (d >>> 22)) + a) | 0 + c += ((a ^ (d | ~b)) + k[6] - 1560198380) | 0 + c = (((c << 15) | (c >>> 17)) + d) | 0 + b += ((d ^ (c | ~a)) + k[13] + 1309151649) | 0 + b = (((b << 21) | (b >>> 11)) + c) | 0 + a += ((c ^ (b | ~d)) + k[4] - 145523070) | 0 + a = (((a << 6) | (a >>> 26)) + b) | 0 + d += ((b ^ (a | ~c)) + k[11] - 1120210379) | 0 + d = (((d << 10) | (d >>> 22)) + a) | 0 + c += ((a ^ (d | ~b)) + k[2] + 718787259) | 0 + c = (((c << 15) | (c >>> 17)) + d) | 0 + b += ((d ^ (c | ~a)) + k[9] - 343485551) | 0 + b = (((b << 21) | (b >>> 11)) + c) | 0 + + x[0] = (a + x[0]) | 0 + x[1] = (b + x[1]) | 0 + x[2] = (c + x[2]) | 0 + x[3] = (d + x[3]) | 0 +} + +function md5blk(s) { + var md5blks = [], + i /* Andy King said do it this way. */ + + for (i = 0; i < 64; i += 4) { + md5blks[i >> 2] = + s.charCodeAt(i) + + (s.charCodeAt(i + 1) << 8) + + (s.charCodeAt(i + 2) << 16) + + (s.charCodeAt(i + 3) << 24) + } + return md5blks +} + +function md5blk_array(a) { + var md5blks = [], + i /* Andy King said do it this way. */ + + for (i = 0; i < 64; i += 4) { + md5blks[i >> 2] = a[i] + (a[i + 1] << 8) + (a[i + 2] << 16) + (a[i + 3] << 24) + } + return md5blks +} + +function md51(s) { + var n = s.length, + state = [1732584193, -271733879, -1732584194, 271733878], + i, + length, + tail, + tmp, + lo, + hi + + for (i = 64; i <= n; i += 64) { + md5cycle(state, md5blk(s.substring(i - 64, i))) + } + s = s.substring(i - 64) + length = s.length + tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] + for (i = 0; i < length; i += 1) { + tail[i >> 2] |= s.charCodeAt(i) << (i % 4 << 3) + } + tail[i >> 2] |= 0x80 << (i % 4 << 3) + if (i > 55) { + md5cycle(state, tail) + for (i = 0; i < 16; i += 1) { + tail[i] = 0 + } + } + + // Beware that the final length might not fit in 32 bits so we take care of that + tmp = n * 8 + tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/) + lo = parseInt(tmp[2], 16) + hi = parseInt(tmp[1], 16) || 0 + + tail[14] = lo + tail[15] = hi + + md5cycle(state, tail) + return state +} + +function md51_array(a) { + var n = a.length, + state = [1732584193, -271733879, -1732584194, 271733878], + i, + length, + tail, + tmp, + lo, + hi + + for (i = 64; i <= n; i += 64) { + md5cycle(state, md5blk_array(a.subarray(i - 64, i))) + } + + // Not sure if it is a bug, however IE10 will always produce a sub array of length 1 + // containing the last element of the parent array if the sub array specified starts + // beyond the length of the parent array - weird. + // https://connect.microsoft.com/IE/feedback/details/771452/typed-array-subarray-issue + a = i - 64 < n ? a.subarray(i - 64) : new Uint8Array(0) + + length = a.length + tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] + for (i = 0; i < length; i += 1) { + tail[i >> 2] |= a[i] << (i % 4 << 3) + } + + tail[i >> 2] |= 0x80 << (i % 4 << 3) + if (i > 55) { + md5cycle(state, tail) + for (i = 0; i < 16; i += 1) { + tail[i] = 0 + } + } + + // Beware that the final length might not fit in 32 bits so we take care of that + tmp = n * 8 + tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/) + lo = parseInt(tmp[2], 16) + hi = parseInt(tmp[1], 16) || 0 + + tail[14] = lo + tail[15] = hi + + md5cycle(state, tail) + + return state +} + +function rhex(n) { + var s = '', + j + for (j = 0; j < 4; j += 1) { + s += hex_chr[(n >> (j * 8 + 4)) & 0x0f] + hex_chr[(n >> (j * 8)) & 0x0f] + } + return s +} + +function hex(x) { + var i + for (i = 0; i < x.length; i += 1) { + x[i] = rhex(x[i]) + } + return x.join('') +} + +// In some cases the fast add32 function cannot be used.. +if (hex(md51('hello')) !== '5d41402abc4b2a76b9719d911017c592') { + add32 = function (x, y) { + var lsw = (x & 0xffff) + (y & 0xffff), + msw = (x >> 16) + (y >> 16) + (lsw >> 16) + return (msw << 16) | (lsw & 0xffff) + } +} + +// --------------------------------------------------- + +/** + * ArrayBuffer slice polyfill. + * + * @see https://github.com/ttaubert/node-arraybuffer-slice + */ + +if (typeof ArrayBuffer !== 'undefined' && !ArrayBuffer.prototype.slice) { + ;(function () { + function clamp(val, length) { + val = val | 0 || 0 + + if (val < 0) { + return Math.max(val + length, 0) + } + + return Math.min(val, length) + } + + ArrayBuffer.prototype.slice = function (from, to) { + var length = this.byteLength, + begin = clamp(from, length), + end = length, + num, + target, + targetArray, + sourceArray + + if (to !== undefined) { + end = clamp(to, length) + } + + if (begin > end) { + return new ArrayBuffer(0) + } + + num = end - begin + target = new ArrayBuffer(num) + targetArray = new Uint8Array(target) + + sourceArray = new Uint8Array(this, begin, num) + targetArray.set(sourceArray) + + return target + } + })() +} + +// --------------------------------------------------- + +/** + * Helpers. + */ + +function toUtf8(str) { + if (/[\u0080-\uFFFF]/.test(str)) { + str = unescape(encodeURIComponent(str)) + } + + return str +} + +function utf8Str2ArrayBuffer(str, returnUInt8Array) { + var length = str.length, + buff = new ArrayBuffer(length), + arr = new Uint8Array(buff), + i + + for (i = 0; i < length; i += 1) { + arr[i] = str.charCodeAt(i) + } + + return returnUInt8Array ? arr : buff +} + +function arrayBuffer2Utf8Str(buff) { + return String.fromCharCode.apply(null, new Uint8Array(buff)) +} + +function concatenateArrayBuffers(first, second, returnUInt8Array) { + var result = new Uint8Array(first.byteLength + second.byteLength) + + result.set(new Uint8Array(first)) + result.set(new Uint8Array(second), first.byteLength) + + return returnUInt8Array ? result : result.buffer +} + +function hexToBinaryString(hex) { + var bytes = [], + length = hex.length, + x + + for (x = 0; x < length - 1; x += 2) { + bytes.push(parseInt(hex.substr(x, 2), 16)) + } + + return String.fromCharCode.apply(String, bytes) +} + +// --------------------------------------------------- + +/** + * SparkMD5 OOP implementation. + * + * Use this class to perform an incremental md5, otherwise use the + * static methods instead. + */ + +function SparkMD5() { + // call reset to init the instance + this.reset() +} + +/** + * Appends a string. + * A conversion will be applied if an utf8 string is detected. + * + * @param {String} str The string to be appended + * + * @return {SparkMD5} The instance itself + */ +SparkMD5.prototype.append = function (str) { + // Converts the string to utf8 bytes if necessary + // Then append as binary + this.appendBinary(toUtf8(str)) + + return this +} + +/** + * Appends a binary string. + * + * @param {String} contents The binary string to be appended + * + * @return {SparkMD5} The instance itself + */ +SparkMD5.prototype.appendBinary = function (contents) { + this._buff += contents + this._length += contents.length + + var length = this._buff.length, + i + + for (i = 64; i <= length; i += 64) { + md5cycle(this._hash, md5blk(this._buff.substring(i - 64, i))) + } + + this._buff = this._buff.substring(i - 64) + + return this +} + +/** + * Finishes the incremental computation, reseting the internal state and + * returning the result. + * + * @param {Boolean} raw True to get the raw string, false to get the hex string + * + * @return {String} The result + */ +SparkMD5.prototype.end = function (raw) { + var buff = this._buff, + length = buff.length, + i, + tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], + ret + + for (i = 0; i < length; i += 1) { + tail[i >> 2] |= buff.charCodeAt(i) << (i % 4 << 3) + } + + this._finish(tail, length) + ret = hex(this._hash) + + if (raw) { + ret = hexToBinaryString(ret) + } + + this.reset() + + return ret +} + +/** + * Resets the internal state of the computation. + * + * @return {SparkMD5} The instance itself + */ +SparkMD5.prototype.reset = function () { + this._buff = '' + this._length = 0 + this._hash = [1732584193, -271733879, -1732584194, 271733878] + + return this +} + +/** + * Gets the internal state of the computation. + * + * @return {Object} The state + */ +SparkMD5.prototype.getState = function () { + return { + buff: this._buff, + length: this._length, + hash: this._hash.slice() + } +} + +/** + * Gets the internal state of the computation. + * + * @param {Object} state The state + * + * @return {SparkMD5} The instance itself + */ +SparkMD5.prototype.setState = function (state) { + this._buff = state.buff + this._length = state.length + this._hash = state.hash + + return this +} + +/** + * Releases memory used by the incremental buffer and other additional + * resources. If you plan to use the instance again, use reset instead. + */ +SparkMD5.prototype.destroy = function () { + delete this._hash + delete this._buff + delete this._length +} + +/** + * Finish the final calculation based on the tail. + * + * @param {Array} tail The tail (will be modified) + * @param {Number} length The length of the remaining buffer + */ +SparkMD5.prototype._finish = function (tail, length) { + var i = length, + tmp, + lo, + hi + + tail[i >> 2] |= 0x80 << (i % 4 << 3) + if (i > 55) { + md5cycle(this._hash, tail) + for (i = 0; i < 16; i += 1) { + tail[i] = 0 + } + } + + // Do the final computation based on the tail and length + // Beware that the final length may not fit in 32 bits so we take care of that + tmp = this._length * 8 + tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/) + lo = parseInt(tmp[2], 16) + hi = parseInt(tmp[1], 16) || 0 + + tail[14] = lo + tail[15] = hi + md5cycle(this._hash, tail) +} + +/** + * Performs the md5 hash on a string. + * A conversion will be applied if utf8 string is detected. + * + * @param {String} str The string + * @param {Boolean} [raw] True to get the raw string, false to get the hex string + * + * @return {String} The result + */ +SparkMD5.hash = function (str, raw) { + // Converts the string to utf8 bytes if necessary + // Then compute it using the binary function + return SparkMD5.hashBinary(toUtf8(str), raw) +} + +/** + * Performs the md5 hash on a binary string. + * + * @param {String} content The binary string + * @param {Boolean} [raw] True to get the raw string, false to get the hex string + * + * @return {String} The result + */ +SparkMD5.hashBinary = function (content, raw) { + var hash = md51(content), + ret = hex(hash) + + return raw ? hexToBinaryString(ret) : ret +} + +// --------------------------------------------------- + +/** + * SparkMD5 OOP implementation for array buffers. + * + * Use this class to perform an incremental md5 ONLY for array buffers. + */ +SparkMD5.ArrayBuffer = function () { + // call reset to init the instance + this.reset() +} + +/** + * Appends an array buffer. + * + * @param {ArrayBuffer} arr The array to be appended + * + * @return {SparkMD5.ArrayBuffer} The instance itself + */ +SparkMD5.ArrayBuffer.prototype.append = function (arr) { + var buff = concatenateArrayBuffers(this._buff.buffer, arr, true), + length = buff.length, + i + + this._length += arr.byteLength + + for (i = 64; i <= length; i += 64) { + md5cycle(this._hash, md5blk_array(buff.subarray(i - 64, i))) + } + + this._buff = i - 64 < length ? new Uint8Array(buff.buffer.slice(i - 64)) : new Uint8Array(0) + + return this +} + +/** + * Finishes the incremental computation, reseting the internal state and + * returning the result. + * + * @param {Boolean} raw True to get the raw string, false to get the hex string + * + * @return {String} The result + */ +SparkMD5.ArrayBuffer.prototype.end = function (raw) { + var buff = this._buff, + length = buff.length, + tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], + i, + ret + + for (i = 0; i < length; i += 1) { + tail[i >> 2] |= buff[i] << (i % 4 << 3) + } + + this._finish(tail, length) + ret = hex(this._hash) + + if (raw) { + ret = hexToBinaryString(ret) + } + + this.reset() + + return ret +} + +/** + * Resets the internal state of the computation. + * + * @return {SparkMD5.ArrayBuffer} The instance itself + */ +SparkMD5.ArrayBuffer.prototype.reset = function () { + this._buff = new Uint8Array(0) + this._length = 0 + this._hash = [1732584193, -271733879, -1732584194, 271733878] + + return this +} + +/** + * Gets the internal state of the computation. + * + * @return {Object} The state + */ +SparkMD5.ArrayBuffer.prototype.getState = function () { + var state = SparkMD5.prototype.getState.call(this) + + // Convert buffer to a string + state.buff = arrayBuffer2Utf8Str(state.buff) + + return state +} + +/** + * Gets the internal state of the computation. + * + * @param {Object} state The state + * + * @return {SparkMD5.ArrayBuffer} The instance itself + */ +SparkMD5.ArrayBuffer.prototype.setState = function (state) { + // Convert string to buffer + state.buff = utf8Str2ArrayBuffer(state.buff, true) + + return SparkMD5.prototype.setState.call(this, state) +} + +SparkMD5.ArrayBuffer.prototype.destroy = SparkMD5.prototype.destroy + +SparkMD5.ArrayBuffer.prototype._finish = SparkMD5.prototype._finish + +/** + * Performs the md5 hash on an array buffer. + * + * @param {ArrayBuffer} arr The array buffer + * @param {Boolean} [raw] True to get the raw string, false to get the hex one + * + * @return {String} The result + */ +SparkMD5.ArrayBuffer.hash = function (arr, raw) { + var hash = md51_array(new Uint8Array(arr)), + ret = hex(hash) + + return raw ? hexToBinaryString(ret) : ret +} + +/** + * str {String} + */ +export function md5(str) { + var spark = new SparkMD5() + spark.append(str + '') + return spark.end() +} + +/** + * ab {ArrayBuffer} // FileReader.prototype.readAsArrayBuffer + */ +export function md5Sum(ab) { + var spark = new SparkMD5.ArrayBuffer() + spark.append(ab) + return spark.end() +} + +export default SparkMD5