mirror of https://github.com/moparisthebest/mail
349 lines
12 KiB
JavaScript
349 lines
12 KiB
JavaScript
/** @fileOverview Javascript SHA-512 implementation.
|
||
*
|
||
* This implementation was written for CryptoJS by Jeff Mott and adapted for
|
||
* SJCL by Stefan Thomas.
|
||
*
|
||
* CryptoJS (c) 2009–2012 by Jeff Mott. All rights reserved.
|
||
* Released with New BSD License
|
||
*
|
||
* @author Emily Stark
|
||
* @author Mike Hamburg
|
||
* @author Dan Boneh
|
||
* @author Jeff Mott
|
||
* @author Stefan Thomas
|
||
*/
|
||
|
||
/**
|
||
* Context for a SHA-512 operation in progress.
|
||
* @constructor
|
||
* @class Secure Hash Algorithm, 512 bits.
|
||
*/
|
||
sjcl.hash.sha512 = function (hash) {
|
||
if (!this._key[0]) { this._precompute(); }
|
||
if (hash) {
|
||
this._h = hash._h.slice(0);
|
||
this._buffer = hash._buffer.slice(0);
|
||
this._length = hash._length;
|
||
} else {
|
||
this.reset();
|
||
}
|
||
};
|
||
|
||
/**
|
||
* Hash a string or an array of words.
|
||
* @static
|
||
* @param {bitArray|String} data the data to hash.
|
||
* @return {bitArray} The hash value, an array of 16 big-endian words.
|
||
*/
|
||
sjcl.hash.sha512.hash = function (data) {
|
||
return (new sjcl.hash.sha512()).update(data).finalize();
|
||
};
|
||
|
||
sjcl.hash.sha512.prototype = {
|
||
/**
|
||
* The hash's block size, in bits.
|
||
* @constant
|
||
*/
|
||
blockSize: 1024,
|
||
|
||
/**
|
||
* Reset the hash state.
|
||
* @return this
|
||
*/
|
||
reset:function () {
|
||
this._h = this._init.slice(0);
|
||
this._buffer = [];
|
||
this._length = 0;
|
||
return this;
|
||
},
|
||
|
||
/**
|
||
* Input several words to the hash.
|
||
* @param {bitArray|String} data the data to hash.
|
||
* @return this
|
||
*/
|
||
update: function (data) {
|
||
if (typeof data === "string") {
|
||
data = sjcl.codec.utf8String.toBits(data);
|
||
}
|
||
var i, b = this._buffer = sjcl.bitArray.concat(this._buffer, data),
|
||
ol = this._length,
|
||
nl = this._length = ol + sjcl.bitArray.bitLength(data);
|
||
for (i = 1024+ol & -1024; i <= nl; i+= 1024) {
|
||
this._block(b.splice(0,32));
|
||
}
|
||
return this;
|
||
},
|
||
|
||
/**
|
||
* Complete hashing and output the hash value.
|
||
* @return {bitArray} The hash value, an array of 16 big-endian words.
|
||
*/
|
||
finalize:function () {
|
||
var i, b = this._buffer, h = this._h;
|
||
|
||
// Round out and push the buffer
|
||
b = sjcl.bitArray.concat(b, [sjcl.bitArray.partial(1,1)]);
|
||
|
||
// Round out the buffer to a multiple of 32 words, less the 4 length words.
|
||
for (i = b.length + 4; i & 31; i++) {
|
||
b.push(0);
|
||
}
|
||
|
||
// append the length
|
||
b.push(0);
|
||
b.push(0);
|
||
b.push(Math.floor(this._length / 0x100000000));
|
||
b.push(this._length | 0);
|
||
|
||
while (b.length) {
|
||
this._block(b.splice(0,32));
|
||
}
|
||
|
||
this.reset();
|
||
return h;
|
||
},
|
||
|
||
/**
|
||
* The SHA-512 initialization vector, to be precomputed.
|
||
* @private
|
||
*/
|
||
_init:[],
|
||
|
||
/**
|
||
* Least significant 24 bits of SHA512 initialization values.
|
||
*
|
||
* Javascript only has 53 bits of precision, so we compute the 40 most
|
||
* significant bits and add the remaining 24 bits as constants.
|
||
*
|
||
* @private
|
||
*/
|
||
_initr: [ 0xbcc908, 0xcaa73b, 0x94f82b, 0x1d36f1, 0xe682d1, 0x3e6c1f, 0x41bd6b, 0x7e2179 ],
|
||
|
||
/*
|
||
_init:
|
||
[0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,
|
||
0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179],
|
||
*/
|
||
|
||
/**
|
||
* The SHA-512 hash key, to be precomputed.
|
||
* @private
|
||
*/
|
||
_key:[],
|
||
|
||
/**
|
||
* Least significant 24 bits of SHA512 key values.
|
||
* @private
|
||
*/
|
||
_keyr:
|
||
[0x28ae22, 0xef65cd, 0x4d3b2f, 0x89dbbc, 0x48b538, 0x05d019, 0x194f9b, 0x6d8118,
|
||
0x030242, 0x706fbe, 0xe4b28c, 0xffb4e2, 0x7b896f, 0x1696b1, 0xc71235, 0x692694,
|
||
0xf14ad2, 0x4f25e3, 0x8cd5b5, 0xac9c65, 0x2b0275, 0xa6e483, 0x41fbd4, 0x1153b5,
|
||
0x66dfab, 0xb43210, 0xfb213f, 0xef0ee4, 0xa88fc2, 0x0aa725, 0x03826f, 0x0e6e70,
|
||
0xd22ffc, 0x26c926, 0xc42aed, 0x95b3df, 0xaf63de, 0x77b2a8, 0xedaee6, 0x82353b,
|
||
0xf10364, 0x423001, 0xf89791, 0x54be30, 0xef5218, 0x65a910, 0x71202a, 0xbbd1b8,
|
||
0xd2d0c8, 0x41ab53, 0x8eeb99, 0x9b48a8, 0xc95a63, 0x418acb, 0x63e373, 0xb2b8a3,
|
||
0xefb2fc, 0x172f60, 0xf0ab72, 0x6439ec, 0x631e28, 0x82bde9, 0xc67915, 0x72532b,
|
||
0x26619c, 0xc0c207, 0xe0eb1e, 0x6ed178, 0x176fba, 0xc898a6, 0xf90dae, 0x1c471b,
|
||
0x047d84, 0xc72493, 0xc9bebc, 0x100d4c, 0x3e42b6, 0x657e2a, 0xd6faec, 0x475817],
|
||
|
||
/*
|
||
_key:
|
||
[0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,
|
||
0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,
|
||
0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,
|
||
0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,
|
||
0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,
|
||
0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,
|
||
0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,
|
||
0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,
|
||
0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,
|
||
0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,
|
||
0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,
|
||
0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,
|
||
0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,
|
||
0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,
|
||
0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,
|
||
0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,
|
||
0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,
|
||
0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,
|
||
0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,
|
||
0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817],
|
||
*/
|
||
|
||
/**
|
||
* Function to precompute _init and _key.
|
||
* @private
|
||
*/
|
||
_precompute: function () {
|
||
// XXX: This code is for precomputing the SHA256 constants, change for
|
||
// SHA512 and re-enable.
|
||
var i = 0, prime = 2, factor;
|
||
|
||
function frac(x) { return (x-Math.floor(x)) * 0x100000000 | 0; }
|
||
function frac2(x) { return (x-Math.floor(x)) * 0x10000000000 & 0xff; }
|
||
|
||
outer: for (; i<80; prime++) {
|
||
for (factor=2; factor*factor <= prime; factor++) {
|
||
if (prime % factor === 0) {
|
||
// not a prime
|
||
continue outer;
|
||
}
|
||
}
|
||
|
||
if (i<8) {
|
||
this._init[i*2] = frac(Math.pow(prime, 1/2));
|
||
this._init[i*2+1] = (frac2(Math.pow(prime, 1/2)) << 24) | this._initr[i];
|
||
}
|
||
this._key[i*2] = frac(Math.pow(prime, 1/3));
|
||
this._key[i*2+1] = (frac2(Math.pow(prime, 1/3)) << 24) | this._keyr[i];
|
||
i++;
|
||
}
|
||
},
|
||
|
||
/**
|
||
* Perform one cycle of SHA-512.
|
||
* @param {bitArray} words one block of words.
|
||
* @private
|
||
*/
|
||
_block:function (words) {
|
||
var i, wrh, wrl,
|
||
w = words.slice(0),
|
||
h = this._h,
|
||
k = this._key,
|
||
h0h = h[ 0], h0l = h[ 1], h1h = h[ 2], h1l = h[ 3],
|
||
h2h = h[ 4], h2l = h[ 5], h3h = h[ 6], h3l = h[ 7],
|
||
h4h = h[ 8], h4l = h[ 9], h5h = h[10], h5l = h[11],
|
||
h6h = h[12], h6l = h[13], h7h = h[14], h7l = h[15];
|
||
|
||
// Working variables
|
||
var ah = h0h, al = h0l, bh = h1h, bl = h1l,
|
||
ch = h2h, cl = h2l, dh = h3h, dl = h3l,
|
||
eh = h4h, el = h4l, fh = h5h, fl = h5l,
|
||
gh = h6h, gl = h6l, hh = h7h, hl = h7l;
|
||
|
||
for (i=0; i<80; i++) {
|
||
// load up the input word for this round
|
||
if (i<16) {
|
||
wrh = w[i * 2];
|
||
wrl = w[i * 2 + 1];
|
||
} else {
|
||
// Gamma0
|
||
var gamma0xh = w[(i-15) * 2];
|
||
var gamma0xl = w[(i-15) * 2 + 1];
|
||
var gamma0h =
|
||
((gamma0xl << 31) | (gamma0xh >>> 1)) ^
|
||
((gamma0xl << 24) | (gamma0xh >>> 8)) ^
|
||
(gamma0xh >>> 7);
|
||
var gamma0l =
|
||
((gamma0xh << 31) | (gamma0xl >>> 1)) ^
|
||
((gamma0xh << 24) | (gamma0xl >>> 8)) ^
|
||
((gamma0xh << 25) | (gamma0xl >>> 7));
|
||
|
||
// Gamma1
|
||
var gamma1xh = w[(i-2) * 2];
|
||
var gamma1xl = w[(i-2) * 2 + 1];
|
||
var gamma1h =
|
||
((gamma1xl << 13) | (gamma1xh >>> 19)) ^
|
||
((gamma1xh << 3) | (gamma1xl >>> 29)) ^
|
||
(gamma1xh >>> 6);
|
||
var gamma1l =
|
||
((gamma1xh << 13) | (gamma1xl >>> 19)) ^
|
||
((gamma1xl << 3) | (gamma1xh >>> 29)) ^
|
||
((gamma1xh << 26) | (gamma1xl >>> 6));
|
||
|
||
// Shortcuts
|
||
var wr7h = w[(i-7) * 2];
|
||
var wr7l = w[(i-7) * 2 + 1];
|
||
|
||
var wr16h = w[(i-16) * 2];
|
||
var wr16l = w[(i-16) * 2 + 1];
|
||
|
||
// W(round) = gamma0 + W(round - 7) + gamma1 + W(round - 16)
|
||
wrl = gamma0l + wr7l;
|
||
wrh = gamma0h + wr7h + ((wrl >>> 0) < (gamma0l >>> 0) ? 1 : 0);
|
||
wrl += gamma1l;
|
||
wrh += gamma1h + ((wrl >>> 0) < (gamma1l >>> 0) ? 1 : 0);
|
||
wrl += wr16l;
|
||
wrh += wr16h + ((wrl >>> 0) < (wr16l >>> 0) ? 1 : 0);
|
||
}
|
||
|
||
w[i*2] = wrh |= 0;
|
||
w[i*2 + 1] = wrl |= 0;
|
||
|
||
// Ch
|
||
var chh = (eh & fh) ^ (~eh & gh);
|
||
var chl = (el & fl) ^ (~el & gl);
|
||
|
||
// Maj
|
||
var majh = (ah & bh) ^ (ah & ch) ^ (bh & ch);
|
||
var majl = (al & bl) ^ (al & cl) ^ (bl & cl);
|
||
|
||
// Sigma0
|
||
var sigma0h = ((al << 4) | (ah >>> 28)) ^ ((ah << 30) | (al >>> 2)) ^ ((ah << 25) | (al >>> 7));
|
||
var sigma0l = ((ah << 4) | (al >>> 28)) ^ ((al << 30) | (ah >>> 2)) ^ ((al << 25) | (ah >>> 7));
|
||
|
||
// Sigma1
|
||
var sigma1h = ((el << 18) | (eh >>> 14)) ^ ((el << 14) | (eh >>> 18)) ^ ((eh << 23) | (el >>> 9));
|
||
var sigma1l = ((eh << 18) | (el >>> 14)) ^ ((eh << 14) | (el >>> 18)) ^ ((el << 23) | (eh >>> 9));
|
||
|
||
// K(round)
|
||
var krh = k[i*2];
|
||
var krl = k[i*2+1];
|
||
|
||
// t1 = h + sigma1 + ch + K(round) + W(round)
|
||
var t1l = hl + sigma1l;
|
||
var t1h = hh + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0);
|
||
t1l += chl;
|
||
t1h += chh + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0);
|
||
t1l += krl;
|
||
t1h += krh + ((t1l >>> 0) < (krl >>> 0) ? 1 : 0);
|
||
t1l += wrl;
|
||
t1h += wrh + ((t1l >>> 0) < (wrl >>> 0) ? 1 : 0);
|
||
|
||
// t2 = sigma0 + maj
|
||
var t2l = sigma0l + majl;
|
||
var t2h = sigma0h + majh + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0);
|
||
|
||
// Update working variables
|
||
hh = gh;
|
||
hl = gl;
|
||
gh = fh;
|
||
gl = fl;
|
||
fh = eh;
|
||
fl = el;
|
||
el = (dl + t1l) | 0;
|
||
eh = (dh + t1h + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;
|
||
dh = ch;
|
||
dl = cl;
|
||
ch = bh;
|
||
cl = bl;
|
||
bh = ah;
|
||
bl = al;
|
||
al = (t1l + t2l) | 0;
|
||
ah = (t1h + t2h + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0;
|
||
}
|
||
|
||
// Intermediate hash
|
||
h0l = h[1] = (h0l + al) | 0;
|
||
h[0] = (h0h + ah + ((h0l >>> 0) < (al >>> 0) ? 1 : 0)) | 0;
|
||
h1l = h[3] = (h1l + bl) | 0;
|
||
h[2] = (h1h + bh + ((h1l >>> 0) < (bl >>> 0) ? 1 : 0)) | 0;
|
||
h2l = h[5] = (h2l + cl) | 0;
|
||
h[4] = (h2h + ch + ((h2l >>> 0) < (cl >>> 0) ? 1 : 0)) | 0;
|
||
h3l = h[7] = (h3l + dl) | 0;
|
||
h[6] = (h3h + dh + ((h3l >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;
|
||
h4l = h[9] = (h4l + el) | 0;
|
||
h[8] = (h4h + eh + ((h4l >>> 0) < (el >>> 0) ? 1 : 0)) | 0;
|
||
h5l = h[11] = (h5l + fl) | 0;
|
||
h[10] = (h5h + fh + ((h5l >>> 0) < (fl >>> 0) ? 1 : 0)) | 0;
|
||
h6l = h[13] = (h6l + gl) | 0;
|
||
h[12] = (h6h + gh + ((h6l >>> 0) < (gl >>> 0) ? 1 : 0)) | 0;
|
||
h7l = h[15] = (h7l + hl) | 0;
|
||
h[14] = (h7h + hh + ((h7l >>> 0) < (hl >>> 0) ? 1 : 0)) | 0;
|
||
}
|
||
};
|
||
|
||
|