mirror of
https://github.com/JonasunderscoreJones/api-worker.git
synced 2025-10-23 10:29:19 +02:00
16432 lines
420 KiB
JavaScript
16432 lines
420 KiB
JavaScript
import buffer$1 from 'buffer';
|
|
import stream from 'stream';
|
|
import string_decoder from 'string_decoder';
|
|
import crypto$1 from 'crypto';
|
|
import vm from 'vm';
|
|
|
|
var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
|
|
|
|
function createCommonjsModule(fn, module) {
|
|
return module = { exports: {} }, fn(module, module.exports), module.exports;
|
|
}
|
|
|
|
function getCjsExportFromNamespace (n) {
|
|
return n && n['default'] || n;
|
|
}
|
|
|
|
var safeBuffer = createCommonjsModule(function (module, exports) {
|
|
/* eslint-disable node/no-deprecated-api */
|
|
|
|
var Buffer = buffer$1.Buffer;
|
|
|
|
// alternative to using Object.keys for old browsers
|
|
function copyProps (src, dst) {
|
|
for (var key in src) {
|
|
dst[key] = src[key];
|
|
}
|
|
}
|
|
if (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {
|
|
module.exports = buffer$1;
|
|
} else {
|
|
// Copy properties from require('buffer')
|
|
copyProps(buffer$1, exports);
|
|
exports.Buffer = SafeBuffer;
|
|
}
|
|
|
|
function SafeBuffer (arg, encodingOrOffset, length) {
|
|
return Buffer(arg, encodingOrOffset, length)
|
|
}
|
|
|
|
// Copy static methods from Buffer
|
|
copyProps(Buffer, SafeBuffer);
|
|
|
|
SafeBuffer.from = function (arg, encodingOrOffset, length) {
|
|
if (typeof arg === 'number') {
|
|
throw new TypeError('Argument must not be a number')
|
|
}
|
|
return Buffer(arg, encodingOrOffset, length)
|
|
};
|
|
|
|
SafeBuffer.alloc = function (size, fill, encoding) {
|
|
if (typeof size !== 'number') {
|
|
throw new TypeError('Argument must be a number')
|
|
}
|
|
var buf = Buffer(size);
|
|
if (fill !== undefined) {
|
|
if (typeof encoding === 'string') {
|
|
buf.fill(fill, encoding);
|
|
} else {
|
|
buf.fill(fill);
|
|
}
|
|
} else {
|
|
buf.fill(0);
|
|
}
|
|
return buf
|
|
};
|
|
|
|
SafeBuffer.allocUnsafe = function (size) {
|
|
if (typeof size !== 'number') {
|
|
throw new TypeError('Argument must be a number')
|
|
}
|
|
return Buffer(size)
|
|
};
|
|
|
|
SafeBuffer.allocUnsafeSlow = function (size) {
|
|
if (typeof size !== 'number') {
|
|
throw new TypeError('Argument must be a number')
|
|
}
|
|
return buffer$1.SlowBuffer(size)
|
|
};
|
|
});
|
|
var safeBuffer_1 = safeBuffer.Buffer;
|
|
|
|
var browser = createCommonjsModule(function (module) {
|
|
|
|
// limit of Crypto.getRandomValues()
|
|
// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues
|
|
var MAX_BYTES = 65536;
|
|
|
|
// Node supports requesting up to this number of bytes
|
|
// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48
|
|
var MAX_UINT32 = 4294967295;
|
|
|
|
function oldBrowser () {
|
|
throw new Error('Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11')
|
|
}
|
|
|
|
var Buffer = safeBuffer.Buffer;
|
|
var crypto = commonjsGlobal.crypto || commonjsGlobal.msCrypto;
|
|
|
|
if (crypto && crypto.getRandomValues) {
|
|
module.exports = randomBytes;
|
|
} else {
|
|
module.exports = oldBrowser;
|
|
}
|
|
|
|
function randomBytes (size, cb) {
|
|
// phantomjs needs to throw
|
|
if (size > MAX_UINT32) throw new RangeError('requested too many random bytes')
|
|
|
|
var bytes = Buffer.allocUnsafe(size);
|
|
|
|
if (size > 0) { // getRandomValues fails on IE if size == 0
|
|
if (size > MAX_BYTES) { // this is the max bytes crypto.getRandomValues
|
|
// can do at once see https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues
|
|
for (var generated = 0; generated < size; generated += MAX_BYTES) {
|
|
// buffer.slice automatically checks if the end is past the end of
|
|
// the buffer so we don't have to here
|
|
crypto.getRandomValues(bytes.slice(generated, generated + MAX_BYTES));
|
|
}
|
|
} else {
|
|
crypto.getRandomValues(bytes);
|
|
}
|
|
}
|
|
|
|
if (typeof cb === 'function') {
|
|
return process.nextTick(function () {
|
|
cb(null, bytes);
|
|
})
|
|
}
|
|
|
|
return bytes
|
|
}
|
|
});
|
|
|
|
var inherits_browser = createCommonjsModule(function (module) {
|
|
if (typeof Object.create === 'function') {
|
|
// implementation from standard node.js 'util' module
|
|
module.exports = function inherits(ctor, superCtor) {
|
|
ctor.super_ = superCtor;
|
|
ctor.prototype = Object.create(superCtor.prototype, {
|
|
constructor: {
|
|
value: ctor,
|
|
enumerable: false,
|
|
writable: true,
|
|
configurable: true
|
|
}
|
|
});
|
|
};
|
|
} else {
|
|
// old school shim for old browsers
|
|
module.exports = function inherits(ctor, superCtor) {
|
|
ctor.super_ = superCtor;
|
|
var TempCtor = function () {};
|
|
TempCtor.prototype = superCtor.prototype;
|
|
ctor.prototype = new TempCtor();
|
|
ctor.prototype.constructor = ctor;
|
|
};
|
|
}
|
|
});
|
|
|
|
var Buffer$1 = safeBuffer.Buffer;
|
|
var Transform = stream.Transform;
|
|
|
|
|
|
function throwIfNotStringOrBuffer (val, prefix) {
|
|
if (!Buffer$1.isBuffer(val) && typeof val !== 'string') {
|
|
throw new TypeError(prefix + ' must be a string or a buffer')
|
|
}
|
|
}
|
|
|
|
function HashBase (blockSize) {
|
|
Transform.call(this);
|
|
|
|
this._block = Buffer$1.allocUnsafe(blockSize);
|
|
this._blockSize = blockSize;
|
|
this._blockOffset = 0;
|
|
this._length = [0, 0, 0, 0];
|
|
|
|
this._finalized = false;
|
|
}
|
|
|
|
inherits_browser(HashBase, Transform);
|
|
|
|
HashBase.prototype._transform = function (chunk, encoding, callback) {
|
|
var error = null;
|
|
try {
|
|
this.update(chunk, encoding);
|
|
} catch (err) {
|
|
error = err;
|
|
}
|
|
|
|
callback(error);
|
|
};
|
|
|
|
HashBase.prototype._flush = function (callback) {
|
|
var error = null;
|
|
try {
|
|
this.push(this.digest());
|
|
} catch (err) {
|
|
error = err;
|
|
}
|
|
|
|
callback(error);
|
|
};
|
|
|
|
HashBase.prototype.update = function (data, encoding) {
|
|
throwIfNotStringOrBuffer(data, 'Data');
|
|
if (this._finalized) throw new Error('Digest already called')
|
|
if (!Buffer$1.isBuffer(data)) data = Buffer$1.from(data, encoding);
|
|
|
|
// consume data
|
|
var block = this._block;
|
|
var offset = 0;
|
|
while (this._blockOffset + data.length - offset >= this._blockSize) {
|
|
for (var 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 (var 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
|
|
};
|
|
|
|
HashBase.prototype._update = function () {
|
|
throw new Error('_update is not implemented')
|
|
};
|
|
|
|
HashBase.prototype.digest = function (encoding) {
|
|
if (this._finalized) throw new Error('Digest already called')
|
|
this._finalized = true;
|
|
|
|
var digest = this._digest();
|
|
if (encoding !== undefined) digest = digest.toString(encoding);
|
|
|
|
// reset state
|
|
this._block.fill(0);
|
|
this._blockOffset = 0;
|
|
for (var i = 0; i < 4; ++i) this._length[i] = 0;
|
|
|
|
return digest
|
|
};
|
|
|
|
HashBase.prototype._digest = function () {
|
|
throw new Error('_digest is not implemented')
|
|
};
|
|
|
|
var hashBase = HashBase;
|
|
|
|
var Buffer$2 = safeBuffer.Buffer;
|
|
|
|
var ARRAY16 = new Array(16);
|
|
|
|
function MD5 () {
|
|
hashBase.call(this, 64);
|
|
|
|
// state
|
|
this._a = 0x67452301;
|
|
this._b = 0xefcdab89;
|
|
this._c = 0x98badcfe;
|
|
this._d = 0x10325476;
|
|
}
|
|
|
|
inherits_browser(MD5, hashBase);
|
|
|
|
MD5.prototype._update = function () {
|
|
var M = ARRAY16;
|
|
for (var i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4);
|
|
|
|
var a = this._a;
|
|
var b = this._b;
|
|
var c = this._c;
|
|
var d = this._d;
|
|
|
|
a = fnF(a, b, c, d, M[0], 0xd76aa478, 7);
|
|
d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12);
|
|
c = fnF(c, d, a, b, M[2], 0x242070db, 17);
|
|
b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22);
|
|
a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7);
|
|
d = fnF(d, a, b, c, M[5], 0x4787c62a, 12);
|
|
c = fnF(c, d, a, b, M[6], 0xa8304613, 17);
|
|
b = fnF(b, c, d, a, M[7], 0xfd469501, 22);
|
|
a = fnF(a, b, c, d, M[8], 0x698098d8, 7);
|
|
d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12);
|
|
c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17);
|
|
b = fnF(b, c, d, a, M[11], 0x895cd7be, 22);
|
|
a = fnF(a, b, c, d, M[12], 0x6b901122, 7);
|
|
d = fnF(d, a, b, c, M[13], 0xfd987193, 12);
|
|
c = fnF(c, d, a, b, M[14], 0xa679438e, 17);
|
|
b = fnF(b, c, d, a, M[15], 0x49b40821, 22);
|
|
|
|
a = fnG(a, b, c, d, M[1], 0xf61e2562, 5);
|
|
d = fnG(d, a, b, c, M[6], 0xc040b340, 9);
|
|
c = fnG(c, d, a, b, M[11], 0x265e5a51, 14);
|
|
b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20);
|
|
a = fnG(a, b, c, d, M[5], 0xd62f105d, 5);
|
|
d = fnG(d, a, b, c, M[10], 0x02441453, 9);
|
|
c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14);
|
|
b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20);
|
|
a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5);
|
|
d = fnG(d, a, b, c, M[14], 0xc33707d6, 9);
|
|
c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14);
|
|
b = fnG(b, c, d, a, M[8], 0x455a14ed, 20);
|
|
a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5);
|
|
d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9);
|
|
c = fnG(c, d, a, b, M[7], 0x676f02d9, 14);
|
|
b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20);
|
|
|
|
a = fnH(a, b, c, d, M[5], 0xfffa3942, 4);
|
|
d = fnH(d, a, b, c, M[8], 0x8771f681, 11);
|
|
c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16);
|
|
b = fnH(b, c, d, a, M[14], 0xfde5380c, 23);
|
|
a = fnH(a, b, c, d, M[1], 0xa4beea44, 4);
|
|
d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11);
|
|
c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16);
|
|
b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23);
|
|
a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4);
|
|
d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11);
|
|
c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16);
|
|
b = fnH(b, c, d, a, M[6], 0x04881d05, 23);
|
|
a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4);
|
|
d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11);
|
|
c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16);
|
|
b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23);
|
|
|
|
a = fnI(a, b, c, d, M[0], 0xf4292244, 6);
|
|
d = fnI(d, a, b, c, M[7], 0x432aff97, 10);
|
|
c = fnI(c, d, a, b, M[14], 0xab9423a7, 15);
|
|
b = fnI(b, c, d, a, M[5], 0xfc93a039, 21);
|
|
a = fnI(a, b, c, d, M[12], 0x655b59c3, 6);
|
|
d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10);
|
|
c = fnI(c, d, a, b, M[10], 0xffeff47d, 15);
|
|
b = fnI(b, c, d, a, M[1], 0x85845dd1, 21);
|
|
a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6);
|
|
d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10);
|
|
c = fnI(c, d, a, b, M[6], 0xa3014314, 15);
|
|
b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21);
|
|
a = fnI(a, b, c, d, M[4], 0xf7537e82, 6);
|
|
d = fnI(d, a, b, c, M[11], 0xbd3af235, 10);
|
|
c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15);
|
|
b = fnI(b, c, d, a, M[9], 0xeb86d391, 21);
|
|
|
|
this._a = (this._a + a) | 0;
|
|
this._b = (this._b + b) | 0;
|
|
this._c = (this._c + c) | 0;
|
|
this._d = (this._d + d) | 0;
|
|
};
|
|
|
|
MD5.prototype._digest = function () {
|
|
// 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);
|
|
this._block.writeUInt32LE(this._length[0], 56);
|
|
this._block.writeUInt32LE(this._length[1], 60);
|
|
this._update();
|
|
|
|
// produce result
|
|
var buffer = Buffer$2.allocUnsafe(16);
|
|
buffer.writeInt32LE(this._a, 0);
|
|
buffer.writeInt32LE(this._b, 4);
|
|
buffer.writeInt32LE(this._c, 8);
|
|
buffer.writeInt32LE(this._d, 12);
|
|
return buffer
|
|
};
|
|
|
|
function rotl (x, n) {
|
|
return (x << n) | (x >>> (32 - n))
|
|
}
|
|
|
|
function fnF (a, b, c, d, m, k, s) {
|
|
return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + b) | 0
|
|
}
|
|
|
|
function fnG (a, b, c, d, m, k, s) {
|
|
return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + b) | 0
|
|
}
|
|
|
|
function fnH (a, b, c, d, m, k, s) {
|
|
return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0
|
|
}
|
|
|
|
function fnI (a, b, c, d, m, k, s) {
|
|
return (rotl((a + ((c ^ (b | (~d)))) + m + k) | 0, s) + b) | 0
|
|
}
|
|
|
|
var md5_js = MD5;
|
|
|
|
var Buffer$3 = buffer$1.Buffer;
|
|
|
|
|
|
|
|
var ARRAY16$1 = new Array(16);
|
|
|
|
var 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
|
|
];
|
|
|
|
var 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
|
|
];
|
|
|
|
var 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
|
|
];
|
|
|
|
var 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
|
|
];
|
|
|
|
var hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e];
|
|
var hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000];
|
|
|
|
function RIPEMD160 () {
|
|
hashBase.call(this, 64);
|
|
|
|
// state
|
|
this._a = 0x67452301;
|
|
this._b = 0xefcdab89;
|
|
this._c = 0x98badcfe;
|
|
this._d = 0x10325476;
|
|
this._e = 0xc3d2e1f0;
|
|
}
|
|
|
|
inherits_browser(RIPEMD160, hashBase);
|
|
|
|
RIPEMD160.prototype._update = function () {
|
|
var words = ARRAY16$1;
|
|
for (var j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4);
|
|
|
|
var al = this._a | 0;
|
|
var bl = this._b | 0;
|
|
var cl = this._c | 0;
|
|
var dl = this._d | 0;
|
|
var el = this._e | 0;
|
|
|
|
var ar = this._a | 0;
|
|
var br = this._b | 0;
|
|
var cr = this._c | 0;
|
|
var dr = this._d | 0;
|
|
var er = this._e | 0;
|
|
|
|
// computation
|
|
for (var i = 0; i < 80; i += 1) {
|
|
var tl;
|
|
var 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$1(cl, 10);
|
|
cl = bl;
|
|
bl = tl;
|
|
|
|
ar = er;
|
|
er = dr;
|
|
dr = rotl$1(cr, 10);
|
|
cr = br;
|
|
br = tr;
|
|
}
|
|
|
|
// update state
|
|
var 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;
|
|
};
|
|
|
|
RIPEMD160.prototype._digest = function () {
|
|
// 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);
|
|
this._block.writeUInt32LE(this._length[0], 56);
|
|
this._block.writeUInt32LE(this._length[1], 60);
|
|
this._update();
|
|
|
|
// produce result
|
|
var buffer = Buffer$3.alloc ? Buffer$3.alloc(20) : new Buffer$3(20);
|
|
buffer.writeInt32LE(this._a, 0);
|
|
buffer.writeInt32LE(this._b, 4);
|
|
buffer.writeInt32LE(this._c, 8);
|
|
buffer.writeInt32LE(this._d, 12);
|
|
buffer.writeInt32LE(this._e, 16);
|
|
return buffer
|
|
};
|
|
|
|
function rotl$1 (x, n) {
|
|
return (x << n) | (x >>> (32 - n))
|
|
}
|
|
|
|
function fn1 (a, b, c, d, e, m, k, s) {
|
|
return (rotl$1((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0
|
|
}
|
|
|
|
function fn2 (a, b, c, d, e, m, k, s) {
|
|
return (rotl$1((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + e) | 0
|
|
}
|
|
|
|
function fn3 (a, b, c, d, e, m, k, s) {
|
|
return (rotl$1((a + ((b | (~c)) ^ d) + m + k) | 0, s) + e) | 0
|
|
}
|
|
|
|
function fn4 (a, b, c, d, e, m, k, s) {
|
|
return (rotl$1((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + e) | 0
|
|
}
|
|
|
|
function fn5 (a, b, c, d, e, m, k, s) {
|
|
return (rotl$1((a + (b ^ (c | (~d))) + m + k) | 0, s) + e) | 0
|
|
}
|
|
|
|
var ripemd160 = RIPEMD160;
|
|
|
|
var Buffer$4 = safeBuffer.Buffer;
|
|
|
|
// prototype class for hash functions
|
|
function Hash (blockSize, finalSize) {
|
|
this._block = Buffer$4.alloc(blockSize);
|
|
this._finalSize = finalSize;
|
|
this._blockSize = blockSize;
|
|
this._len = 0;
|
|
}
|
|
|
|
Hash.prototype.update = function (data, enc) {
|
|
if (typeof data === 'string') {
|
|
enc = enc || 'utf8';
|
|
data = Buffer$4.from(data, enc);
|
|
}
|
|
|
|
var block = this._block;
|
|
var blockSize = this._blockSize;
|
|
var length = data.length;
|
|
var accum = this._len;
|
|
|
|
for (var offset = 0; offset < length;) {
|
|
var assigned = accum % blockSize;
|
|
var remainder = Math.min(length - offset, blockSize - assigned);
|
|
|
|
for (var i = 0; i < remainder; i++) {
|
|
block[assigned + i] = data[offset + i];
|
|
}
|
|
|
|
accum += remainder;
|
|
offset += remainder;
|
|
|
|
if ((accum % blockSize) === 0) {
|
|
this._update(block);
|
|
}
|
|
}
|
|
|
|
this._len += length;
|
|
return this
|
|
};
|
|
|
|
Hash.prototype.digest = function (enc) {
|
|
var rem = this._len % this._blockSize;
|
|
|
|
this._block[rem] = 0x80;
|
|
|
|
// zero (rem + 1) trailing bits, where (rem + 1) is the smallest
|
|
// non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize
|
|
this._block.fill(0, rem + 1);
|
|
|
|
if (rem >= this._finalSize) {
|
|
this._update(this._block);
|
|
this._block.fill(0);
|
|
}
|
|
|
|
var bits = this._len * 8;
|
|
|
|
// uint32
|
|
if (bits <= 0xffffffff) {
|
|
this._block.writeUInt32BE(bits, this._blockSize - 4);
|
|
|
|
// uint64
|
|
} else {
|
|
var lowBits = (bits & 0xffffffff) >>> 0;
|
|
var highBits = (bits - lowBits) / 0x100000000;
|
|
|
|
this._block.writeUInt32BE(highBits, this._blockSize - 8);
|
|
this._block.writeUInt32BE(lowBits, this._blockSize - 4);
|
|
}
|
|
|
|
this._update(this._block);
|
|
var hash = this._hash();
|
|
|
|
return enc ? hash.toString(enc) : hash
|
|
};
|
|
|
|
Hash.prototype._update = function () {
|
|
throw new Error('_update must be implemented by subclass')
|
|
};
|
|
|
|
var hash = Hash;
|
|
|
|
/*
|
|
* A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined
|
|
* in FIPS PUB 180-1
|
|
* This source code is derived from sha1.js of the same repository.
|
|
* The difference between SHA-0 and SHA-1 is just a bitwise rotate left
|
|
* operation was added.
|
|
*/
|
|
|
|
|
|
|
|
var Buffer$5 = safeBuffer.Buffer;
|
|
|
|
var K = [
|
|
0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0
|
|
];
|
|
|
|
var W = new Array(80);
|
|
|
|
function Sha () {
|
|
this.init();
|
|
this._w = W;
|
|
|
|
hash.call(this, 64, 56);
|
|
}
|
|
|
|
inherits_browser(Sha, hash);
|
|
|
|
Sha.prototype.init = function () {
|
|
this._a = 0x67452301;
|
|
this._b = 0xefcdab89;
|
|
this._c = 0x98badcfe;
|
|
this._d = 0x10325476;
|
|
this._e = 0xc3d2e1f0;
|
|
|
|
return this
|
|
};
|
|
|
|
function rotl5 (num) {
|
|
return (num << 5) | (num >>> 27)
|
|
}
|
|
|
|
function rotl30 (num) {
|
|
return (num << 30) | (num >>> 2)
|
|
}
|
|
|
|
function ft (s, b, c, d) {
|
|
if (s === 0) return (b & c) | ((~b) & d)
|
|
if (s === 2) return (b & c) | (b & d) | (c & d)
|
|
return b ^ c ^ d
|
|
}
|
|
|
|
Sha.prototype._update = function (M) {
|
|
var W = this._w;
|
|
|
|
var a = this._a | 0;
|
|
var b = this._b | 0;
|
|
var c = this._c | 0;
|
|
var d = this._d | 0;
|
|
var e = this._e | 0;
|
|
|
|
for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4);
|
|
for (; i < 80; ++i) W[i] = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];
|
|
|
|
for (var j = 0; j < 80; ++j) {
|
|
var s = ~~(j / 20);
|
|
var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0;
|
|
|
|
e = d;
|
|
d = c;
|
|
c = rotl30(b);
|
|
b = a;
|
|
a = t;
|
|
}
|
|
|
|
this._a = (a + this._a) | 0;
|
|
this._b = (b + this._b) | 0;
|
|
this._c = (c + this._c) | 0;
|
|
this._d = (d + this._d) | 0;
|
|
this._e = (e + this._e) | 0;
|
|
};
|
|
|
|
Sha.prototype._hash = function () {
|
|
var H = Buffer$5.allocUnsafe(20);
|
|
|
|
H.writeInt32BE(this._a | 0, 0);
|
|
H.writeInt32BE(this._b | 0, 4);
|
|
H.writeInt32BE(this._c | 0, 8);
|
|
H.writeInt32BE(this._d | 0, 12);
|
|
H.writeInt32BE(this._e | 0, 16);
|
|
|
|
return H
|
|
};
|
|
|
|
var sha = Sha;
|
|
|
|
/*
|
|
* A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
|
|
* in FIPS PUB 180-1
|
|
* Version 2.1a Copyright Paul Johnston 2000 - 2002.
|
|
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
|
|
* Distributed under the BSD License
|
|
* See http://pajhome.org.uk/crypt/md5 for details.
|
|
*/
|
|
|
|
|
|
|
|
var Buffer$6 = safeBuffer.Buffer;
|
|
|
|
var K$1 = [
|
|
0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0
|
|
];
|
|
|
|
var W$1 = new Array(80);
|
|
|
|
function Sha1 () {
|
|
this.init();
|
|
this._w = W$1;
|
|
|
|
hash.call(this, 64, 56);
|
|
}
|
|
|
|
inherits_browser(Sha1, hash);
|
|
|
|
Sha1.prototype.init = function () {
|
|
this._a = 0x67452301;
|
|
this._b = 0xefcdab89;
|
|
this._c = 0x98badcfe;
|
|
this._d = 0x10325476;
|
|
this._e = 0xc3d2e1f0;
|
|
|
|
return this
|
|
};
|
|
|
|
function rotl1 (num) {
|
|
return (num << 1) | (num >>> 31)
|
|
}
|
|
|
|
function rotl5$1 (num) {
|
|
return (num << 5) | (num >>> 27)
|
|
}
|
|
|
|
function rotl30$1 (num) {
|
|
return (num << 30) | (num >>> 2)
|
|
}
|
|
|
|
function ft$1 (s, b, c, d) {
|
|
if (s === 0) return (b & c) | ((~b) & d)
|
|
if (s === 2) return (b & c) | (b & d) | (c & d)
|
|
return b ^ c ^ d
|
|
}
|
|
|
|
Sha1.prototype._update = function (M) {
|
|
var W = this._w;
|
|
|
|
var a = this._a | 0;
|
|
var b = this._b | 0;
|
|
var c = this._c | 0;
|
|
var d = this._d | 0;
|
|
var e = this._e | 0;
|
|
|
|
for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4);
|
|
for (; i < 80; ++i) W[i] = rotl1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]);
|
|
|
|
for (var j = 0; j < 80; ++j) {
|
|
var s = ~~(j / 20);
|
|
var t = (rotl5$1(a) + ft$1(s, b, c, d) + e + W[j] + K$1[s]) | 0;
|
|
|
|
e = d;
|
|
d = c;
|
|
c = rotl30$1(b);
|
|
b = a;
|
|
a = t;
|
|
}
|
|
|
|
this._a = (a + this._a) | 0;
|
|
this._b = (b + this._b) | 0;
|
|
this._c = (c + this._c) | 0;
|
|
this._d = (d + this._d) | 0;
|
|
this._e = (e + this._e) | 0;
|
|
};
|
|
|
|
Sha1.prototype._hash = function () {
|
|
var H = Buffer$6.allocUnsafe(20);
|
|
|
|
H.writeInt32BE(this._a | 0, 0);
|
|
H.writeInt32BE(this._b | 0, 4);
|
|
H.writeInt32BE(this._c | 0, 8);
|
|
H.writeInt32BE(this._d | 0, 12);
|
|
H.writeInt32BE(this._e | 0, 16);
|
|
|
|
return H
|
|
};
|
|
|
|
var sha1 = Sha1;
|
|
|
|
/**
|
|
* A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined
|
|
* in FIPS 180-2
|
|
* Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.
|
|
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
|
|
*
|
|
*/
|
|
|
|
|
|
|
|
var Buffer$7 = safeBuffer.Buffer;
|
|
|
|
var K$2 = [
|
|
0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
|
|
0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
|
|
0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
|
|
0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
|
|
0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
|
|
0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
|
|
0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
|
|
0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
|
|
0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
|
|
0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
|
|
0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
|
|
0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
|
|
0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
|
|
0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
|
|
0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
|
|
0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2
|
|
];
|
|
|
|
var W$2 = new Array(64);
|
|
|
|
function Sha256 () {
|
|
this.init();
|
|
|
|
this._w = W$2; // new Array(64)
|
|
|
|
hash.call(this, 64, 56);
|
|
}
|
|
|
|
inherits_browser(Sha256, hash);
|
|
|
|
Sha256.prototype.init = function () {
|
|
this._a = 0x6a09e667;
|
|
this._b = 0xbb67ae85;
|
|
this._c = 0x3c6ef372;
|
|
this._d = 0xa54ff53a;
|
|
this._e = 0x510e527f;
|
|
this._f = 0x9b05688c;
|
|
this._g = 0x1f83d9ab;
|
|
this._h = 0x5be0cd19;
|
|
|
|
return this
|
|
};
|
|
|
|
function ch (x, y, z) {
|
|
return z ^ (x & (y ^ z))
|
|
}
|
|
|
|
function maj (x, y, z) {
|
|
return (x & y) | (z & (x | y))
|
|
}
|
|
|
|
function sigma0 (x) {
|
|
return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10)
|
|
}
|
|
|
|
function sigma1 (x) {
|
|
return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7)
|
|
}
|
|
|
|
function gamma0 (x) {
|
|
return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3)
|
|
}
|
|
|
|
function gamma1 (x) {
|
|
return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ (x >>> 10)
|
|
}
|
|
|
|
Sha256.prototype._update = function (M) {
|
|
var W = this._w;
|
|
|
|
var a = this._a | 0;
|
|
var b = this._b | 0;
|
|
var c = this._c | 0;
|
|
var d = this._d | 0;
|
|
var e = this._e | 0;
|
|
var f = this._f | 0;
|
|
var g = this._g | 0;
|
|
var h = this._h | 0;
|
|
|
|
for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4);
|
|
for (; i < 64; ++i) W[i] = (gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16]) | 0;
|
|
|
|
for (var j = 0; j < 64; ++j) {
|
|
var T1 = (h + sigma1(e) + ch(e, f, g) + K$2[j] + W[j]) | 0;
|
|
var T2 = (sigma0(a) + maj(a, b, c)) | 0;
|
|
|
|
h = g;
|
|
g = f;
|
|
f = e;
|
|
e = (d + T1) | 0;
|
|
d = c;
|
|
c = b;
|
|
b = a;
|
|
a = (T1 + T2) | 0;
|
|
}
|
|
|
|
this._a = (a + this._a) | 0;
|
|
this._b = (b + this._b) | 0;
|
|
this._c = (c + this._c) | 0;
|
|
this._d = (d + this._d) | 0;
|
|
this._e = (e + this._e) | 0;
|
|
this._f = (f + this._f) | 0;
|
|
this._g = (g + this._g) | 0;
|
|
this._h = (h + this._h) | 0;
|
|
};
|
|
|
|
Sha256.prototype._hash = function () {
|
|
var H = Buffer$7.allocUnsafe(32);
|
|
|
|
H.writeInt32BE(this._a, 0);
|
|
H.writeInt32BE(this._b, 4);
|
|
H.writeInt32BE(this._c, 8);
|
|
H.writeInt32BE(this._d, 12);
|
|
H.writeInt32BE(this._e, 16);
|
|
H.writeInt32BE(this._f, 20);
|
|
H.writeInt32BE(this._g, 24);
|
|
H.writeInt32BE(this._h, 28);
|
|
|
|
return H
|
|
};
|
|
|
|
var sha256 = Sha256;
|
|
|
|
/**
|
|
* A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined
|
|
* in FIPS 180-2
|
|
* Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.
|
|
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
|
|
*
|
|
*/
|
|
|
|
|
|
|
|
|
|
var Buffer$8 = safeBuffer.Buffer;
|
|
|
|
var W$3 = new Array(64);
|
|
|
|
function Sha224 () {
|
|
this.init();
|
|
|
|
this._w = W$3; // new Array(64)
|
|
|
|
hash.call(this, 64, 56);
|
|
}
|
|
|
|
inherits_browser(Sha224, sha256);
|
|
|
|
Sha224.prototype.init = function () {
|
|
this._a = 0xc1059ed8;
|
|
this._b = 0x367cd507;
|
|
this._c = 0x3070dd17;
|
|
this._d = 0xf70e5939;
|
|
this._e = 0xffc00b31;
|
|
this._f = 0x68581511;
|
|
this._g = 0x64f98fa7;
|
|
this._h = 0xbefa4fa4;
|
|
|
|
return this
|
|
};
|
|
|
|
Sha224.prototype._hash = function () {
|
|
var H = Buffer$8.allocUnsafe(28);
|
|
|
|
H.writeInt32BE(this._a, 0);
|
|
H.writeInt32BE(this._b, 4);
|
|
H.writeInt32BE(this._c, 8);
|
|
H.writeInt32BE(this._d, 12);
|
|
H.writeInt32BE(this._e, 16);
|
|
H.writeInt32BE(this._f, 20);
|
|
H.writeInt32BE(this._g, 24);
|
|
|
|
return H
|
|
};
|
|
|
|
var sha224 = Sha224;
|
|
|
|
var Buffer$9 = safeBuffer.Buffer;
|
|
|
|
var K$3 = [
|
|
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
|
|
];
|
|
|
|
var W$4 = new Array(160);
|
|
|
|
function Sha512 () {
|
|
this.init();
|
|
this._w = W$4;
|
|
|
|
hash.call(this, 128, 112);
|
|
}
|
|
|
|
inherits_browser(Sha512, hash);
|
|
|
|
Sha512.prototype.init = function () {
|
|
this._ah = 0x6a09e667;
|
|
this._bh = 0xbb67ae85;
|
|
this._ch = 0x3c6ef372;
|
|
this._dh = 0xa54ff53a;
|
|
this._eh = 0x510e527f;
|
|
this._fh = 0x9b05688c;
|
|
this._gh = 0x1f83d9ab;
|
|
this._hh = 0x5be0cd19;
|
|
|
|
this._al = 0xf3bcc908;
|
|
this._bl = 0x84caa73b;
|
|
this._cl = 0xfe94f82b;
|
|
this._dl = 0x5f1d36f1;
|
|
this._el = 0xade682d1;
|
|
this._fl = 0x2b3e6c1f;
|
|
this._gl = 0xfb41bd6b;
|
|
this._hl = 0x137e2179;
|
|
|
|
return this
|
|
};
|
|
|
|
function Ch (x, y, z) {
|
|
return z ^ (x & (y ^ z))
|
|
}
|
|
|
|
function maj$1 (x, y, z) {
|
|
return (x & y) | (z & (x | y))
|
|
}
|
|
|
|
function sigma0$1 (x, xl) {
|
|
return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25)
|
|
}
|
|
|
|
function sigma1$1 (x, xl) {
|
|
return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23)
|
|
}
|
|
|
|
function Gamma0 (x, xl) {
|
|
return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7)
|
|
}
|
|
|
|
function Gamma0l (x, xl) {
|
|
return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25)
|
|
}
|
|
|
|
function Gamma1 (x, xl) {
|
|
return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6)
|
|
}
|
|
|
|
function Gamma1l (x, xl) {
|
|
return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26)
|
|
}
|
|
|
|
function getCarry (a, b) {
|
|
return (a >>> 0) < (b >>> 0) ? 1 : 0
|
|
}
|
|
|
|
Sha512.prototype._update = function (M) {
|
|
var W = this._w;
|
|
|
|
var ah = this._ah | 0;
|
|
var bh = this._bh | 0;
|
|
var ch = this._ch | 0;
|
|
var dh = this._dh | 0;
|
|
var eh = this._eh | 0;
|
|
var fh = this._fh | 0;
|
|
var gh = this._gh | 0;
|
|
var hh = this._hh | 0;
|
|
|
|
var al = this._al | 0;
|
|
var bl = this._bl | 0;
|
|
var cl = this._cl | 0;
|
|
var dl = this._dl | 0;
|
|
var el = this._el | 0;
|
|
var fl = this._fl | 0;
|
|
var gl = this._gl | 0;
|
|
var hl = this._hl | 0;
|
|
|
|
for (var i = 0; i < 32; i += 2) {
|
|
W[i] = M.readInt32BE(i * 4);
|
|
W[i + 1] = M.readInt32BE(i * 4 + 4);
|
|
}
|
|
for (; i < 160; i += 2) {
|
|
var xh = W[i - 15 * 2];
|
|
var xl = W[i - 15 * 2 + 1];
|
|
var gamma0 = Gamma0(xh, xl);
|
|
var gamma0l = Gamma0l(xl, xh);
|
|
|
|
xh = W[i - 2 * 2];
|
|
xl = W[i - 2 * 2 + 1];
|
|
var gamma1 = Gamma1(xh, xl);
|
|
var gamma1l = Gamma1l(xl, xh);
|
|
|
|
// W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]
|
|
var Wi7h = W[i - 7 * 2];
|
|
var Wi7l = W[i - 7 * 2 + 1];
|
|
|
|
var Wi16h = W[i - 16 * 2];
|
|
var Wi16l = W[i - 16 * 2 + 1];
|
|
|
|
var Wil = (gamma0l + Wi7l) | 0;
|
|
var Wih = (gamma0 + Wi7h + getCarry(Wil, gamma0l)) | 0;
|
|
Wil = (Wil + gamma1l) | 0;
|
|
Wih = (Wih + gamma1 + getCarry(Wil, gamma1l)) | 0;
|
|
Wil = (Wil + Wi16l) | 0;
|
|
Wih = (Wih + Wi16h + getCarry(Wil, Wi16l)) | 0;
|
|
|
|
W[i] = Wih;
|
|
W[i + 1] = Wil;
|
|
}
|
|
|
|
for (var j = 0; j < 160; j += 2) {
|
|
Wih = W[j];
|
|
Wil = W[j + 1];
|
|
|
|
var majh = maj$1(ah, bh, ch);
|
|
var majl = maj$1(al, bl, cl);
|
|
|
|
var sigma0h = sigma0$1(ah, al);
|
|
var sigma0l = sigma0$1(al, ah);
|
|
var sigma1h = sigma1$1(eh, el);
|
|
var sigma1l = sigma1$1(el, eh);
|
|
|
|
// t1 = h + sigma1 + ch + K[j] + W[j]
|
|
var Kih = K$3[j];
|
|
var Kil = K$3[j + 1];
|
|
|
|
var chh = Ch(eh, fh, gh);
|
|
var chl = Ch(el, fl, gl);
|
|
|
|
var t1l = (hl + sigma1l) | 0;
|
|
var t1h = (hh + sigma1h + getCarry(t1l, hl)) | 0;
|
|
t1l = (t1l + chl) | 0;
|
|
t1h = (t1h + chh + getCarry(t1l, chl)) | 0;
|
|
t1l = (t1l + Kil) | 0;
|
|
t1h = (t1h + Kih + getCarry(t1l, Kil)) | 0;
|
|
t1l = (t1l + Wil) | 0;
|
|
t1h = (t1h + Wih + getCarry(t1l, Wil)) | 0;
|
|
|
|
// t2 = sigma0 + maj
|
|
var t2l = (sigma0l + majl) | 0;
|
|
var t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0;
|
|
|
|
hh = gh;
|
|
hl = gl;
|
|
gh = fh;
|
|
gl = fl;
|
|
fh = eh;
|
|
fl = el;
|
|
el = (dl + t1l) | 0;
|
|
eh = (dh + t1h + getCarry(el, dl)) | 0;
|
|
dh = ch;
|
|
dl = cl;
|
|
ch = bh;
|
|
cl = bl;
|
|
bh = ah;
|
|
bl = al;
|
|
al = (t1l + t2l) | 0;
|
|
ah = (t1h + t2h + getCarry(al, t1l)) | 0;
|
|
}
|
|
|
|
this._al = (this._al + al) | 0;
|
|
this._bl = (this._bl + bl) | 0;
|
|
this._cl = (this._cl + cl) | 0;
|
|
this._dl = (this._dl + dl) | 0;
|
|
this._el = (this._el + el) | 0;
|
|
this._fl = (this._fl + fl) | 0;
|
|
this._gl = (this._gl + gl) | 0;
|
|
this._hl = (this._hl + hl) | 0;
|
|
|
|
this._ah = (this._ah + ah + getCarry(this._al, al)) | 0;
|
|
this._bh = (this._bh + bh + getCarry(this._bl, bl)) | 0;
|
|
this._ch = (this._ch + ch + getCarry(this._cl, cl)) | 0;
|
|
this._dh = (this._dh + dh + getCarry(this._dl, dl)) | 0;
|
|
this._eh = (this._eh + eh + getCarry(this._el, el)) | 0;
|
|
this._fh = (this._fh + fh + getCarry(this._fl, fl)) | 0;
|
|
this._gh = (this._gh + gh + getCarry(this._gl, gl)) | 0;
|
|
this._hh = (this._hh + hh + getCarry(this._hl, hl)) | 0;
|
|
};
|
|
|
|
Sha512.prototype._hash = function () {
|
|
var H = Buffer$9.allocUnsafe(64);
|
|
|
|
function writeInt64BE (h, l, offset) {
|
|
H.writeInt32BE(h, offset);
|
|
H.writeInt32BE(l, offset + 4);
|
|
}
|
|
|
|
writeInt64BE(this._ah, this._al, 0);
|
|
writeInt64BE(this._bh, this._bl, 8);
|
|
writeInt64BE(this._ch, this._cl, 16);
|
|
writeInt64BE(this._dh, this._dl, 24);
|
|
writeInt64BE(this._eh, this._el, 32);
|
|
writeInt64BE(this._fh, this._fl, 40);
|
|
writeInt64BE(this._gh, this._gl, 48);
|
|
writeInt64BE(this._hh, this._hl, 56);
|
|
|
|
return H
|
|
};
|
|
|
|
var sha512 = Sha512;
|
|
|
|
var Buffer$a = safeBuffer.Buffer;
|
|
|
|
var W$5 = new Array(160);
|
|
|
|
function Sha384 () {
|
|
this.init();
|
|
this._w = W$5;
|
|
|
|
hash.call(this, 128, 112);
|
|
}
|
|
|
|
inherits_browser(Sha384, sha512);
|
|
|
|
Sha384.prototype.init = function () {
|
|
this._ah = 0xcbbb9d5d;
|
|
this._bh = 0x629a292a;
|
|
this._ch = 0x9159015a;
|
|
this._dh = 0x152fecd8;
|
|
this._eh = 0x67332667;
|
|
this._fh = 0x8eb44a87;
|
|
this._gh = 0xdb0c2e0d;
|
|
this._hh = 0x47b5481d;
|
|
|
|
this._al = 0xc1059ed8;
|
|
this._bl = 0x367cd507;
|
|
this._cl = 0x3070dd17;
|
|
this._dl = 0xf70e5939;
|
|
this._el = 0xffc00b31;
|
|
this._fl = 0x68581511;
|
|
this._gl = 0x64f98fa7;
|
|
this._hl = 0xbefa4fa4;
|
|
|
|
return this
|
|
};
|
|
|
|
Sha384.prototype._hash = function () {
|
|
var H = Buffer$a.allocUnsafe(48);
|
|
|
|
function writeInt64BE (h, l, offset) {
|
|
H.writeInt32BE(h, offset);
|
|
H.writeInt32BE(l, offset + 4);
|
|
}
|
|
|
|
writeInt64BE(this._ah, this._al, 0);
|
|
writeInt64BE(this._bh, this._bl, 8);
|
|
writeInt64BE(this._ch, this._cl, 16);
|
|
writeInt64BE(this._dh, this._dl, 24);
|
|
writeInt64BE(this._eh, this._el, 32);
|
|
writeInt64BE(this._fh, this._fl, 40);
|
|
|
|
return H
|
|
};
|
|
|
|
var sha384 = Sha384;
|
|
|
|
var sha_js = createCommonjsModule(function (module) {
|
|
var exports = module.exports = function SHA (algorithm) {
|
|
algorithm = algorithm.toLowerCase();
|
|
|
|
var Algorithm = exports[algorithm];
|
|
if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)')
|
|
|
|
return new Algorithm()
|
|
};
|
|
|
|
exports.sha = sha;
|
|
exports.sha1 = sha1;
|
|
exports.sha224 = sha224;
|
|
exports.sha256 = sha256;
|
|
exports.sha384 = sha384;
|
|
exports.sha512 = sha512;
|
|
});
|
|
|
|
var Buffer$b = safeBuffer.Buffer;
|
|
var Transform$1 = stream.Transform;
|
|
var StringDecoder = string_decoder.StringDecoder;
|
|
|
|
|
|
function CipherBase (hashMode) {
|
|
Transform$1.call(this);
|
|
this.hashMode = typeof hashMode === 'string';
|
|
if (this.hashMode) {
|
|
this[hashMode] = this._finalOrDigest;
|
|
} else {
|
|
this.final = this._finalOrDigest;
|
|
}
|
|
if (this._final) {
|
|
this.__final = this._final;
|
|
this._final = null;
|
|
}
|
|
this._decoder = null;
|
|
this._encoding = null;
|
|
}
|
|
inherits_browser(CipherBase, Transform$1);
|
|
|
|
CipherBase.prototype.update = function (data, inputEnc, outputEnc) {
|
|
if (typeof data === 'string') {
|
|
data = Buffer$b.from(data, inputEnc);
|
|
}
|
|
|
|
var outData = this._update(data);
|
|
if (this.hashMode) return this
|
|
|
|
if (outputEnc) {
|
|
outData = this._toString(outData, outputEnc);
|
|
}
|
|
|
|
return outData
|
|
};
|
|
|
|
CipherBase.prototype.setAutoPadding = function () {};
|
|
CipherBase.prototype.getAuthTag = function () {
|
|
throw new Error('trying to get auth tag in unsupported state')
|
|
};
|
|
|
|
CipherBase.prototype.setAuthTag = function () {
|
|
throw new Error('trying to set auth tag in unsupported state')
|
|
};
|
|
|
|
CipherBase.prototype.setAAD = function () {
|
|
throw new Error('trying to set aad in unsupported state')
|
|
};
|
|
|
|
CipherBase.prototype._transform = function (data, _, next) {
|
|
var err;
|
|
try {
|
|
if (this.hashMode) {
|
|
this._update(data);
|
|
} else {
|
|
this.push(this._update(data));
|
|
}
|
|
} catch (e) {
|
|
err = e;
|
|
} finally {
|
|
next(err);
|
|
}
|
|
};
|
|
CipherBase.prototype._flush = function (done) {
|
|
var err;
|
|
try {
|
|
this.push(this.__final());
|
|
} catch (e) {
|
|
err = e;
|
|
}
|
|
|
|
done(err);
|
|
};
|
|
CipherBase.prototype._finalOrDigest = function (outputEnc) {
|
|
var outData = this.__final() || Buffer$b.alloc(0);
|
|
if (outputEnc) {
|
|
outData = this._toString(outData, outputEnc, true);
|
|
}
|
|
return outData
|
|
};
|
|
|
|
CipherBase.prototype._toString = function (value, enc, fin) {
|
|
if (!this._decoder) {
|
|
this._decoder = new StringDecoder(enc);
|
|
this._encoding = enc;
|
|
}
|
|
|
|
if (this._encoding !== enc) throw new Error('can\'t switch encodings')
|
|
|
|
var out = this._decoder.write(value);
|
|
if (fin) {
|
|
out += this._decoder.end();
|
|
}
|
|
|
|
return out
|
|
};
|
|
|
|
var cipherBase = CipherBase;
|
|
|
|
function Hash$1 (hash) {
|
|
cipherBase.call(this, 'digest');
|
|
|
|
this._hash = hash;
|
|
}
|
|
|
|
inherits_browser(Hash$1, cipherBase);
|
|
|
|
Hash$1.prototype._update = function (data) {
|
|
this._hash.update(data);
|
|
};
|
|
|
|
Hash$1.prototype._final = function () {
|
|
return this._hash.digest()
|
|
};
|
|
|
|
var browser$1 = function createHash (alg) {
|
|
alg = alg.toLowerCase();
|
|
if (alg === 'md5') return new md5_js()
|
|
if (alg === 'rmd160' || alg === 'ripemd160') return new ripemd160()
|
|
|
|
return new Hash$1(sha_js(alg))
|
|
};
|
|
|
|
var Buffer$c = safeBuffer.Buffer;
|
|
|
|
|
|
|
|
var ZEROS = Buffer$c.alloc(128);
|
|
var blocksize = 64;
|
|
|
|
function Hmac (alg, key) {
|
|
cipherBase.call(this, 'digest');
|
|
if (typeof key === 'string') {
|
|
key = Buffer$c.from(key);
|
|
}
|
|
|
|
this._alg = alg;
|
|
this._key = key;
|
|
|
|
if (key.length > blocksize) {
|
|
key = alg(key);
|
|
} else if (key.length < blocksize) {
|
|
key = Buffer$c.concat([key, ZEROS], blocksize);
|
|
}
|
|
|
|
var ipad = this._ipad = Buffer$c.allocUnsafe(blocksize);
|
|
var opad = this._opad = Buffer$c.allocUnsafe(blocksize);
|
|
|
|
for (var i = 0; i < blocksize; i++) {
|
|
ipad[i] = key[i] ^ 0x36;
|
|
opad[i] = key[i] ^ 0x5C;
|
|
}
|
|
|
|
this._hash = [ipad];
|
|
}
|
|
|
|
inherits_browser(Hmac, cipherBase);
|
|
|
|
Hmac.prototype._update = function (data) {
|
|
this._hash.push(data);
|
|
};
|
|
|
|
Hmac.prototype._final = function () {
|
|
var h = this._alg(Buffer$c.concat(this._hash));
|
|
return this._alg(Buffer$c.concat([this._opad, h]))
|
|
};
|
|
var legacy = Hmac;
|
|
|
|
var md5 = function (buffer) {
|
|
return new md5_js().update(buffer).digest()
|
|
};
|
|
|
|
var Buffer$d = safeBuffer.Buffer;
|
|
|
|
|
|
|
|
|
|
|
|
var ZEROS$1 = Buffer$d.alloc(128);
|
|
|
|
function Hmac$1 (alg, key) {
|
|
cipherBase.call(this, 'digest');
|
|
if (typeof key === 'string') {
|
|
key = Buffer$d.from(key);
|
|
}
|
|
|
|
var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64;
|
|
|
|
this._alg = alg;
|
|
this._key = key;
|
|
if (key.length > blocksize) {
|
|
var hash = alg === 'rmd160' ? new ripemd160() : sha_js(alg);
|
|
key = hash.update(key).digest();
|
|
} else if (key.length < blocksize) {
|
|
key = Buffer$d.concat([key, ZEROS$1], blocksize);
|
|
}
|
|
|
|
var ipad = this._ipad = Buffer$d.allocUnsafe(blocksize);
|
|
var opad = this._opad = Buffer$d.allocUnsafe(blocksize);
|
|
|
|
for (var i = 0; i < blocksize; i++) {
|
|
ipad[i] = key[i] ^ 0x36;
|
|
opad[i] = key[i] ^ 0x5C;
|
|
}
|
|
this._hash = alg === 'rmd160' ? new ripemd160() : sha_js(alg);
|
|
this._hash.update(ipad);
|
|
}
|
|
|
|
inherits_browser(Hmac$1, cipherBase);
|
|
|
|
Hmac$1.prototype._update = function (data) {
|
|
this._hash.update(data);
|
|
};
|
|
|
|
Hmac$1.prototype._final = function () {
|
|
var h = this._hash.digest();
|
|
var hash = this._alg === 'rmd160' ? new ripemd160() : sha_js(this._alg);
|
|
return hash.update(this._opad).update(h).digest()
|
|
};
|
|
|
|
var browser$2 = function createHmac (alg, key) {
|
|
alg = alg.toLowerCase();
|
|
if (alg === 'rmd160' || alg === 'ripemd160') {
|
|
return new Hmac$1('rmd160', key)
|
|
}
|
|
if (alg === 'md5') {
|
|
return new legacy(md5, key)
|
|
}
|
|
return new Hmac$1(alg, key)
|
|
};
|
|
|
|
var sha224WithRSAEncryption = {
|
|
sign: "rsa",
|
|
hash: "sha224",
|
|
id: "302d300d06096086480165030402040500041c"
|
|
};
|
|
var sha256WithRSAEncryption = {
|
|
sign: "rsa",
|
|
hash: "sha256",
|
|
id: "3031300d060960864801650304020105000420"
|
|
};
|
|
var sha384WithRSAEncryption = {
|
|
sign: "rsa",
|
|
hash: "sha384",
|
|
id: "3041300d060960864801650304020205000430"
|
|
};
|
|
var sha512WithRSAEncryption = {
|
|
sign: "rsa",
|
|
hash: "sha512",
|
|
id: "3051300d060960864801650304020305000440"
|
|
};
|
|
var sha256$1 = {
|
|
sign: "ecdsa",
|
|
hash: "sha256",
|
|
id: ""
|
|
};
|
|
var sha224$1 = {
|
|
sign: "ecdsa",
|
|
hash: "sha224",
|
|
id: ""
|
|
};
|
|
var sha384$1 = {
|
|
sign: "ecdsa",
|
|
hash: "sha384",
|
|
id: ""
|
|
};
|
|
var sha512$1 = {
|
|
sign: "ecdsa",
|
|
hash: "sha512",
|
|
id: ""
|
|
};
|
|
var DSA = {
|
|
sign: "dsa",
|
|
hash: "sha1",
|
|
id: ""
|
|
};
|
|
var ripemd160WithRSA = {
|
|
sign: "rsa",
|
|
hash: "rmd160",
|
|
id: "3021300906052b2403020105000414"
|
|
};
|
|
var md5WithRSAEncryption = {
|
|
sign: "rsa",
|
|
hash: "md5",
|
|
id: "3020300c06082a864886f70d020505000410"
|
|
};
|
|
var algorithms = {
|
|
sha224WithRSAEncryption: sha224WithRSAEncryption,
|
|
"RSA-SHA224": {
|
|
sign: "ecdsa/rsa",
|
|
hash: "sha224",
|
|
id: "302d300d06096086480165030402040500041c"
|
|
},
|
|
sha256WithRSAEncryption: sha256WithRSAEncryption,
|
|
"RSA-SHA256": {
|
|
sign: "ecdsa/rsa",
|
|
hash: "sha256",
|
|
id: "3031300d060960864801650304020105000420"
|
|
},
|
|
sha384WithRSAEncryption: sha384WithRSAEncryption,
|
|
"RSA-SHA384": {
|
|
sign: "ecdsa/rsa",
|
|
hash: "sha384",
|
|
id: "3041300d060960864801650304020205000430"
|
|
},
|
|
sha512WithRSAEncryption: sha512WithRSAEncryption,
|
|
"RSA-SHA512": {
|
|
sign: "ecdsa/rsa",
|
|
hash: "sha512",
|
|
id: "3051300d060960864801650304020305000440"
|
|
},
|
|
"RSA-SHA1": {
|
|
sign: "rsa",
|
|
hash: "sha1",
|
|
id: "3021300906052b0e03021a05000414"
|
|
},
|
|
"ecdsa-with-SHA1": {
|
|
sign: "ecdsa",
|
|
hash: "sha1",
|
|
id: ""
|
|
},
|
|
sha256: sha256$1,
|
|
sha224: sha224$1,
|
|
sha384: sha384$1,
|
|
sha512: sha512$1,
|
|
"DSA-SHA": {
|
|
sign: "dsa",
|
|
hash: "sha1",
|
|
id: ""
|
|
},
|
|
"DSA-SHA1": {
|
|
sign: "dsa",
|
|
hash: "sha1",
|
|
id: ""
|
|
},
|
|
DSA: DSA,
|
|
"DSA-WITH-SHA224": {
|
|
sign: "dsa",
|
|
hash: "sha224",
|
|
id: ""
|
|
},
|
|
"DSA-SHA224": {
|
|
sign: "dsa",
|
|
hash: "sha224",
|
|
id: ""
|
|
},
|
|
"DSA-WITH-SHA256": {
|
|
sign: "dsa",
|
|
hash: "sha256",
|
|
id: ""
|
|
},
|
|
"DSA-SHA256": {
|
|
sign: "dsa",
|
|
hash: "sha256",
|
|
id: ""
|
|
},
|
|
"DSA-WITH-SHA384": {
|
|
sign: "dsa",
|
|
hash: "sha384",
|
|
id: ""
|
|
},
|
|
"DSA-SHA384": {
|
|
sign: "dsa",
|
|
hash: "sha384",
|
|
id: ""
|
|
},
|
|
"DSA-WITH-SHA512": {
|
|
sign: "dsa",
|
|
hash: "sha512",
|
|
id: ""
|
|
},
|
|
"DSA-SHA512": {
|
|
sign: "dsa",
|
|
hash: "sha512",
|
|
id: ""
|
|
},
|
|
"DSA-RIPEMD160": {
|
|
sign: "dsa",
|
|
hash: "rmd160",
|
|
id: ""
|
|
},
|
|
ripemd160WithRSA: ripemd160WithRSA,
|
|
"RSA-RIPEMD160": {
|
|
sign: "rsa",
|
|
hash: "rmd160",
|
|
id: "3021300906052b2403020105000414"
|
|
},
|
|
md5WithRSAEncryption: md5WithRSAEncryption,
|
|
"RSA-MD5": {
|
|
sign: "rsa",
|
|
hash: "md5",
|
|
id: "3020300c06082a864886f70d020505000410"
|
|
}
|
|
};
|
|
|
|
var algorithms$1 = /*#__PURE__*/Object.freeze({
|
|
sha224WithRSAEncryption: sha224WithRSAEncryption,
|
|
sha256WithRSAEncryption: sha256WithRSAEncryption,
|
|
sha384WithRSAEncryption: sha384WithRSAEncryption,
|
|
sha512WithRSAEncryption: sha512WithRSAEncryption,
|
|
sha256: sha256$1,
|
|
sha224: sha224$1,
|
|
sha384: sha384$1,
|
|
sha512: sha512$1,
|
|
DSA: DSA,
|
|
ripemd160WithRSA: ripemd160WithRSA,
|
|
md5WithRSAEncryption: md5WithRSAEncryption,
|
|
'default': algorithms
|
|
});
|
|
|
|
var algorithms$2 = getCjsExportFromNamespace(algorithms$1);
|
|
|
|
var algos = algorithms$2;
|
|
|
|
var MAX_ALLOC = Math.pow(2, 30) - 1; // default in iojs
|
|
|
|
function checkBuffer (buf, name) {
|
|
if (typeof buf !== 'string' && !Buffer.isBuffer(buf)) {
|
|
throw new TypeError(name + ' must be a buffer or string')
|
|
}
|
|
}
|
|
|
|
var precondition = function (password, salt, iterations, keylen) {
|
|
checkBuffer(password, 'Password');
|
|
checkBuffer(salt, 'Salt');
|
|
|
|
if (typeof iterations !== 'number') {
|
|
throw new TypeError('Iterations not a number')
|
|
}
|
|
|
|
if (iterations < 0) {
|
|
throw new TypeError('Bad iterations')
|
|
}
|
|
|
|
if (typeof keylen !== 'number') {
|
|
throw new TypeError('Key length not a number')
|
|
}
|
|
|
|
if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) { /* eslint no-self-compare: 0 */
|
|
throw new TypeError('Bad key length')
|
|
}
|
|
};
|
|
|
|
var defaultEncoding;
|
|
/* istanbul ignore next */
|
|
if (process.browser) {
|
|
defaultEncoding = 'utf-8';
|
|
} else {
|
|
var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10);
|
|
|
|
defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary';
|
|
}
|
|
var defaultEncoding_1 = defaultEncoding;
|
|
|
|
var Buffer$e = safeBuffer.Buffer;
|
|
var ZEROS$2 = Buffer$e.alloc(128);
|
|
var sizes = {
|
|
md5: 16,
|
|
sha1: 20,
|
|
sha224: 28,
|
|
sha256: 32,
|
|
sha384: 48,
|
|
sha512: 64,
|
|
rmd160: 20,
|
|
ripemd160: 20
|
|
};
|
|
|
|
function Hmac$2 (alg, key, saltLen) {
|
|
var hash = getDigest(alg);
|
|
var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64;
|
|
|
|
if (key.length > blocksize) {
|
|
key = hash(key);
|
|
} else if (key.length < blocksize) {
|
|
key = Buffer$e.concat([key, ZEROS$2], blocksize);
|
|
}
|
|
|
|
var ipad = Buffer$e.allocUnsafe(blocksize + sizes[alg]);
|
|
var opad = Buffer$e.allocUnsafe(blocksize + sizes[alg]);
|
|
for (var i = 0; i < blocksize; i++) {
|
|
ipad[i] = key[i] ^ 0x36;
|
|
opad[i] = key[i] ^ 0x5C;
|
|
}
|
|
|
|
var ipad1 = Buffer$e.allocUnsafe(blocksize + saltLen + 4);
|
|
ipad.copy(ipad1, 0, 0, blocksize);
|
|
this.ipad1 = ipad1;
|
|
this.ipad2 = ipad;
|
|
this.opad = opad;
|
|
this.alg = alg;
|
|
this.blocksize = blocksize;
|
|
this.hash = hash;
|
|
this.size = sizes[alg];
|
|
}
|
|
|
|
Hmac$2.prototype.run = function (data, ipad) {
|
|
data.copy(ipad, this.blocksize);
|
|
var h = this.hash(ipad);
|
|
h.copy(this.opad, this.blocksize);
|
|
return this.hash(this.opad)
|
|
};
|
|
|
|
function getDigest (alg) {
|
|
function shaFunc (data) {
|
|
return sha_js(alg).update(data).digest()
|
|
}
|
|
function rmd160Func (data) {
|
|
return new ripemd160().update(data).digest()
|
|
}
|
|
|
|
if (alg === 'rmd160' || alg === 'ripemd160') return rmd160Func
|
|
if (alg === 'md5') return md5
|
|
return shaFunc
|
|
}
|
|
|
|
function pbkdf2 (password, salt, iterations, keylen, digest) {
|
|
precondition(password, salt, iterations, keylen);
|
|
|
|
if (!Buffer$e.isBuffer(password)) password = Buffer$e.from(password, defaultEncoding_1);
|
|
if (!Buffer$e.isBuffer(salt)) salt = Buffer$e.from(salt, defaultEncoding_1);
|
|
|
|
digest = digest || 'sha1';
|
|
|
|
var hmac = new Hmac$2(digest, password, salt.length);
|
|
|
|
var DK = Buffer$e.allocUnsafe(keylen);
|
|
var block1 = Buffer$e.allocUnsafe(salt.length + 4);
|
|
salt.copy(block1, 0, 0, salt.length);
|
|
|
|
var destPos = 0;
|
|
var hLen = sizes[digest];
|
|
var l = Math.ceil(keylen / hLen);
|
|
|
|
for (var i = 1; i <= l; i++) {
|
|
block1.writeUInt32BE(i, salt.length);
|
|
|
|
var T = hmac.run(block1, hmac.ipad1);
|
|
var U = T;
|
|
|
|
for (var j = 1; j < iterations; j++) {
|
|
U = hmac.run(U, hmac.ipad2);
|
|
for (var k = 0; k < hLen; k++) T[k] ^= U[k];
|
|
}
|
|
|
|
T.copy(DK, destPos);
|
|
destPos += hLen;
|
|
}
|
|
|
|
return DK
|
|
}
|
|
|
|
var syncBrowser = pbkdf2;
|
|
|
|
var Buffer$f = safeBuffer.Buffer;
|
|
|
|
var ZERO_BUF;
|
|
var subtle = commonjsGlobal.crypto && commonjsGlobal.crypto.subtle;
|
|
var toBrowser = {
|
|
'sha': 'SHA-1',
|
|
'sha-1': 'SHA-1',
|
|
'sha1': 'SHA-1',
|
|
'sha256': 'SHA-256',
|
|
'sha-256': 'SHA-256',
|
|
'sha384': 'SHA-384',
|
|
'sha-384': 'SHA-384',
|
|
'sha-512': 'SHA-512',
|
|
'sha512': 'SHA-512'
|
|
};
|
|
var checks = [];
|
|
function checkNative (algo) {
|
|
if (commonjsGlobal.process && !commonjsGlobal.process.browser) {
|
|
return Promise.resolve(false)
|
|
}
|
|
if (!subtle || !subtle.importKey || !subtle.deriveBits) {
|
|
return Promise.resolve(false)
|
|
}
|
|
if (checks[algo] !== undefined) {
|
|
return checks[algo]
|
|
}
|
|
ZERO_BUF = ZERO_BUF || Buffer$f.alloc(8);
|
|
var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)
|
|
.then(function () {
|
|
return true
|
|
}).catch(function () {
|
|
return false
|
|
});
|
|
checks[algo] = prom;
|
|
return prom
|
|
}
|
|
|
|
function browserPbkdf2 (password, salt, iterations, length, algo) {
|
|
return subtle.importKey(
|
|
'raw', password, {name: 'PBKDF2'}, false, ['deriveBits']
|
|
).then(function (key) {
|
|
return subtle.deriveBits({
|
|
name: 'PBKDF2',
|
|
salt: salt,
|
|
iterations: iterations,
|
|
hash: {
|
|
name: algo
|
|
}
|
|
}, key, length << 3)
|
|
}).then(function (res) {
|
|
return Buffer$f.from(res)
|
|
})
|
|
}
|
|
|
|
function resolvePromise (promise, callback) {
|
|
promise.then(function (out) {
|
|
process.nextTick(function () {
|
|
callback(null, out);
|
|
});
|
|
}, function (e) {
|
|
process.nextTick(function () {
|
|
callback(e);
|
|
});
|
|
});
|
|
}
|
|
var async = function (password, salt, iterations, keylen, digest, callback) {
|
|
if (typeof digest === 'function') {
|
|
callback = digest;
|
|
digest = undefined;
|
|
}
|
|
|
|
digest = digest || 'sha1';
|
|
var algo = toBrowser[digest.toLowerCase()];
|
|
|
|
if (!algo || typeof commonjsGlobal.Promise !== 'function') {
|
|
return process.nextTick(function () {
|
|
var out;
|
|
try {
|
|
out = syncBrowser(password, salt, iterations, keylen, digest);
|
|
} catch (e) {
|
|
return callback(e)
|
|
}
|
|
callback(null, out);
|
|
})
|
|
}
|
|
|
|
precondition(password, salt, iterations, keylen);
|
|
if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2')
|
|
if (!Buffer$f.isBuffer(password)) password = Buffer$f.from(password, defaultEncoding_1);
|
|
if (!Buffer$f.isBuffer(salt)) salt = Buffer$f.from(salt, defaultEncoding_1);
|
|
|
|
resolvePromise(checkNative(algo).then(function (resp) {
|
|
if (resp) return browserPbkdf2(password, salt, iterations, keylen, algo)
|
|
|
|
return syncBrowser(password, salt, iterations, keylen, digest)
|
|
}), callback);
|
|
};
|
|
|
|
var pbkdf2$1 = async;
|
|
var pbkdf2Sync = syncBrowser;
|
|
|
|
var browser$3 = {
|
|
pbkdf2: pbkdf2$1,
|
|
pbkdf2Sync: pbkdf2Sync
|
|
};
|
|
|
|
var readUInt32BE = function readUInt32BE(bytes, off) {
|
|
var res = (bytes[0 + off] << 24) |
|
|
(bytes[1 + off] << 16) |
|
|
(bytes[2 + off] << 8) |
|
|
bytes[3 + off];
|
|
return res >>> 0;
|
|
};
|
|
|
|
var writeUInt32BE = function writeUInt32BE(bytes, value, off) {
|
|
bytes[0 + off] = value >>> 24;
|
|
bytes[1 + off] = (value >>> 16) & 0xff;
|
|
bytes[2 + off] = (value >>> 8) & 0xff;
|
|
bytes[3 + off] = value & 0xff;
|
|
};
|
|
|
|
var ip = function ip(inL, inR, out, off) {
|
|
var outL = 0;
|
|
var outR = 0;
|
|
|
|
for (var i = 6; i >= 0; i -= 2) {
|
|
for (var j = 0; j <= 24; j += 8) {
|
|
outL <<= 1;
|
|
outL |= (inR >>> (j + i)) & 1;
|
|
}
|
|
for (var j = 0; j <= 24; j += 8) {
|
|
outL <<= 1;
|
|
outL |= (inL >>> (j + i)) & 1;
|
|
}
|
|
}
|
|
|
|
for (var i = 6; i >= 0; i -= 2) {
|
|
for (var j = 1; j <= 25; j += 8) {
|
|
outR <<= 1;
|
|
outR |= (inR >>> (j + i)) & 1;
|
|
}
|
|
for (var j = 1; j <= 25; j += 8) {
|
|
outR <<= 1;
|
|
outR |= (inL >>> (j + i)) & 1;
|
|
}
|
|
}
|
|
|
|
out[off + 0] = outL >>> 0;
|
|
out[off + 1] = outR >>> 0;
|
|
};
|
|
|
|
var rip = function rip(inL, inR, out, off) {
|
|
var outL = 0;
|
|
var outR = 0;
|
|
|
|
for (var i = 0; i < 4; i++) {
|
|
for (var j = 24; j >= 0; j -= 8) {
|
|
outL <<= 1;
|
|
outL |= (inR >>> (j + i)) & 1;
|
|
outL <<= 1;
|
|
outL |= (inL >>> (j + i)) & 1;
|
|
}
|
|
}
|
|
for (var i = 4; i < 8; i++) {
|
|
for (var j = 24; j >= 0; j -= 8) {
|
|
outR <<= 1;
|
|
outR |= (inR >>> (j + i)) & 1;
|
|
outR <<= 1;
|
|
outR |= (inL >>> (j + i)) & 1;
|
|
}
|
|
}
|
|
|
|
out[off + 0] = outL >>> 0;
|
|
out[off + 1] = outR >>> 0;
|
|
};
|
|
|
|
var pc1 = function pc1(inL, inR, out, off) {
|
|
var outL = 0;
|
|
var outR = 0;
|
|
|
|
// 7, 15, 23, 31, 39, 47, 55, 63
|
|
// 6, 14, 22, 30, 39, 47, 55, 63
|
|
// 5, 13, 21, 29, 39, 47, 55, 63
|
|
// 4, 12, 20, 28
|
|
for (var i = 7; i >= 5; i--) {
|
|
for (var j = 0; j <= 24; j += 8) {
|
|
outL <<= 1;
|
|
outL |= (inR >> (j + i)) & 1;
|
|
}
|
|
for (var j = 0; j <= 24; j += 8) {
|
|
outL <<= 1;
|
|
outL |= (inL >> (j + i)) & 1;
|
|
}
|
|
}
|
|
for (var j = 0; j <= 24; j += 8) {
|
|
outL <<= 1;
|
|
outL |= (inR >> (j + i)) & 1;
|
|
}
|
|
|
|
// 1, 9, 17, 25, 33, 41, 49, 57
|
|
// 2, 10, 18, 26, 34, 42, 50, 58
|
|
// 3, 11, 19, 27, 35, 43, 51, 59
|
|
// 36, 44, 52, 60
|
|
for (var i = 1; i <= 3; i++) {
|
|
for (var j = 0; j <= 24; j += 8) {
|
|
outR <<= 1;
|
|
outR |= (inR >> (j + i)) & 1;
|
|
}
|
|
for (var j = 0; j <= 24; j += 8) {
|
|
outR <<= 1;
|
|
outR |= (inL >> (j + i)) & 1;
|
|
}
|
|
}
|
|
for (var j = 0; j <= 24; j += 8) {
|
|
outR <<= 1;
|
|
outR |= (inL >> (j + i)) & 1;
|
|
}
|
|
|
|
out[off + 0] = outL >>> 0;
|
|
out[off + 1] = outR >>> 0;
|
|
};
|
|
|
|
var r28shl = function r28shl(num, shift) {
|
|
return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));
|
|
};
|
|
|
|
var pc2table = [
|
|
// inL => outL
|
|
14, 11, 17, 4, 27, 23, 25, 0,
|
|
13, 22, 7, 18, 5, 9, 16, 24,
|
|
2, 20, 12, 21, 1, 8, 15, 26,
|
|
|
|
// inR => outR
|
|
15, 4, 25, 19, 9, 1, 26, 16,
|
|
5, 11, 23, 8, 12, 7, 17, 0,
|
|
22, 3, 10, 14, 6, 20, 27, 24
|
|
];
|
|
|
|
var pc2 = function pc2(inL, inR, out, off) {
|
|
var outL = 0;
|
|
var outR = 0;
|
|
|
|
var len = pc2table.length >>> 1;
|
|
for (var i = 0; i < len; i++) {
|
|
outL <<= 1;
|
|
outL |= (inL >>> pc2table[i]) & 0x1;
|
|
}
|
|
for (var i = len; i < pc2table.length; i++) {
|
|
outR <<= 1;
|
|
outR |= (inR >>> pc2table[i]) & 0x1;
|
|
}
|
|
|
|
out[off + 0] = outL >>> 0;
|
|
out[off + 1] = outR >>> 0;
|
|
};
|
|
|
|
var expand = function expand(r, out, off) {
|
|
var outL = 0;
|
|
var outR = 0;
|
|
|
|
outL = ((r & 1) << 5) | (r >>> 27);
|
|
for (var i = 23; i >= 15; i -= 4) {
|
|
outL <<= 6;
|
|
outL |= (r >>> i) & 0x3f;
|
|
}
|
|
for (var i = 11; i >= 3; i -= 4) {
|
|
outR |= (r >>> i) & 0x3f;
|
|
outR <<= 6;
|
|
}
|
|
outR |= ((r & 0x1f) << 1) | (r >>> 31);
|
|
|
|
out[off + 0] = outL >>> 0;
|
|
out[off + 1] = outR >>> 0;
|
|
};
|
|
|
|
var sTable = [
|
|
14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,
|
|
3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,
|
|
4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,
|
|
15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,
|
|
|
|
15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,
|
|
9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,
|
|
0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,
|
|
5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,
|
|
|
|
10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,
|
|
1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,
|
|
13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,
|
|
11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,
|
|
|
|
7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,
|
|
1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,
|
|
10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,
|
|
15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,
|
|
|
|
2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,
|
|
8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,
|
|
4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,
|
|
15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,
|
|
|
|
12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,
|
|
0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,
|
|
9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,
|
|
7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,
|
|
|
|
4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,
|
|
3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,
|
|
1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,
|
|
10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,
|
|
|
|
13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,
|
|
10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,
|
|
7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,
|
|
0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11
|
|
];
|
|
|
|
var substitute = function substitute(inL, inR) {
|
|
var out = 0;
|
|
for (var i = 0; i < 4; i++) {
|
|
var b = (inL >>> (18 - i * 6)) & 0x3f;
|
|
var sb = sTable[i * 0x40 + b];
|
|
|
|
out <<= 4;
|
|
out |= sb;
|
|
}
|
|
for (var i = 0; i < 4; i++) {
|
|
var b = (inR >>> (18 - i * 6)) & 0x3f;
|
|
var sb = sTable[4 * 0x40 + i * 0x40 + b];
|
|
|
|
out <<= 4;
|
|
out |= sb;
|
|
}
|
|
return out >>> 0;
|
|
};
|
|
|
|
var permuteTable = [
|
|
16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,
|
|
30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7
|
|
];
|
|
|
|
var permute = function permute(num) {
|
|
var out = 0;
|
|
for (var i = 0; i < permuteTable.length; i++) {
|
|
out <<= 1;
|
|
out |= (num >>> permuteTable[i]) & 0x1;
|
|
}
|
|
return out >>> 0;
|
|
};
|
|
|
|
var padSplit = function padSplit(num, size, group) {
|
|
var str = num.toString(2);
|
|
while (str.length < size)
|
|
str = '0' + str;
|
|
|
|
var out = [];
|
|
for (var i = 0; i < size; i += group)
|
|
out.push(str.slice(i, i + group));
|
|
return out.join(' ');
|
|
};
|
|
|
|
var utils = {
|
|
readUInt32BE: readUInt32BE,
|
|
writeUInt32BE: writeUInt32BE,
|
|
ip: ip,
|
|
rip: rip,
|
|
pc1: pc1,
|
|
r28shl: r28shl,
|
|
pc2: pc2,
|
|
expand: expand,
|
|
substitute: substitute,
|
|
permute: permute,
|
|
padSplit: padSplit
|
|
};
|
|
|
|
var minimalisticAssert = assert;
|
|
|
|
function assert(val, msg) {
|
|
if (!val)
|
|
throw new Error(msg || 'Assertion failed');
|
|
}
|
|
|
|
assert.equal = function assertEqual(l, r, msg) {
|
|
if (l != r)
|
|
throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));
|
|
};
|
|
|
|
function Cipher(options) {
|
|
this.options = options;
|
|
|
|
this.type = this.options.type;
|
|
this.blockSize = 8;
|
|
this._init();
|
|
|
|
this.buffer = new Array(this.blockSize);
|
|
this.bufferOff = 0;
|
|
}
|
|
var cipher = Cipher;
|
|
|
|
Cipher.prototype._init = function _init() {
|
|
// Might be overrided
|
|
};
|
|
|
|
Cipher.prototype.update = function update(data) {
|
|
if (data.length === 0)
|
|
return [];
|
|
|
|
if (this.type === 'decrypt')
|
|
return this._updateDecrypt(data);
|
|
else
|
|
return this._updateEncrypt(data);
|
|
};
|
|
|
|
Cipher.prototype._buffer = function _buffer(data, off) {
|
|
// Append data to buffer
|
|
var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);
|
|
for (var i = 0; i < min; i++)
|
|
this.buffer[this.bufferOff + i] = data[off + i];
|
|
this.bufferOff += min;
|
|
|
|
// Shift next
|
|
return min;
|
|
};
|
|
|
|
Cipher.prototype._flushBuffer = function _flushBuffer(out, off) {
|
|
this._update(this.buffer, 0, out, off);
|
|
this.bufferOff = 0;
|
|
return this.blockSize;
|
|
};
|
|
|
|
Cipher.prototype._updateEncrypt = function _updateEncrypt(data) {
|
|
var inputOff = 0;
|
|
var outputOff = 0;
|
|
|
|
var count = ((this.bufferOff + data.length) / this.blockSize) | 0;
|
|
var out = new Array(count * this.blockSize);
|
|
|
|
if (this.bufferOff !== 0) {
|
|
inputOff += this._buffer(data, inputOff);
|
|
|
|
if (this.bufferOff === this.buffer.length)
|
|
outputOff += this._flushBuffer(out, outputOff);
|
|
}
|
|
|
|
// Write blocks
|
|
var max = data.length - ((data.length - inputOff) % this.blockSize);
|
|
for (; inputOff < max; inputOff += this.blockSize) {
|
|
this._update(data, inputOff, out, outputOff);
|
|
outputOff += this.blockSize;
|
|
}
|
|
|
|
// Queue rest
|
|
for (; inputOff < data.length; inputOff++, this.bufferOff++)
|
|
this.buffer[this.bufferOff] = data[inputOff];
|
|
|
|
return out;
|
|
};
|
|
|
|
Cipher.prototype._updateDecrypt = function _updateDecrypt(data) {
|
|
var inputOff = 0;
|
|
var outputOff = 0;
|
|
|
|
var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;
|
|
var out = new Array(count * this.blockSize);
|
|
|
|
// TODO(indutny): optimize it, this is far from optimal
|
|
for (; count > 0; count--) {
|
|
inputOff += this._buffer(data, inputOff);
|
|
outputOff += this._flushBuffer(out, outputOff);
|
|
}
|
|
|
|
// Buffer rest of the input
|
|
inputOff += this._buffer(data, inputOff);
|
|
|
|
return out;
|
|
};
|
|
|
|
Cipher.prototype.final = function final(buffer) {
|
|
var first;
|
|
if (buffer)
|
|
first = this.update(buffer);
|
|
|
|
var last;
|
|
if (this.type === 'encrypt')
|
|
last = this._finalEncrypt();
|
|
else
|
|
last = this._finalDecrypt();
|
|
|
|
if (first)
|
|
return first.concat(last);
|
|
else
|
|
return last;
|
|
};
|
|
|
|
Cipher.prototype._pad = function _pad(buffer, off) {
|
|
if (off === 0)
|
|
return false;
|
|
|
|
while (off < buffer.length)
|
|
buffer[off++] = 0;
|
|
|
|
return true;
|
|
};
|
|
|
|
Cipher.prototype._finalEncrypt = function _finalEncrypt() {
|
|
if (!this._pad(this.buffer, this.bufferOff))
|
|
return [];
|
|
|
|
var out = new Array(this.blockSize);
|
|
this._update(this.buffer, 0, out, 0);
|
|
return out;
|
|
};
|
|
|
|
Cipher.prototype._unpad = function _unpad(buffer) {
|
|
return buffer;
|
|
};
|
|
|
|
Cipher.prototype._finalDecrypt = function _finalDecrypt() {
|
|
minimalisticAssert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');
|
|
var out = new Array(this.blockSize);
|
|
this._flushBuffer(out, 0);
|
|
|
|
return this._unpad(out);
|
|
};
|
|
|
|
var utils$1 = des.utils;
|
|
var Cipher$1 = des.Cipher;
|
|
|
|
function DESState() {
|
|
this.tmp = new Array(2);
|
|
this.keys = null;
|
|
}
|
|
|
|
function DES(options) {
|
|
Cipher$1.call(this, options);
|
|
|
|
var state = new DESState();
|
|
this._desState = state;
|
|
|
|
this.deriveKeys(state, options.key);
|
|
}
|
|
inherits_browser(DES, Cipher$1);
|
|
var des_1 = DES;
|
|
|
|
DES.create = function create(options) {
|
|
return new DES(options);
|
|
};
|
|
|
|
var shiftTable = [
|
|
1, 1, 2, 2, 2, 2, 2, 2,
|
|
1, 2, 2, 2, 2, 2, 2, 1
|
|
];
|
|
|
|
DES.prototype.deriveKeys = function deriveKeys(state, key) {
|
|
state.keys = new Array(16 * 2);
|
|
|
|
minimalisticAssert.equal(key.length, this.blockSize, 'Invalid key length');
|
|
|
|
var kL = utils$1.readUInt32BE(key, 0);
|
|
var kR = utils$1.readUInt32BE(key, 4);
|
|
|
|
utils$1.pc1(kL, kR, state.tmp, 0);
|
|
kL = state.tmp[0];
|
|
kR = state.tmp[1];
|
|
for (var i = 0; i < state.keys.length; i += 2) {
|
|
var shift = shiftTable[i >>> 1];
|
|
kL = utils$1.r28shl(kL, shift);
|
|
kR = utils$1.r28shl(kR, shift);
|
|
utils$1.pc2(kL, kR, state.keys, i);
|
|
}
|
|
};
|
|
|
|
DES.prototype._update = function _update(inp, inOff, out, outOff) {
|
|
var state = this._desState;
|
|
|
|
var l = utils$1.readUInt32BE(inp, inOff);
|
|
var r = utils$1.readUInt32BE(inp, inOff + 4);
|
|
|
|
// Initial Permutation
|
|
utils$1.ip(l, r, state.tmp, 0);
|
|
l = state.tmp[0];
|
|
r = state.tmp[1];
|
|
|
|
if (this.type === 'encrypt')
|
|
this._encrypt(state, l, r, state.tmp, 0);
|
|
else
|
|
this._decrypt(state, l, r, state.tmp, 0);
|
|
|
|
l = state.tmp[0];
|
|
r = state.tmp[1];
|
|
|
|
utils$1.writeUInt32BE(out, l, outOff);
|
|
utils$1.writeUInt32BE(out, r, outOff + 4);
|
|
};
|
|
|
|
DES.prototype._pad = function _pad(buffer, off) {
|
|
var value = buffer.length - off;
|
|
for (var i = off; i < buffer.length; i++)
|
|
buffer[i] = value;
|
|
|
|
return true;
|
|
};
|
|
|
|
DES.prototype._unpad = function _unpad(buffer) {
|
|
var pad = buffer[buffer.length - 1];
|
|
for (var i = buffer.length - pad; i < buffer.length; i++)
|
|
minimalisticAssert.equal(buffer[i], pad);
|
|
|
|
return buffer.slice(0, buffer.length - pad);
|
|
};
|
|
|
|
DES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {
|
|
var l = lStart;
|
|
var r = rStart;
|
|
|
|
// Apply f() x16 times
|
|
for (var i = 0; i < state.keys.length; i += 2) {
|
|
var keyL = state.keys[i];
|
|
var keyR = state.keys[i + 1];
|
|
|
|
// f(r, k)
|
|
utils$1.expand(r, state.tmp, 0);
|
|
|
|
keyL ^= state.tmp[0];
|
|
keyR ^= state.tmp[1];
|
|
var s = utils$1.substitute(keyL, keyR);
|
|
var f = utils$1.permute(s);
|
|
|
|
var t = r;
|
|
r = (l ^ f) >>> 0;
|
|
l = t;
|
|
}
|
|
|
|
// Reverse Initial Permutation
|
|
utils$1.rip(r, l, out, off);
|
|
};
|
|
|
|
DES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {
|
|
var l = rStart;
|
|
var r = lStart;
|
|
|
|
// Apply f() x16 times
|
|
for (var i = state.keys.length - 2; i >= 0; i -= 2) {
|
|
var keyL = state.keys[i];
|
|
var keyR = state.keys[i + 1];
|
|
|
|
// f(r, k)
|
|
utils$1.expand(l, state.tmp, 0);
|
|
|
|
keyL ^= state.tmp[0];
|
|
keyR ^= state.tmp[1];
|
|
var s = utils$1.substitute(keyL, keyR);
|
|
var f = utils$1.permute(s);
|
|
|
|
var t = l;
|
|
l = (r ^ f) >>> 0;
|
|
r = t;
|
|
}
|
|
|
|
// Reverse Initial Permutation
|
|
utils$1.rip(l, r, out, off);
|
|
};
|
|
|
|
var proto = {};
|
|
|
|
function CBCState(iv) {
|
|
minimalisticAssert.equal(iv.length, 8, 'Invalid IV length');
|
|
|
|
this.iv = new Array(8);
|
|
for (var i = 0; i < this.iv.length; i++)
|
|
this.iv[i] = iv[i];
|
|
}
|
|
|
|
function instantiate(Base) {
|
|
function CBC(options) {
|
|
Base.call(this, options);
|
|
this._cbcInit();
|
|
}
|
|
inherits_browser(CBC, Base);
|
|
|
|
var keys = Object.keys(proto);
|
|
for (var i = 0; i < keys.length; i++) {
|
|
var key = keys[i];
|
|
CBC.prototype[key] = proto[key];
|
|
}
|
|
|
|
CBC.create = function create(options) {
|
|
return new CBC(options);
|
|
};
|
|
|
|
return CBC;
|
|
}
|
|
|
|
var instantiate_1 = instantiate;
|
|
|
|
proto._cbcInit = function _cbcInit() {
|
|
var state = new CBCState(this.options.iv);
|
|
this._cbcState = state;
|
|
};
|
|
|
|
proto._update = function _update(inp, inOff, out, outOff) {
|
|
var state = this._cbcState;
|
|
var superProto = this.constructor.super_.prototype;
|
|
|
|
var iv = state.iv;
|
|
if (this.type === 'encrypt') {
|
|
for (var i = 0; i < this.blockSize; i++)
|
|
iv[i] ^= inp[inOff + i];
|
|
|
|
superProto._update.call(this, iv, 0, out, outOff);
|
|
|
|
for (var i = 0; i < this.blockSize; i++)
|
|
iv[i] = out[outOff + i];
|
|
} else {
|
|
superProto._update.call(this, inp, inOff, out, outOff);
|
|
|
|
for (var i = 0; i < this.blockSize; i++)
|
|
out[outOff + i] ^= iv[i];
|
|
|
|
for (var i = 0; i < this.blockSize; i++)
|
|
iv[i] = inp[inOff + i];
|
|
}
|
|
};
|
|
|
|
var cbc = {
|
|
instantiate: instantiate_1
|
|
};
|
|
|
|
var Cipher$2 = des.Cipher;
|
|
var DES$1 = des.DES;
|
|
|
|
function EDEState(type, key) {
|
|
minimalisticAssert.equal(key.length, 24, 'Invalid key length');
|
|
|
|
var k1 = key.slice(0, 8);
|
|
var k2 = key.slice(8, 16);
|
|
var k3 = key.slice(16, 24);
|
|
|
|
if (type === 'encrypt') {
|
|
this.ciphers = [
|
|
DES$1.create({ type: 'encrypt', key: k1 }),
|
|
DES$1.create({ type: 'decrypt', key: k2 }),
|
|
DES$1.create({ type: 'encrypt', key: k3 })
|
|
];
|
|
} else {
|
|
this.ciphers = [
|
|
DES$1.create({ type: 'decrypt', key: k3 }),
|
|
DES$1.create({ type: 'encrypt', key: k2 }),
|
|
DES$1.create({ type: 'decrypt', key: k1 })
|
|
];
|
|
}
|
|
}
|
|
|
|
function EDE(options) {
|
|
Cipher$2.call(this, options);
|
|
|
|
var state = new EDEState(this.type, this.options.key);
|
|
this._edeState = state;
|
|
}
|
|
inherits_browser(EDE, Cipher$2);
|
|
|
|
var ede = EDE;
|
|
|
|
EDE.create = function create(options) {
|
|
return new EDE(options);
|
|
};
|
|
|
|
EDE.prototype._update = function _update(inp, inOff, out, outOff) {
|
|
var state = this._edeState;
|
|
|
|
state.ciphers[0]._update(inp, inOff, out, outOff);
|
|
state.ciphers[1]._update(out, outOff, out, outOff);
|
|
state.ciphers[2]._update(out, outOff, out, outOff);
|
|
};
|
|
|
|
EDE.prototype._pad = DES$1.prototype._pad;
|
|
EDE.prototype._unpad = DES$1.prototype._unpad;
|
|
|
|
var utils$2 = utils;
|
|
var Cipher$3 = cipher;
|
|
var DES$2 = des_1;
|
|
var CBC = cbc;
|
|
var EDE$1 = ede;
|
|
|
|
var des = {
|
|
utils: utils$2,
|
|
Cipher: Cipher$3,
|
|
DES: DES$2,
|
|
CBC: CBC,
|
|
EDE: EDE$1
|
|
};
|
|
|
|
var Buffer$g = safeBuffer.Buffer;
|
|
|
|
var modes = {
|
|
'des-ede3-cbc': des.CBC.instantiate(des.EDE),
|
|
'des-ede3': des.EDE,
|
|
'des-ede-cbc': des.CBC.instantiate(des.EDE),
|
|
'des-ede': des.EDE,
|
|
'des-cbc': des.CBC.instantiate(des.DES),
|
|
'des-ecb': des.DES
|
|
};
|
|
modes.des = modes['des-cbc'];
|
|
modes.des3 = modes['des-ede3-cbc'];
|
|
var browserifyDes = DES$3;
|
|
inherits_browser(DES$3, cipherBase);
|
|
function DES$3 (opts) {
|
|
cipherBase.call(this);
|
|
var modeName = opts.mode.toLowerCase();
|
|
var mode = modes[modeName];
|
|
var type;
|
|
if (opts.decrypt) {
|
|
type = 'decrypt';
|
|
} else {
|
|
type = 'encrypt';
|
|
}
|
|
var key = opts.key;
|
|
if (!Buffer$g.isBuffer(key)) {
|
|
key = Buffer$g.from(key);
|
|
}
|
|
if (modeName === 'des-ede' || modeName === 'des-ede-cbc') {
|
|
key = Buffer$g.concat([key, key.slice(0, 8)]);
|
|
}
|
|
var iv = opts.iv;
|
|
if (!Buffer$g.isBuffer(iv)) {
|
|
iv = Buffer$g.from(iv);
|
|
}
|
|
this._des = mode.create({
|
|
key: key,
|
|
iv: iv,
|
|
type: type
|
|
});
|
|
}
|
|
DES$3.prototype._update = function (data) {
|
|
return Buffer$g.from(this._des.update(data))
|
|
};
|
|
DES$3.prototype._final = function () {
|
|
return Buffer$g.from(this._des.final())
|
|
};
|
|
|
|
var encrypt = function (self, block) {
|
|
return self._cipher.encryptBlock(block)
|
|
};
|
|
|
|
var decrypt = function (self, block) {
|
|
return self._cipher.decryptBlock(block)
|
|
};
|
|
|
|
var ecb = {
|
|
encrypt: encrypt,
|
|
decrypt: decrypt
|
|
};
|
|
|
|
var bufferXor = function xor (a, b) {
|
|
var length = Math.min(a.length, b.length);
|
|
var buffer = new Buffer(length);
|
|
|
|
for (var i = 0; i < length; ++i) {
|
|
buffer[i] = a[i] ^ b[i];
|
|
}
|
|
|
|
return buffer
|
|
};
|
|
|
|
var encrypt$1 = function (self, block) {
|
|
var data = bufferXor(block, self._prev);
|
|
|
|
self._prev = self._cipher.encryptBlock(data);
|
|
return self._prev
|
|
};
|
|
|
|
var decrypt$1 = function (self, block) {
|
|
var pad = self._prev;
|
|
|
|
self._prev = block;
|
|
var out = self._cipher.decryptBlock(block);
|
|
|
|
return bufferXor(out, pad)
|
|
};
|
|
|
|
var cbc$1 = {
|
|
encrypt: encrypt$1,
|
|
decrypt: decrypt$1
|
|
};
|
|
|
|
var Buffer$h = safeBuffer.Buffer;
|
|
|
|
|
|
function encryptStart (self, data, decrypt) {
|
|
var len = data.length;
|
|
var out = bufferXor(data, self._cache);
|
|
self._cache = self._cache.slice(len);
|
|
self._prev = Buffer$h.concat([self._prev, decrypt ? data : out]);
|
|
return out
|
|
}
|
|
|
|
var encrypt$2 = function (self, data, decrypt) {
|
|
var out = Buffer$h.allocUnsafe(0);
|
|
var len;
|
|
|
|
while (data.length) {
|
|
if (self._cache.length === 0) {
|
|
self._cache = self._cipher.encryptBlock(self._prev);
|
|
self._prev = Buffer$h.allocUnsafe(0);
|
|
}
|
|
|
|
if (self._cache.length <= data.length) {
|
|
len = self._cache.length;
|
|
out = Buffer$h.concat([out, encryptStart(self, data.slice(0, len), decrypt)]);
|
|
data = data.slice(len);
|
|
} else {
|
|
out = Buffer$h.concat([out, encryptStart(self, data, decrypt)]);
|
|
break
|
|
}
|
|
}
|
|
|
|
return out
|
|
};
|
|
|
|
var cfb = {
|
|
encrypt: encrypt$2
|
|
};
|
|
|
|
var Buffer$i = safeBuffer.Buffer;
|
|
|
|
function encryptByte (self, byteParam, decrypt) {
|
|
var pad = self._cipher.encryptBlock(self._prev);
|
|
var out = pad[0] ^ byteParam;
|
|
|
|
self._prev = Buffer$i.concat([
|
|
self._prev.slice(1),
|
|
Buffer$i.from([decrypt ? byteParam : out])
|
|
]);
|
|
|
|
return out
|
|
}
|
|
|
|
var encrypt$3 = function (self, chunk, decrypt) {
|
|
var len = chunk.length;
|
|
var out = Buffer$i.allocUnsafe(len);
|
|
var i = -1;
|
|
|
|
while (++i < len) {
|
|
out[i] = encryptByte(self, chunk[i], decrypt);
|
|
}
|
|
|
|
return out
|
|
};
|
|
|
|
var cfb8 = {
|
|
encrypt: encrypt$3
|
|
};
|
|
|
|
var Buffer$j = safeBuffer.Buffer;
|
|
|
|
function encryptByte$1 (self, byteParam, decrypt) {
|
|
var pad;
|
|
var i = -1;
|
|
var len = 8;
|
|
var out = 0;
|
|
var bit, value;
|
|
while (++i < len) {
|
|
pad = self._cipher.encryptBlock(self._prev);
|
|
bit = (byteParam & (1 << (7 - i))) ? 0x80 : 0;
|
|
value = pad[0] ^ bit;
|
|
out += ((value & 0x80) >> (i % 8));
|
|
self._prev = shiftIn(self._prev, decrypt ? bit : value);
|
|
}
|
|
return out
|
|
}
|
|
|
|
function shiftIn (buffer, value) {
|
|
var len = buffer.length;
|
|
var i = -1;
|
|
var out = Buffer$j.allocUnsafe(buffer.length);
|
|
buffer = Buffer$j.concat([buffer, Buffer$j.from([value])]);
|
|
|
|
while (++i < len) {
|
|
out[i] = buffer[i] << 1 | buffer[i + 1] >> (7);
|
|
}
|
|
|
|
return out
|
|
}
|
|
|
|
var encrypt$4 = function (self, chunk, decrypt) {
|
|
var len = chunk.length;
|
|
var out = Buffer$j.allocUnsafe(len);
|
|
var i = -1;
|
|
|
|
while (++i < len) {
|
|
out[i] = encryptByte$1(self, chunk[i], decrypt);
|
|
}
|
|
|
|
return out
|
|
};
|
|
|
|
var cfb1 = {
|
|
encrypt: encrypt$4
|
|
};
|
|
|
|
function getBlock (self) {
|
|
self._prev = self._cipher.encryptBlock(self._prev);
|
|
return self._prev
|
|
}
|
|
|
|
var encrypt$5 = function (self, chunk) {
|
|
while (self._cache.length < chunk.length) {
|
|
self._cache = Buffer.concat([self._cache, getBlock(self)]);
|
|
}
|
|
|
|
var pad = self._cache.slice(0, chunk.length);
|
|
self._cache = self._cache.slice(chunk.length);
|
|
return bufferXor(chunk, pad)
|
|
};
|
|
|
|
var ofb = {
|
|
encrypt: encrypt$5
|
|
};
|
|
|
|
function incr32 (iv) {
|
|
var len = iv.length;
|
|
var item;
|
|
while (len--) {
|
|
item = iv.readUInt8(len);
|
|
if (item === 255) {
|
|
iv.writeUInt8(0, len);
|
|
} else {
|
|
item++;
|
|
iv.writeUInt8(item, len);
|
|
break
|
|
}
|
|
}
|
|
}
|
|
var incr32_1 = incr32;
|
|
|
|
var Buffer$k = safeBuffer.Buffer;
|
|
|
|
|
|
function getBlock$1 (self) {
|
|
var out = self._cipher.encryptBlockRaw(self._prev);
|
|
incr32_1(self._prev);
|
|
return out
|
|
}
|
|
|
|
var blockSize = 16;
|
|
var encrypt$6 = function (self, chunk) {
|
|
var chunkNum = Math.ceil(chunk.length / blockSize);
|
|
var start = self._cache.length;
|
|
self._cache = Buffer$k.concat([
|
|
self._cache,
|
|
Buffer$k.allocUnsafe(chunkNum * blockSize)
|
|
]);
|
|
for (var i = 0; i < chunkNum; i++) {
|
|
var out = getBlock$1(self);
|
|
var offset = start + i * blockSize;
|
|
self._cache.writeUInt32BE(out[0], offset + 0);
|
|
self._cache.writeUInt32BE(out[1], offset + 4);
|
|
self._cache.writeUInt32BE(out[2], offset + 8);
|
|
self._cache.writeUInt32BE(out[3], offset + 12);
|
|
}
|
|
var pad = self._cache.slice(0, chunk.length);
|
|
self._cache = self._cache.slice(chunk.length);
|
|
return bufferXor(chunk, pad)
|
|
};
|
|
|
|
var ctr = {
|
|
encrypt: encrypt$6
|
|
};
|
|
|
|
var aes128 = {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 16,
|
|
mode: "CBC",
|
|
type: "block"
|
|
};
|
|
var aes192 = {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 16,
|
|
mode: "CBC",
|
|
type: "block"
|
|
};
|
|
var aes256 = {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 16,
|
|
mode: "CBC",
|
|
type: "block"
|
|
};
|
|
var list = {
|
|
"aes-128-ecb": {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 0,
|
|
mode: "ECB",
|
|
type: "block"
|
|
},
|
|
"aes-192-ecb": {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 0,
|
|
mode: "ECB",
|
|
type: "block"
|
|
},
|
|
"aes-256-ecb": {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 0,
|
|
mode: "ECB",
|
|
type: "block"
|
|
},
|
|
"aes-128-cbc": {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 16,
|
|
mode: "CBC",
|
|
type: "block"
|
|
},
|
|
"aes-192-cbc": {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 16,
|
|
mode: "CBC",
|
|
type: "block"
|
|
},
|
|
"aes-256-cbc": {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 16,
|
|
mode: "CBC",
|
|
type: "block"
|
|
},
|
|
aes128: aes128,
|
|
aes192: aes192,
|
|
aes256: aes256,
|
|
"aes-128-cfb": {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 16,
|
|
mode: "CFB",
|
|
type: "stream"
|
|
},
|
|
"aes-192-cfb": {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 16,
|
|
mode: "CFB",
|
|
type: "stream"
|
|
},
|
|
"aes-256-cfb": {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 16,
|
|
mode: "CFB",
|
|
type: "stream"
|
|
},
|
|
"aes-128-cfb8": {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 16,
|
|
mode: "CFB8",
|
|
type: "stream"
|
|
},
|
|
"aes-192-cfb8": {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 16,
|
|
mode: "CFB8",
|
|
type: "stream"
|
|
},
|
|
"aes-256-cfb8": {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 16,
|
|
mode: "CFB8",
|
|
type: "stream"
|
|
},
|
|
"aes-128-cfb1": {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 16,
|
|
mode: "CFB1",
|
|
type: "stream"
|
|
},
|
|
"aes-192-cfb1": {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 16,
|
|
mode: "CFB1",
|
|
type: "stream"
|
|
},
|
|
"aes-256-cfb1": {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 16,
|
|
mode: "CFB1",
|
|
type: "stream"
|
|
},
|
|
"aes-128-ofb": {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 16,
|
|
mode: "OFB",
|
|
type: "stream"
|
|
},
|
|
"aes-192-ofb": {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 16,
|
|
mode: "OFB",
|
|
type: "stream"
|
|
},
|
|
"aes-256-ofb": {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 16,
|
|
mode: "OFB",
|
|
type: "stream"
|
|
},
|
|
"aes-128-ctr": {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 16,
|
|
mode: "CTR",
|
|
type: "stream"
|
|
},
|
|
"aes-192-ctr": {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 16,
|
|
mode: "CTR",
|
|
type: "stream"
|
|
},
|
|
"aes-256-ctr": {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 16,
|
|
mode: "CTR",
|
|
type: "stream"
|
|
},
|
|
"aes-128-gcm": {
|
|
cipher: "AES",
|
|
key: 128,
|
|
iv: 12,
|
|
mode: "GCM",
|
|
type: "auth"
|
|
},
|
|
"aes-192-gcm": {
|
|
cipher: "AES",
|
|
key: 192,
|
|
iv: 12,
|
|
mode: "GCM",
|
|
type: "auth"
|
|
},
|
|
"aes-256-gcm": {
|
|
cipher: "AES",
|
|
key: 256,
|
|
iv: 12,
|
|
mode: "GCM",
|
|
type: "auth"
|
|
}
|
|
};
|
|
|
|
var list$1 = /*#__PURE__*/Object.freeze({
|
|
aes128: aes128,
|
|
aes192: aes192,
|
|
aes256: aes256,
|
|
'default': list
|
|
});
|
|
|
|
var modes$1 = getCjsExportFromNamespace(list$1);
|
|
|
|
var modeModules = {
|
|
ECB: ecb,
|
|
CBC: cbc$1,
|
|
CFB: cfb,
|
|
CFB8: cfb8,
|
|
CFB1: cfb1,
|
|
OFB: ofb,
|
|
CTR: ctr,
|
|
GCM: ctr
|
|
};
|
|
|
|
|
|
|
|
for (var key in modes$1) {
|
|
modes$1[key].module = modeModules[modes$1[key].mode];
|
|
}
|
|
|
|
var modes_1 = modes$1;
|
|
|
|
// based on the aes implimentation in triple sec
|
|
// https://github.com/keybase/triplesec
|
|
// which is in turn based on the one from crypto-js
|
|
// https://code.google.com/p/crypto-js/
|
|
|
|
var Buffer$l = safeBuffer.Buffer;
|
|
|
|
function asUInt32Array (buf) {
|
|
if (!Buffer$l.isBuffer(buf)) buf = Buffer$l.from(buf);
|
|
|
|
var len = (buf.length / 4) | 0;
|
|
var out = new Array(len);
|
|
|
|
for (var i = 0; i < len; i++) {
|
|
out[i] = buf.readUInt32BE(i * 4);
|
|
}
|
|
|
|
return out
|
|
}
|
|
|
|
function scrubVec (v) {
|
|
for (var i = 0; i < v.length; v++) {
|
|
v[i] = 0;
|
|
}
|
|
}
|
|
|
|
function cryptBlock (M, keySchedule, SUB_MIX, SBOX, nRounds) {
|
|
var SUB_MIX0 = SUB_MIX[0];
|
|
var SUB_MIX1 = SUB_MIX[1];
|
|
var SUB_MIX2 = SUB_MIX[2];
|
|
var SUB_MIX3 = SUB_MIX[3];
|
|
|
|
var s0 = M[0] ^ keySchedule[0];
|
|
var s1 = M[1] ^ keySchedule[1];
|
|
var s2 = M[2] ^ keySchedule[2];
|
|
var s3 = M[3] ^ keySchedule[3];
|
|
var t0, t1, t2, t3;
|
|
var ksRow = 4;
|
|
|
|
for (var round = 1; round < nRounds; round++) {
|
|
t0 = SUB_MIX0[s0 >>> 24] ^ SUB_MIX1[(s1 >>> 16) & 0xff] ^ SUB_MIX2[(s2 >>> 8) & 0xff] ^ SUB_MIX3[s3 & 0xff] ^ keySchedule[ksRow++];
|
|
t1 = SUB_MIX0[s1 >>> 24] ^ SUB_MIX1[(s2 >>> 16) & 0xff] ^ SUB_MIX2[(s3 >>> 8) & 0xff] ^ SUB_MIX3[s0 & 0xff] ^ keySchedule[ksRow++];
|
|
t2 = SUB_MIX0[s2 >>> 24] ^ SUB_MIX1[(s3 >>> 16) & 0xff] ^ SUB_MIX2[(s0 >>> 8) & 0xff] ^ SUB_MIX3[s1 & 0xff] ^ keySchedule[ksRow++];
|
|
t3 = SUB_MIX0[s3 >>> 24] ^ SUB_MIX1[(s0 >>> 16) & 0xff] ^ SUB_MIX2[(s1 >>> 8) & 0xff] ^ SUB_MIX3[s2 & 0xff] ^ keySchedule[ksRow++];
|
|
s0 = t0;
|
|
s1 = t1;
|
|
s2 = t2;
|
|
s3 = t3;
|
|
}
|
|
|
|
t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++];
|
|
t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++];
|
|
t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++];
|
|
t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++];
|
|
t0 = t0 >>> 0;
|
|
t1 = t1 >>> 0;
|
|
t2 = t2 >>> 0;
|
|
t3 = t3 >>> 0;
|
|
|
|
return [t0, t1, t2, t3]
|
|
}
|
|
|
|
// AES constants
|
|
var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
|
|
var G = (function () {
|
|
// Compute double table
|
|
var d = new Array(256);
|
|
for (var j = 0; j < 256; j++) {
|
|
if (j < 128) {
|
|
d[j] = j << 1;
|
|
} else {
|
|
d[j] = (j << 1) ^ 0x11b;
|
|
}
|
|
}
|
|
|
|
var SBOX = [];
|
|
var INV_SBOX = [];
|
|
var SUB_MIX = [[], [], [], []];
|
|
var INV_SUB_MIX = [[], [], [], []];
|
|
|
|
// Walk GF(2^8)
|
|
var x = 0;
|
|
var xi = 0;
|
|
for (var i = 0; i < 256; ++i) {
|
|
// Compute sbox
|
|
var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);
|
|
sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63;
|
|
SBOX[x] = sx;
|
|
INV_SBOX[sx] = x;
|
|
|
|
// Compute multiplication
|
|
var x2 = d[x];
|
|
var x4 = d[x2];
|
|
var x8 = d[x4];
|
|
|
|
// Compute sub bytes, mix columns tables
|
|
var t = (d[sx] * 0x101) ^ (sx * 0x1010100);
|
|
SUB_MIX[0][x] = (t << 24) | (t >>> 8);
|
|
SUB_MIX[1][x] = (t << 16) | (t >>> 16);
|
|
SUB_MIX[2][x] = (t << 8) | (t >>> 24);
|
|
SUB_MIX[3][x] = t;
|
|
|
|
// Compute inv sub bytes, inv mix columns tables
|
|
t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100);
|
|
INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8);
|
|
INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16);
|
|
INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24);
|
|
INV_SUB_MIX[3][sx] = t;
|
|
|
|
if (x === 0) {
|
|
x = xi = 1;
|
|
} else {
|
|
x = x2 ^ d[d[d[x8 ^ x2]]];
|
|
xi ^= d[d[xi]];
|
|
}
|
|
}
|
|
|
|
return {
|
|
SBOX: SBOX,
|
|
INV_SBOX: INV_SBOX,
|
|
SUB_MIX: SUB_MIX,
|
|
INV_SUB_MIX: INV_SUB_MIX
|
|
}
|
|
})();
|
|
|
|
function AES (key) {
|
|
this._key = asUInt32Array(key);
|
|
this._reset();
|
|
}
|
|
|
|
AES.blockSize = 4 * 4;
|
|
AES.keySize = 256 / 8;
|
|
AES.prototype.blockSize = AES.blockSize;
|
|
AES.prototype.keySize = AES.keySize;
|
|
AES.prototype._reset = function () {
|
|
var keyWords = this._key;
|
|
var keySize = keyWords.length;
|
|
var nRounds = keySize + 6;
|
|
var ksRows = (nRounds + 1) * 4;
|
|
|
|
var keySchedule = [];
|
|
for (var k = 0; k < keySize; k++) {
|
|
keySchedule[k] = keyWords[k];
|
|
}
|
|
|
|
for (k = keySize; k < ksRows; k++) {
|
|
var t = keySchedule[k - 1];
|
|
|
|
if (k % keySize === 0) {
|
|
t = (t << 8) | (t >>> 24);
|
|
t =
|
|
(G.SBOX[t >>> 24] << 24) |
|
|
(G.SBOX[(t >>> 16) & 0xff] << 16) |
|
|
(G.SBOX[(t >>> 8) & 0xff] << 8) |
|
|
(G.SBOX[t & 0xff]);
|
|
|
|
t ^= RCON[(k / keySize) | 0] << 24;
|
|
} else if (keySize > 6 && k % keySize === 4) {
|
|
t =
|
|
(G.SBOX[t >>> 24] << 24) |
|
|
(G.SBOX[(t >>> 16) & 0xff] << 16) |
|
|
(G.SBOX[(t >>> 8) & 0xff] << 8) |
|
|
(G.SBOX[t & 0xff]);
|
|
}
|
|
|
|
keySchedule[k] = keySchedule[k - keySize] ^ t;
|
|
}
|
|
|
|
var invKeySchedule = [];
|
|
for (var ik = 0; ik < ksRows; ik++) {
|
|
var ksR = ksRows - ik;
|
|
var tt = keySchedule[ksR - (ik % 4 ? 0 : 4)];
|
|
|
|
if (ik < 4 || ksR <= 4) {
|
|
invKeySchedule[ik] = tt;
|
|
} else {
|
|
invKeySchedule[ik] =
|
|
G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^
|
|
G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 0xff]] ^
|
|
G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 0xff]] ^
|
|
G.INV_SUB_MIX[3][G.SBOX[tt & 0xff]];
|
|
}
|
|
}
|
|
|
|
this._nRounds = nRounds;
|
|
this._keySchedule = keySchedule;
|
|
this._invKeySchedule = invKeySchedule;
|
|
};
|
|
|
|
AES.prototype.encryptBlockRaw = function (M) {
|
|
M = asUInt32Array(M);
|
|
return cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds)
|
|
};
|
|
|
|
AES.prototype.encryptBlock = function (M) {
|
|
var out = this.encryptBlockRaw(M);
|
|
var buf = Buffer$l.allocUnsafe(16);
|
|
buf.writeUInt32BE(out[0], 0);
|
|
buf.writeUInt32BE(out[1], 4);
|
|
buf.writeUInt32BE(out[2], 8);
|
|
buf.writeUInt32BE(out[3], 12);
|
|
return buf
|
|
};
|
|
|
|
AES.prototype.decryptBlock = function (M) {
|
|
M = asUInt32Array(M);
|
|
|
|
// swap
|
|
var m1 = M[1];
|
|
M[1] = M[3];
|
|
M[3] = m1;
|
|
|
|
var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds);
|
|
var buf = Buffer$l.allocUnsafe(16);
|
|
buf.writeUInt32BE(out[0], 0);
|
|
buf.writeUInt32BE(out[3], 4);
|
|
buf.writeUInt32BE(out[2], 8);
|
|
buf.writeUInt32BE(out[1], 12);
|
|
return buf
|
|
};
|
|
|
|
AES.prototype.scrub = function () {
|
|
scrubVec(this._keySchedule);
|
|
scrubVec(this._invKeySchedule);
|
|
scrubVec(this._key);
|
|
};
|
|
|
|
var AES_1 = AES;
|
|
|
|
var aes = {
|
|
AES: AES_1
|
|
};
|
|
|
|
var Buffer$m = safeBuffer.Buffer;
|
|
var ZEROES = Buffer$m.alloc(16, 0);
|
|
|
|
function toArray (buf) {
|
|
return [
|
|
buf.readUInt32BE(0),
|
|
buf.readUInt32BE(4),
|
|
buf.readUInt32BE(8),
|
|
buf.readUInt32BE(12)
|
|
]
|
|
}
|
|
|
|
function fromArray (out) {
|
|
var buf = Buffer$m.allocUnsafe(16);
|
|
buf.writeUInt32BE(out[0] >>> 0, 0);
|
|
buf.writeUInt32BE(out[1] >>> 0, 4);
|
|
buf.writeUInt32BE(out[2] >>> 0, 8);
|
|
buf.writeUInt32BE(out[3] >>> 0, 12);
|
|
return buf
|
|
}
|
|
|
|
function GHASH (key) {
|
|
this.h = key;
|
|
this.state = Buffer$m.alloc(16, 0);
|
|
this.cache = Buffer$m.allocUnsafe(0);
|
|
}
|
|
|
|
// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html
|
|
// by Juho Vähä-Herttua
|
|
GHASH.prototype.ghash = function (block) {
|
|
var i = -1;
|
|
while (++i < block.length) {
|
|
this.state[i] ^= block[i];
|
|
}
|
|
this._multiply();
|
|
};
|
|
|
|
GHASH.prototype._multiply = function () {
|
|
var Vi = toArray(this.h);
|
|
var Zi = [0, 0, 0, 0];
|
|
var j, xi, lsbVi;
|
|
var i = -1;
|
|
while (++i < 128) {
|
|
xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0;
|
|
if (xi) {
|
|
// Z_i+1 = Z_i ^ V_i
|
|
Zi[0] ^= Vi[0];
|
|
Zi[1] ^= Vi[1];
|
|
Zi[2] ^= Vi[2];
|
|
Zi[3] ^= Vi[3];
|
|
}
|
|
|
|
// Store the value of LSB(V_i)
|
|
lsbVi = (Vi[3] & 1) !== 0;
|
|
|
|
// V_i+1 = V_i >> 1
|
|
for (j = 3; j > 0; j--) {
|
|
Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31);
|
|
}
|
|
Vi[0] = Vi[0] >>> 1;
|
|
|
|
// If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R
|
|
if (lsbVi) {
|
|
Vi[0] = Vi[0] ^ (0xe1 << 24);
|
|
}
|
|
}
|
|
this.state = fromArray(Zi);
|
|
};
|
|
|
|
GHASH.prototype.update = function (buf) {
|
|
this.cache = Buffer$m.concat([this.cache, buf]);
|
|
var chunk;
|
|
while (this.cache.length >= 16) {
|
|
chunk = this.cache.slice(0, 16);
|
|
this.cache = this.cache.slice(16);
|
|
this.ghash(chunk);
|
|
}
|
|
};
|
|
|
|
GHASH.prototype.final = function (abl, bl) {
|
|
if (this.cache.length) {
|
|
this.ghash(Buffer$m.concat([this.cache, ZEROES], 16));
|
|
}
|
|
|
|
this.ghash(fromArray([0, abl, 0, bl]));
|
|
return this.state
|
|
};
|
|
|
|
var ghash = GHASH;
|
|
|
|
var Buffer$n = safeBuffer.Buffer;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
function xorTest (a, b) {
|
|
var out = 0;
|
|
if (a.length !== b.length) out++;
|
|
|
|
var len = Math.min(a.length, b.length);
|
|
for (var i = 0; i < len; ++i) {
|
|
out += (a[i] ^ b[i]);
|
|
}
|
|
|
|
return out
|
|
}
|
|
|
|
function calcIv (self, iv, ck) {
|
|
if (iv.length === 12) {
|
|
self._finID = Buffer$n.concat([iv, Buffer$n.from([0, 0, 0, 1])]);
|
|
return Buffer$n.concat([iv, Buffer$n.from([0, 0, 0, 2])])
|
|
}
|
|
var ghash$1 = new ghash(ck);
|
|
var len = iv.length;
|
|
var toPad = len % 16;
|
|
ghash$1.update(iv);
|
|
if (toPad) {
|
|
toPad = 16 - toPad;
|
|
ghash$1.update(Buffer$n.alloc(toPad, 0));
|
|
}
|
|
ghash$1.update(Buffer$n.alloc(8, 0));
|
|
var ivBits = len * 8;
|
|
var tail = Buffer$n.alloc(8);
|
|
tail.writeUIntBE(ivBits, 0, 8);
|
|
ghash$1.update(tail);
|
|
self._finID = ghash$1.state;
|
|
var out = Buffer$n.from(self._finID);
|
|
incr32_1(out);
|
|
return out
|
|
}
|
|
function StreamCipher (mode, key, iv, decrypt) {
|
|
cipherBase.call(this);
|
|
|
|
var h = Buffer$n.alloc(4, 0);
|
|
|
|
this._cipher = new aes.AES(key);
|
|
var ck = this._cipher.encryptBlock(h);
|
|
this._ghash = new ghash(ck);
|
|
iv = calcIv(this, iv, ck);
|
|
|
|
this._prev = Buffer$n.from(iv);
|
|
this._cache = Buffer$n.allocUnsafe(0);
|
|
this._secCache = Buffer$n.allocUnsafe(0);
|
|
this._decrypt = decrypt;
|
|
this._alen = 0;
|
|
this._len = 0;
|
|
this._mode = mode;
|
|
|
|
this._authTag = null;
|
|
this._called = false;
|
|
}
|
|
|
|
inherits_browser(StreamCipher, cipherBase);
|
|
|
|
StreamCipher.prototype._update = function (chunk) {
|
|
if (!this._called && this._alen) {
|
|
var rump = 16 - (this._alen % 16);
|
|
if (rump < 16) {
|
|
rump = Buffer$n.alloc(rump, 0);
|
|
this._ghash.update(rump);
|
|
}
|
|
}
|
|
|
|
this._called = true;
|
|
var out = this._mode.encrypt(this, chunk);
|
|
if (this._decrypt) {
|
|
this._ghash.update(chunk);
|
|
} else {
|
|
this._ghash.update(out);
|
|
}
|
|
this._len += chunk.length;
|
|
return out
|
|
};
|
|
|
|
StreamCipher.prototype._final = function () {
|
|
if (this._decrypt && !this._authTag) throw new Error('Unsupported state or unable to authenticate data')
|
|
|
|
var tag = bufferXor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID));
|
|
if (this._decrypt && xorTest(tag, this._authTag)) throw new Error('Unsupported state or unable to authenticate data')
|
|
|
|
this._authTag = tag;
|
|
this._cipher.scrub();
|
|
};
|
|
|
|
StreamCipher.prototype.getAuthTag = function getAuthTag () {
|
|
if (this._decrypt || !Buffer$n.isBuffer(this._authTag)) throw new Error('Attempting to get auth tag in unsupported state')
|
|
|
|
return this._authTag
|
|
};
|
|
|
|
StreamCipher.prototype.setAuthTag = function setAuthTag (tag) {
|
|
if (!this._decrypt) throw new Error('Attempting to set auth tag in unsupported state')
|
|
|
|
this._authTag = tag;
|
|
};
|
|
|
|
StreamCipher.prototype.setAAD = function setAAD (buf) {
|
|
if (this._called) throw new Error('Attempting to set AAD in unsupported state')
|
|
|
|
this._ghash.update(buf);
|
|
this._alen += buf.length;
|
|
};
|
|
|
|
var authCipher = StreamCipher;
|
|
|
|
var Buffer$o = safeBuffer.Buffer;
|
|
|
|
|
|
|
|
function StreamCipher$1 (mode, key, iv, decrypt) {
|
|
cipherBase.call(this);
|
|
|
|
this._cipher = new aes.AES(key);
|
|
this._prev = Buffer$o.from(iv);
|
|
this._cache = Buffer$o.allocUnsafe(0);
|
|
this._secCache = Buffer$o.allocUnsafe(0);
|
|
this._decrypt = decrypt;
|
|
this._mode = mode;
|
|
}
|
|
|
|
inherits_browser(StreamCipher$1, cipherBase);
|
|
|
|
StreamCipher$1.prototype._update = function (chunk) {
|
|
return this._mode.encrypt(this, chunk, this._decrypt)
|
|
};
|
|
|
|
StreamCipher$1.prototype._final = function () {
|
|
this._cipher.scrub();
|
|
};
|
|
|
|
var streamCipher = StreamCipher$1;
|
|
|
|
var Buffer$p = safeBuffer.Buffer;
|
|
|
|
|
|
/* eslint-disable camelcase */
|
|
function EVP_BytesToKey (password, salt, keyBits, ivLen) {
|
|
if (!Buffer$p.isBuffer(password)) password = Buffer$p.from(password, 'binary');
|
|
if (salt) {
|
|
if (!Buffer$p.isBuffer(salt)) salt = Buffer$p.from(salt, 'binary');
|
|
if (salt.length !== 8) throw new RangeError('salt should be Buffer with 8 byte length')
|
|
}
|
|
|
|
var keyLen = keyBits / 8;
|
|
var key = Buffer$p.alloc(keyLen);
|
|
var iv = Buffer$p.alloc(ivLen || 0);
|
|
var tmp = Buffer$p.alloc(0);
|
|
|
|
while (keyLen > 0 || ivLen > 0) {
|
|
var hash = new md5_js();
|
|
hash.update(tmp);
|
|
hash.update(password);
|
|
if (salt) hash.update(salt);
|
|
tmp = hash.digest();
|
|
|
|
var used = 0;
|
|
|
|
if (keyLen > 0) {
|
|
var keyStart = key.length - keyLen;
|
|
used = Math.min(keyLen, tmp.length);
|
|
tmp.copy(key, keyStart, 0, used);
|
|
keyLen -= used;
|
|
}
|
|
|
|
if (used < tmp.length && ivLen > 0) {
|
|
var ivStart = iv.length - ivLen;
|
|
var length = Math.min(ivLen, tmp.length - used);
|
|
tmp.copy(iv, ivStart, used, used + length);
|
|
ivLen -= length;
|
|
}
|
|
}
|
|
|
|
tmp.fill(0);
|
|
return { key: key, iv: iv }
|
|
}
|
|
|
|
var evp_bytestokey = EVP_BytesToKey;
|
|
|
|
var Buffer$q = safeBuffer.Buffer;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
function Cipher$4 (mode, key, iv) {
|
|
cipherBase.call(this);
|
|
|
|
this._cache = new Splitter();
|
|
this._cipher = new aes.AES(key);
|
|
this._prev = Buffer$q.from(iv);
|
|
this._mode = mode;
|
|
this._autopadding = true;
|
|
}
|
|
|
|
inherits_browser(Cipher$4, cipherBase);
|
|
|
|
Cipher$4.prototype._update = function (data) {
|
|
this._cache.add(data);
|
|
var chunk;
|
|
var thing;
|
|
var out = [];
|
|
|
|
while ((chunk = this._cache.get())) {
|
|
thing = this._mode.encrypt(this, chunk);
|
|
out.push(thing);
|
|
}
|
|
|
|
return Buffer$q.concat(out)
|
|
};
|
|
|
|
var PADDING = Buffer$q.alloc(16, 0x10);
|
|
|
|
Cipher$4.prototype._final = function () {
|
|
var chunk = this._cache.flush();
|
|
if (this._autopadding) {
|
|
chunk = this._mode.encrypt(this, chunk);
|
|
this._cipher.scrub();
|
|
return chunk
|
|
}
|
|
|
|
if (!chunk.equals(PADDING)) {
|
|
this._cipher.scrub();
|
|
throw new Error('data not multiple of block length')
|
|
}
|
|
};
|
|
|
|
Cipher$4.prototype.setAutoPadding = function (setTo) {
|
|
this._autopadding = !!setTo;
|
|
return this
|
|
};
|
|
|
|
function Splitter () {
|
|
this.cache = Buffer$q.allocUnsafe(0);
|
|
}
|
|
|
|
Splitter.prototype.add = function (data) {
|
|
this.cache = Buffer$q.concat([this.cache, data]);
|
|
};
|
|
|
|
Splitter.prototype.get = function () {
|
|
if (this.cache.length > 15) {
|
|
var out = this.cache.slice(0, 16);
|
|
this.cache = this.cache.slice(16);
|
|
return out
|
|
}
|
|
return null
|
|
};
|
|
|
|
Splitter.prototype.flush = function () {
|
|
var len = 16 - this.cache.length;
|
|
var padBuff = Buffer$q.allocUnsafe(len);
|
|
|
|
var i = -1;
|
|
while (++i < len) {
|
|
padBuff.writeUInt8(len, i);
|
|
}
|
|
|
|
return Buffer$q.concat([this.cache, padBuff])
|
|
};
|
|
|
|
function createCipheriv (suite, password, iv) {
|
|
var config = modes_1[suite.toLowerCase()];
|
|
if (!config) throw new TypeError('invalid suite type')
|
|
|
|
if (typeof password === 'string') password = Buffer$q.from(password);
|
|
if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)
|
|
|
|
if (typeof iv === 'string') iv = Buffer$q.from(iv);
|
|
if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)
|
|
|
|
if (config.type === 'stream') {
|
|
return new streamCipher(config.module, password, iv)
|
|
} else if (config.type === 'auth') {
|
|
return new authCipher(config.module, password, iv)
|
|
}
|
|
|
|
return new Cipher$4(config.module, password, iv)
|
|
}
|
|
|
|
function createCipher (suite, password) {
|
|
var config = modes_1[suite.toLowerCase()];
|
|
if (!config) throw new TypeError('invalid suite type')
|
|
|
|
var keys = evp_bytestokey(password, false, config.key, config.iv);
|
|
return createCipheriv(suite, keys.key, keys.iv)
|
|
}
|
|
|
|
var createCipheriv_1 = createCipheriv;
|
|
var createCipher_1 = createCipher;
|
|
|
|
var encrypter = {
|
|
createCipheriv: createCipheriv_1,
|
|
createCipher: createCipher_1
|
|
};
|
|
|
|
var Buffer$r = safeBuffer.Buffer;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
function Decipher (mode, key, iv) {
|
|
cipherBase.call(this);
|
|
|
|
this._cache = new Splitter$1();
|
|
this._last = void 0;
|
|
this._cipher = new aes.AES(key);
|
|
this._prev = Buffer$r.from(iv);
|
|
this._mode = mode;
|
|
this._autopadding = true;
|
|
}
|
|
|
|
inherits_browser(Decipher, cipherBase);
|
|
|
|
Decipher.prototype._update = function (data) {
|
|
this._cache.add(data);
|
|
var chunk;
|
|
var thing;
|
|
var out = [];
|
|
while ((chunk = this._cache.get(this._autopadding))) {
|
|
thing = this._mode.decrypt(this, chunk);
|
|
out.push(thing);
|
|
}
|
|
return Buffer$r.concat(out)
|
|
};
|
|
|
|
Decipher.prototype._final = function () {
|
|
var chunk = this._cache.flush();
|
|
if (this._autopadding) {
|
|
return unpad(this._mode.decrypt(this, chunk))
|
|
} else if (chunk) {
|
|
throw new Error('data not multiple of block length')
|
|
}
|
|
};
|
|
|
|
Decipher.prototype.setAutoPadding = function (setTo) {
|
|
this._autopadding = !!setTo;
|
|
return this
|
|
};
|
|
|
|
function Splitter$1 () {
|
|
this.cache = Buffer$r.allocUnsafe(0);
|
|
}
|
|
|
|
Splitter$1.prototype.add = function (data) {
|
|
this.cache = Buffer$r.concat([this.cache, data]);
|
|
};
|
|
|
|
Splitter$1.prototype.get = function (autoPadding) {
|
|
var out;
|
|
if (autoPadding) {
|
|
if (this.cache.length > 16) {
|
|
out = this.cache.slice(0, 16);
|
|
this.cache = this.cache.slice(16);
|
|
return out
|
|
}
|
|
} else {
|
|
if (this.cache.length >= 16) {
|
|
out = this.cache.slice(0, 16);
|
|
this.cache = this.cache.slice(16);
|
|
return out
|
|
}
|
|
}
|
|
|
|
return null
|
|
};
|
|
|
|
Splitter$1.prototype.flush = function () {
|
|
if (this.cache.length) return this.cache
|
|
};
|
|
|
|
function unpad (last) {
|
|
var padded = last[15];
|
|
if (padded < 1 || padded > 16) {
|
|
throw new Error('unable to decrypt data')
|
|
}
|
|
var i = -1;
|
|
while (++i < padded) {
|
|
if (last[(i + (16 - padded))] !== padded) {
|
|
throw new Error('unable to decrypt data')
|
|
}
|
|
}
|
|
if (padded === 16) return
|
|
|
|
return last.slice(0, 16 - padded)
|
|
}
|
|
|
|
function createDecipheriv (suite, password, iv) {
|
|
var config = modes_1[suite.toLowerCase()];
|
|
if (!config) throw new TypeError('invalid suite type')
|
|
|
|
if (typeof iv === 'string') iv = Buffer$r.from(iv);
|
|
if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)
|
|
|
|
if (typeof password === 'string') password = Buffer$r.from(password);
|
|
if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)
|
|
|
|
if (config.type === 'stream') {
|
|
return new streamCipher(config.module, password, iv, true)
|
|
} else if (config.type === 'auth') {
|
|
return new authCipher(config.module, password, iv, true)
|
|
}
|
|
|
|
return new Decipher(config.module, password, iv)
|
|
}
|
|
|
|
function createDecipher (suite, password) {
|
|
var config = modes_1[suite.toLowerCase()];
|
|
if (!config) throw new TypeError('invalid suite type')
|
|
|
|
var keys = evp_bytestokey(password, false, config.key, config.iv);
|
|
return createDecipheriv(suite, keys.key, keys.iv)
|
|
}
|
|
|
|
var createDecipher_1 = createDecipher;
|
|
var createDecipheriv_1 = createDecipheriv;
|
|
|
|
var decrypter = {
|
|
createDecipher: createDecipher_1,
|
|
createDecipheriv: createDecipheriv_1
|
|
};
|
|
|
|
var browser$4 = createCommonjsModule(function (module, exports) {
|
|
function getCiphers () {
|
|
return Object.keys(modes$1)
|
|
}
|
|
|
|
exports.createCipher = exports.Cipher = encrypter.createCipher;
|
|
exports.createCipheriv = exports.Cipheriv = encrypter.createCipheriv;
|
|
exports.createDecipher = exports.Decipher = decrypter.createDecipher;
|
|
exports.createDecipheriv = exports.Decipheriv = decrypter.createDecipheriv;
|
|
exports.listCiphers = exports.getCiphers = getCiphers;
|
|
});
|
|
var browser_1 = browser$4.createCipher;
|
|
var browser_2 = browser$4.Cipher;
|
|
var browser_3 = browser$4.createCipheriv;
|
|
var browser_4 = browser$4.Cipheriv;
|
|
var browser_5 = browser$4.createDecipher;
|
|
var browser_6 = browser$4.Decipher;
|
|
var browser_7 = browser$4.createDecipheriv;
|
|
var browser_8 = browser$4.Decipheriv;
|
|
var browser_9 = browser$4.listCiphers;
|
|
var browser_10 = browser$4.getCiphers;
|
|
|
|
var modes$2 = createCommonjsModule(function (module, exports) {
|
|
exports['des-ecb'] = {
|
|
key: 8,
|
|
iv: 0
|
|
};
|
|
exports['des-cbc'] = exports.des = {
|
|
key: 8,
|
|
iv: 8
|
|
};
|
|
exports['des-ede3-cbc'] = exports.des3 = {
|
|
key: 24,
|
|
iv: 8
|
|
};
|
|
exports['des-ede3'] = {
|
|
key: 24,
|
|
iv: 0
|
|
};
|
|
exports['des-ede-cbc'] = {
|
|
key: 16,
|
|
iv: 8
|
|
};
|
|
exports['des-ede'] = {
|
|
key: 16,
|
|
iv: 0
|
|
};
|
|
});
|
|
var modes_1$1 = modes$2.des;
|
|
var modes_2 = modes$2.des3;
|
|
|
|
var browser$5 = createCommonjsModule(function (module, exports) {
|
|
function createCipher (suite, password) {
|
|
suite = suite.toLowerCase();
|
|
|
|
var keyLen, ivLen;
|
|
if (modes_1[suite]) {
|
|
keyLen = modes_1[suite].key;
|
|
ivLen = modes_1[suite].iv;
|
|
} else if (modes$2[suite]) {
|
|
keyLen = modes$2[suite].key * 8;
|
|
ivLen = modes$2[suite].iv;
|
|
} else {
|
|
throw new TypeError('invalid suite type')
|
|
}
|
|
|
|
var keys = evp_bytestokey(password, false, keyLen, ivLen);
|
|
return createCipheriv(suite, keys.key, keys.iv)
|
|
}
|
|
|
|
function createDecipher (suite, password) {
|
|
suite = suite.toLowerCase();
|
|
|
|
var keyLen, ivLen;
|
|
if (modes_1[suite]) {
|
|
keyLen = modes_1[suite].key;
|
|
ivLen = modes_1[suite].iv;
|
|
} else if (modes$2[suite]) {
|
|
keyLen = modes$2[suite].key * 8;
|
|
ivLen = modes$2[suite].iv;
|
|
} else {
|
|
throw new TypeError('invalid suite type')
|
|
}
|
|
|
|
var keys = evp_bytestokey(password, false, keyLen, ivLen);
|
|
return createDecipheriv(suite, keys.key, keys.iv)
|
|
}
|
|
|
|
function createCipheriv (suite, key, iv) {
|
|
suite = suite.toLowerCase();
|
|
if (modes_1[suite]) return browser$4.createCipheriv(suite, key, iv)
|
|
if (modes$2[suite]) return new browserifyDes({ key: key, iv: iv, mode: suite })
|
|
|
|
throw new TypeError('invalid suite type')
|
|
}
|
|
|
|
function createDecipheriv (suite, key, iv) {
|
|
suite = suite.toLowerCase();
|
|
if (modes_1[suite]) return browser$4.createDecipheriv(suite, key, iv)
|
|
if (modes$2[suite]) return new browserifyDes({ key: key, iv: iv, mode: suite, decrypt: true })
|
|
|
|
throw new TypeError('invalid suite type')
|
|
}
|
|
|
|
function getCiphers () {
|
|
return Object.keys(modes$2).concat(browser$4.getCiphers())
|
|
}
|
|
|
|
exports.createCipher = exports.Cipher = createCipher;
|
|
exports.createCipheriv = exports.Cipheriv = createCipheriv;
|
|
exports.createDecipher = exports.Decipher = createDecipher;
|
|
exports.createDecipheriv = exports.Decipheriv = createDecipheriv;
|
|
exports.listCiphers = exports.getCiphers = getCiphers;
|
|
});
|
|
var browser_1$1 = browser$5.createCipher;
|
|
var browser_2$1 = browser$5.Cipher;
|
|
var browser_3$1 = browser$5.createCipheriv;
|
|
var browser_4$1 = browser$5.Cipheriv;
|
|
var browser_5$1 = browser$5.createDecipher;
|
|
var browser_6$1 = browser$5.Decipher;
|
|
var browser_7$1 = browser$5.createDecipheriv;
|
|
var browser_8$1 = browser$5.Decipheriv;
|
|
var browser_9$1 = browser$5.listCiphers;
|
|
var browser_10$1 = browser$5.getCiphers;
|
|
|
|
var bn = createCommonjsModule(function (module) {
|
|
(function (module, exports) {
|
|
|
|
// Utils
|
|
function assert (val, msg) {
|
|
if (!val) throw new Error(msg || 'Assertion failed');
|
|
}
|
|
|
|
// Could use `inherits` module, but don't want to move from single file
|
|
// architecture yet.
|
|
function inherits (ctor, superCtor) {
|
|
ctor.super_ = superCtor;
|
|
var TempCtor = function () {};
|
|
TempCtor.prototype = superCtor.prototype;
|
|
ctor.prototype = new TempCtor();
|
|
ctor.prototype.constructor = ctor;
|
|
}
|
|
|
|
// BN
|
|
|
|
function BN (number, base, endian) {
|
|
if (BN.isBN(number)) {
|
|
return number;
|
|
}
|
|
|
|
this.negative = 0;
|
|
this.words = null;
|
|
this.length = 0;
|
|
|
|
// Reduction context
|
|
this.red = null;
|
|
|
|
if (number !== null) {
|
|
if (base === 'le' || base === 'be') {
|
|
endian = base;
|
|
base = 10;
|
|
}
|
|
|
|
this._init(number || 0, base || 10, endian || 'be');
|
|
}
|
|
}
|
|
if (typeof module === 'object') {
|
|
module.exports = BN;
|
|
} else {
|
|
exports.BN = BN;
|
|
}
|
|
|
|
BN.BN = BN;
|
|
BN.wordSize = 26;
|
|
|
|
var Buffer;
|
|
try {
|
|
Buffer = buffer$1.Buffer;
|
|
} catch (e) {
|
|
}
|
|
|
|
BN.isBN = function isBN (num) {
|
|
if (num instanceof BN) {
|
|
return true;
|
|
}
|
|
|
|
return num !== null && typeof num === 'object' &&
|
|
num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);
|
|
};
|
|
|
|
BN.max = function max (left, right) {
|
|
if (left.cmp(right) > 0) return left;
|
|
return right;
|
|
};
|
|
|
|
BN.min = function min (left, right) {
|
|
if (left.cmp(right) < 0) return left;
|
|
return right;
|
|
};
|
|
|
|
BN.prototype._init = function init (number, base, endian) {
|
|
if (typeof number === 'number') {
|
|
return this._initNumber(number, base, endian);
|
|
}
|
|
|
|
if (typeof number === 'object') {
|
|
return this._initArray(number, base, endian);
|
|
}
|
|
|
|
if (base === 'hex') {
|
|
base = 16;
|
|
}
|
|
assert(base === (base | 0) && base >= 2 && base <= 36);
|
|
|
|
number = number.toString().replace(/\s+/g, '');
|
|
var start = 0;
|
|
if (number[0] === '-') {
|
|
start++;
|
|
}
|
|
|
|
if (base === 16) {
|
|
this._parseHex(number, start);
|
|
} else {
|
|
this._parseBase(number, base, start);
|
|
}
|
|
|
|
if (number[0] === '-') {
|
|
this.negative = 1;
|
|
}
|
|
|
|
this.strip();
|
|
|
|
if (endian !== 'le') return;
|
|
|
|
this._initArray(this.toArray(), base, endian);
|
|
};
|
|
|
|
BN.prototype._initNumber = function _initNumber (number, base, endian) {
|
|
if (number < 0) {
|
|
this.negative = 1;
|
|
number = -number;
|
|
}
|
|
if (number < 0x4000000) {
|
|
this.words = [ number & 0x3ffffff ];
|
|
this.length = 1;
|
|
} else if (number < 0x10000000000000) {
|
|
this.words = [
|
|
number & 0x3ffffff,
|
|
(number / 0x4000000) & 0x3ffffff
|
|
];
|
|
this.length = 2;
|
|
} else {
|
|
assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)
|
|
this.words = [
|
|
number & 0x3ffffff,
|
|
(number / 0x4000000) & 0x3ffffff,
|
|
1
|
|
];
|
|
this.length = 3;
|
|
}
|
|
|
|
if (endian !== 'le') return;
|
|
|
|
// Reverse the bytes
|
|
this._initArray(this.toArray(), base, endian);
|
|
};
|
|
|
|
BN.prototype._initArray = function _initArray (number, base, endian) {
|
|
// Perhaps a Uint8Array
|
|
assert(typeof number.length === 'number');
|
|
if (number.length <= 0) {
|
|
this.words = [ 0 ];
|
|
this.length = 1;
|
|
return this;
|
|
}
|
|
|
|
this.length = Math.ceil(number.length / 3);
|
|
this.words = new Array(this.length);
|
|
for (var i = 0; i < this.length; i++) {
|
|
this.words[i] = 0;
|
|
}
|
|
|
|
var j, w;
|
|
var off = 0;
|
|
if (endian === 'be') {
|
|
for (i = number.length - 1, j = 0; i >= 0; i -= 3) {
|
|
w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);
|
|
this.words[j] |= (w << off) & 0x3ffffff;
|
|
this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;
|
|
off += 24;
|
|
if (off >= 26) {
|
|
off -= 26;
|
|
j++;
|
|
}
|
|
}
|
|
} else if (endian === 'le') {
|
|
for (i = 0, j = 0; i < number.length; i += 3) {
|
|
w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);
|
|
this.words[j] |= (w << off) & 0x3ffffff;
|
|
this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;
|
|
off += 24;
|
|
if (off >= 26) {
|
|
off -= 26;
|
|
j++;
|
|
}
|
|
}
|
|
}
|
|
return this.strip();
|
|
};
|
|
|
|
function parseHex (str, start, end) {
|
|
var r = 0;
|
|
var len = Math.min(str.length, end);
|
|
for (var i = start; i < len; i++) {
|
|
var c = str.charCodeAt(i) - 48;
|
|
|
|
r <<= 4;
|
|
|
|
// 'a' - 'f'
|
|
if (c >= 49 && c <= 54) {
|
|
r |= c - 49 + 0xa;
|
|
|
|
// 'A' - 'F'
|
|
} else if (c >= 17 && c <= 22) {
|
|
r |= c - 17 + 0xa;
|
|
|
|
// '0' - '9'
|
|
} else {
|
|
r |= c & 0xf;
|
|
}
|
|
}
|
|
return r;
|
|
}
|
|
|
|
BN.prototype._parseHex = function _parseHex (number, start) {
|
|
// Create possibly bigger array to ensure that it fits the number
|
|
this.length = Math.ceil((number.length - start) / 6);
|
|
this.words = new Array(this.length);
|
|
for (var i = 0; i < this.length; i++) {
|
|
this.words[i] = 0;
|
|
}
|
|
|
|
var j, w;
|
|
// Scan 24-bit chunks and add them to the number
|
|
var off = 0;
|
|
for (i = number.length - 6, j = 0; i >= start; i -= 6) {
|
|
w = parseHex(number, i, i + 6);
|
|
this.words[j] |= (w << off) & 0x3ffffff;
|
|
// NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb
|
|
this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;
|
|
off += 24;
|
|
if (off >= 26) {
|
|
off -= 26;
|
|
j++;
|
|
}
|
|
}
|
|
if (i + 6 !== start) {
|
|
w = parseHex(number, start, i + 6);
|
|
this.words[j] |= (w << off) & 0x3ffffff;
|
|
this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;
|
|
}
|
|
this.strip();
|
|
};
|
|
|
|
function parseBase (str, start, end, mul) {
|
|
var r = 0;
|
|
var len = Math.min(str.length, end);
|
|
for (var i = start; i < len; i++) {
|
|
var c = str.charCodeAt(i) - 48;
|
|
|
|
r *= mul;
|
|
|
|
// 'a'
|
|
if (c >= 49) {
|
|
r += c - 49 + 0xa;
|
|
|
|
// 'A'
|
|
} else if (c >= 17) {
|
|
r += c - 17 + 0xa;
|
|
|
|
// '0' - '9'
|
|
} else {
|
|
r += c;
|
|
}
|
|
}
|
|
return r;
|
|
}
|
|
|
|
BN.prototype._parseBase = function _parseBase (number, base, start) {
|
|
// Initialize as zero
|
|
this.words = [ 0 ];
|
|
this.length = 1;
|
|
|
|
// Find length of limb in base
|
|
for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {
|
|
limbLen++;
|
|
}
|
|
limbLen--;
|
|
limbPow = (limbPow / base) | 0;
|
|
|
|
var total = number.length - start;
|
|
var mod = total % limbLen;
|
|
var end = Math.min(total, total - mod) + start;
|
|
|
|
var word = 0;
|
|
for (var i = start; i < end; i += limbLen) {
|
|
word = parseBase(number, i, i + limbLen, base);
|
|
|
|
this.imuln(limbPow);
|
|
if (this.words[0] + word < 0x4000000) {
|
|
this.words[0] += word;
|
|
} else {
|
|
this._iaddn(word);
|
|
}
|
|
}
|
|
|
|
if (mod !== 0) {
|
|
var pow = 1;
|
|
word = parseBase(number, i, number.length, base);
|
|
|
|
for (i = 0; i < mod; i++) {
|
|
pow *= base;
|
|
}
|
|
|
|
this.imuln(pow);
|
|
if (this.words[0] + word < 0x4000000) {
|
|
this.words[0] += word;
|
|
} else {
|
|
this._iaddn(word);
|
|
}
|
|
}
|
|
};
|
|
|
|
BN.prototype.copy = function copy (dest) {
|
|
dest.words = new Array(this.length);
|
|
for (var i = 0; i < this.length; i++) {
|
|
dest.words[i] = this.words[i];
|
|
}
|
|
dest.length = this.length;
|
|
dest.negative = this.negative;
|
|
dest.red = this.red;
|
|
};
|
|
|
|
BN.prototype.clone = function clone () {
|
|
var r = new BN(null);
|
|
this.copy(r);
|
|
return r;
|
|
};
|
|
|
|
BN.prototype._expand = function _expand (size) {
|
|
while (this.length < size) {
|
|
this.words[this.length++] = 0;
|
|
}
|
|
return this;
|
|
};
|
|
|
|
// Remove leading `0` from `this`
|
|
BN.prototype.strip = function strip () {
|
|
while (this.length > 1 && this.words[this.length - 1] === 0) {
|
|
this.length--;
|
|
}
|
|
return this._normSign();
|
|
};
|
|
|
|
BN.prototype._normSign = function _normSign () {
|
|
// -0 = 0
|
|
if (this.length === 1 && this.words[0] === 0) {
|
|
this.negative = 0;
|
|
}
|
|
return this;
|
|
};
|
|
|
|
BN.prototype.inspect = function inspect () {
|
|
return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';
|
|
};
|
|
|
|
/*
|
|
|
|
var zeros = [];
|
|
var groupSizes = [];
|
|
var groupBases = [];
|
|
|
|
var s = '';
|
|
var i = -1;
|
|
while (++i < BN.wordSize) {
|
|
zeros[i] = s;
|
|
s += '0';
|
|
}
|
|
groupSizes[0] = 0;
|
|
groupSizes[1] = 0;
|
|
groupBases[0] = 0;
|
|
groupBases[1] = 0;
|
|
var base = 2 - 1;
|
|
while (++base < 36 + 1) {
|
|
var groupSize = 0;
|
|
var groupBase = 1;
|
|
while (groupBase < (1 << BN.wordSize) / base) {
|
|
groupBase *= base;
|
|
groupSize += 1;
|
|
}
|
|
groupSizes[base] = groupSize;
|
|
groupBases[base] = groupBase;
|
|
}
|
|
|
|
*/
|
|
|
|
var zeros = [
|
|
'',
|
|
'0',
|
|
'00',
|
|
'000',
|
|
'0000',
|
|
'00000',
|
|
'000000',
|
|
'0000000',
|
|
'00000000',
|
|
'000000000',
|
|
'0000000000',
|
|
'00000000000',
|
|
'000000000000',
|
|
'0000000000000',
|
|
'00000000000000',
|
|
'000000000000000',
|
|
'0000000000000000',
|
|
'00000000000000000',
|
|
'000000000000000000',
|
|
'0000000000000000000',
|
|
'00000000000000000000',
|
|
'000000000000000000000',
|
|
'0000000000000000000000',
|
|
'00000000000000000000000',
|
|
'000000000000000000000000',
|
|
'0000000000000000000000000'
|
|
];
|
|
|
|
var groupSizes = [
|
|
0, 0,
|
|
25, 16, 12, 11, 10, 9, 8,
|
|
8, 7, 7, 7, 7, 6, 6,
|
|
6, 6, 6, 6, 6, 5, 5,
|
|
5, 5, 5, 5, 5, 5, 5,
|
|
5, 5, 5, 5, 5, 5, 5
|
|
];
|
|
|
|
var groupBases = [
|
|
0, 0,
|
|
33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,
|
|
43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,
|
|
16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,
|
|
6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,
|
|
24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176
|
|
];
|
|
|
|
BN.prototype.toString = function toString (base, padding) {
|
|
base = base || 10;
|
|
padding = padding | 0 || 1;
|
|
|
|
var out;
|
|
if (base === 16 || base === 'hex') {
|
|
out = '';
|
|
var off = 0;
|
|
var carry = 0;
|
|
for (var i = 0; i < this.length; i++) {
|
|
var w = this.words[i];
|
|
var word = (((w << off) | carry) & 0xffffff).toString(16);
|
|
carry = (w >>> (24 - off)) & 0xffffff;
|
|
if (carry !== 0 || i !== this.length - 1) {
|
|
out = zeros[6 - word.length] + word + out;
|
|
} else {
|
|
out = word + out;
|
|
}
|
|
off += 2;
|
|
if (off >= 26) {
|
|
off -= 26;
|
|
i--;
|
|
}
|
|
}
|
|
if (carry !== 0) {
|
|
out = carry.toString(16) + out;
|
|
}
|
|
while (out.length % padding !== 0) {
|
|
out = '0' + out;
|
|
}
|
|
if (this.negative !== 0) {
|
|
out = '-' + out;
|
|
}
|
|
return out;
|
|
}
|
|
|
|
if (base === (base | 0) && base >= 2 && base <= 36) {
|
|
// var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));
|
|
var groupSize = groupSizes[base];
|
|
// var groupBase = Math.pow(base, groupSize);
|
|
var groupBase = groupBases[base];
|
|
out = '';
|
|
var c = this.clone();
|
|
c.negative = 0;
|
|
while (!c.isZero()) {
|
|
var r = c.modn(groupBase).toString(base);
|
|
c = c.idivn(groupBase);
|
|
|
|
if (!c.isZero()) {
|
|
out = zeros[groupSize - r.length] + r + out;
|
|
} else {
|
|
out = r + out;
|
|
}
|
|
}
|
|
if (this.isZero()) {
|
|
out = '0' + out;
|
|
}
|
|
while (out.length % padding !== 0) {
|
|
out = '0' + out;
|
|
}
|
|
if (this.negative !== 0) {
|
|
out = '-' + out;
|
|
}
|
|
return out;
|
|
}
|
|
|
|
assert(false, 'Base should be between 2 and 36');
|
|
};
|
|
|
|
BN.prototype.toNumber = function toNumber () {
|
|
var ret = this.words[0];
|
|
if (this.length === 2) {
|
|
ret += this.words[1] * 0x4000000;
|
|
} else if (this.length === 3 && this.words[2] === 0x01) {
|
|
// NOTE: at this stage it is known that the top bit is set
|
|
ret += 0x10000000000000 + (this.words[1] * 0x4000000);
|
|
} else if (this.length > 2) {
|
|
assert(false, 'Number can only safely store up to 53 bits');
|
|
}
|
|
return (this.negative !== 0) ? -ret : ret;
|
|
};
|
|
|
|
BN.prototype.toJSON = function toJSON () {
|
|
return this.toString(16);
|
|
};
|
|
|
|
BN.prototype.toBuffer = function toBuffer (endian, length) {
|
|
assert(typeof Buffer !== 'undefined');
|
|
return this.toArrayLike(Buffer, endian, length);
|
|
};
|
|
|
|
BN.prototype.toArray = function toArray (endian, length) {
|
|
return this.toArrayLike(Array, endian, length);
|
|
};
|
|
|
|
BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {
|
|
var byteLength = this.byteLength();
|
|
var reqLength = length || Math.max(1, byteLength);
|
|
assert(byteLength <= reqLength, 'byte array longer than desired length');
|
|
assert(reqLength > 0, 'Requested array length <= 0');
|
|
|
|
this.strip();
|
|
var littleEndian = endian === 'le';
|
|
var res = new ArrayType(reqLength);
|
|
|
|
var b, i;
|
|
var q = this.clone();
|
|
if (!littleEndian) {
|
|
// Assume big-endian
|
|
for (i = 0; i < reqLength - byteLength; i++) {
|
|
res[i] = 0;
|
|
}
|
|
|
|
for (i = 0; !q.isZero(); i++) {
|
|
b = q.andln(0xff);
|
|
q.iushrn(8);
|
|
|
|
res[reqLength - i - 1] = b;
|
|
}
|
|
} else {
|
|
for (i = 0; !q.isZero(); i++) {
|
|
b = q.andln(0xff);
|
|
q.iushrn(8);
|
|
|
|
res[i] = b;
|
|
}
|
|
|
|
for (; i < reqLength; i++) {
|
|
res[i] = 0;
|
|
}
|
|
}
|
|
|
|
return res;
|
|
};
|
|
|
|
if (Math.clz32) {
|
|
BN.prototype._countBits = function _countBits (w) {
|
|
return 32 - Math.clz32(w);
|
|
};
|
|
} else {
|
|
BN.prototype._countBits = function _countBits (w) {
|
|
var t = w;
|
|
var r = 0;
|
|
if (t >= 0x1000) {
|
|
r += 13;
|
|
t >>>= 13;
|
|
}
|
|
if (t >= 0x40) {
|
|
r += 7;
|
|
t >>>= 7;
|
|
}
|
|
if (t >= 0x8) {
|
|
r += 4;
|
|
t >>>= 4;
|
|
}
|
|
if (t >= 0x02) {
|
|
r += 2;
|
|
t >>>= 2;
|
|
}
|
|
return r + t;
|
|
};
|
|
}
|
|
|
|
BN.prototype._zeroBits = function _zeroBits (w) {
|
|
// Short-cut
|
|
if (w === 0) return 26;
|
|
|
|
var t = w;
|
|
var r = 0;
|
|
if ((t & 0x1fff) === 0) {
|
|
r += 13;
|
|
t >>>= 13;
|
|
}
|
|
if ((t & 0x7f) === 0) {
|
|
r += 7;
|
|
t >>>= 7;
|
|
}
|
|
if ((t & 0xf) === 0) {
|
|
r += 4;
|
|
t >>>= 4;
|
|
}
|
|
if ((t & 0x3) === 0) {
|
|
r += 2;
|
|
t >>>= 2;
|
|
}
|
|
if ((t & 0x1) === 0) {
|
|
r++;
|
|
}
|
|
return r;
|
|
};
|
|
|
|
// Return number of used bits in a BN
|
|
BN.prototype.bitLength = function bitLength () {
|
|
var w = this.words[this.length - 1];
|
|
var hi = this._countBits(w);
|
|
return (this.length - 1) * 26 + hi;
|
|
};
|
|
|
|
function toBitArray (num) {
|
|
var w = new Array(num.bitLength());
|
|
|
|
for (var bit = 0; bit < w.length; bit++) {
|
|
var off = (bit / 26) | 0;
|
|
var wbit = bit % 26;
|
|
|
|
w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;
|
|
}
|
|
|
|
return w;
|
|
}
|
|
|
|
// Number of trailing zero bits
|
|
BN.prototype.zeroBits = function zeroBits () {
|
|
if (this.isZero()) return 0;
|
|
|
|
var r = 0;
|
|
for (var i = 0; i < this.length; i++) {
|
|
var b = this._zeroBits(this.words[i]);
|
|
r += b;
|
|
if (b !== 26) break;
|
|
}
|
|
return r;
|
|
};
|
|
|
|
BN.prototype.byteLength = function byteLength () {
|
|
return Math.ceil(this.bitLength() / 8);
|
|
};
|
|
|
|
BN.prototype.toTwos = function toTwos (width) {
|
|
if (this.negative !== 0) {
|
|
return this.abs().inotn(width).iaddn(1);
|
|
}
|
|
return this.clone();
|
|
};
|
|
|
|
BN.prototype.fromTwos = function fromTwos (width) {
|
|
if (this.testn(width - 1)) {
|
|
return this.notn(width).iaddn(1).ineg();
|
|
}
|
|
return this.clone();
|
|
};
|
|
|
|
BN.prototype.isNeg = function isNeg () {
|
|
return this.negative !== 0;
|
|
};
|
|
|
|
// Return negative clone of `this`
|
|
BN.prototype.neg = function neg () {
|
|
return this.clone().ineg();
|
|
};
|
|
|
|
BN.prototype.ineg = function ineg () {
|
|
if (!this.isZero()) {
|
|
this.negative ^= 1;
|
|
}
|
|
|
|
return this;
|
|
};
|
|
|
|
// Or `num` with `this` in-place
|
|
BN.prototype.iuor = function iuor (num) {
|
|
while (this.length < num.length) {
|
|
this.words[this.length++] = 0;
|
|
}
|
|
|
|
for (var i = 0; i < num.length; i++) {
|
|
this.words[i] = this.words[i] | num.words[i];
|
|
}
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype.ior = function ior (num) {
|
|
assert((this.negative | num.negative) === 0);
|
|
return this.iuor(num);
|
|
};
|
|
|
|
// Or `num` with `this`
|
|
BN.prototype.or = function or (num) {
|
|
if (this.length > num.length) return this.clone().ior(num);
|
|
return num.clone().ior(this);
|
|
};
|
|
|
|
BN.prototype.uor = function uor (num) {
|
|
if (this.length > num.length) return this.clone().iuor(num);
|
|
return num.clone().iuor(this);
|
|
};
|
|
|
|
// And `num` with `this` in-place
|
|
BN.prototype.iuand = function iuand (num) {
|
|
// b = min-length(num, this)
|
|
var b;
|
|
if (this.length > num.length) {
|
|
b = num;
|
|
} else {
|
|
b = this;
|
|
}
|
|
|
|
for (var i = 0; i < b.length; i++) {
|
|
this.words[i] = this.words[i] & num.words[i];
|
|
}
|
|
|
|
this.length = b.length;
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype.iand = function iand (num) {
|
|
assert((this.negative | num.negative) === 0);
|
|
return this.iuand(num);
|
|
};
|
|
|
|
// And `num` with `this`
|
|
BN.prototype.and = function and (num) {
|
|
if (this.length > num.length) return this.clone().iand(num);
|
|
return num.clone().iand(this);
|
|
};
|
|
|
|
BN.prototype.uand = function uand (num) {
|
|
if (this.length > num.length) return this.clone().iuand(num);
|
|
return num.clone().iuand(this);
|
|
};
|
|
|
|
// Xor `num` with `this` in-place
|
|
BN.prototype.iuxor = function iuxor (num) {
|
|
// a.length > b.length
|
|
var a;
|
|
var b;
|
|
if (this.length > num.length) {
|
|
a = this;
|
|
b = num;
|
|
} else {
|
|
a = num;
|
|
b = this;
|
|
}
|
|
|
|
for (var i = 0; i < b.length; i++) {
|
|
this.words[i] = a.words[i] ^ b.words[i];
|
|
}
|
|
|
|
if (this !== a) {
|
|
for (; i < a.length; i++) {
|
|
this.words[i] = a.words[i];
|
|
}
|
|
}
|
|
|
|
this.length = a.length;
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype.ixor = function ixor (num) {
|
|
assert((this.negative | num.negative) === 0);
|
|
return this.iuxor(num);
|
|
};
|
|
|
|
// Xor `num` with `this`
|
|
BN.prototype.xor = function xor (num) {
|
|
if (this.length > num.length) return this.clone().ixor(num);
|
|
return num.clone().ixor(this);
|
|
};
|
|
|
|
BN.prototype.uxor = function uxor (num) {
|
|
if (this.length > num.length) return this.clone().iuxor(num);
|
|
return num.clone().iuxor(this);
|
|
};
|
|
|
|
// Not ``this`` with ``width`` bitwidth
|
|
BN.prototype.inotn = function inotn (width) {
|
|
assert(typeof width === 'number' && width >= 0);
|
|
|
|
var bytesNeeded = Math.ceil(width / 26) | 0;
|
|
var bitsLeft = width % 26;
|
|
|
|
// Extend the buffer with leading zeroes
|
|
this._expand(bytesNeeded);
|
|
|
|
if (bitsLeft > 0) {
|
|
bytesNeeded--;
|
|
}
|
|
|
|
// Handle complete words
|
|
for (var i = 0; i < bytesNeeded; i++) {
|
|
this.words[i] = ~this.words[i] & 0x3ffffff;
|
|
}
|
|
|
|
// Handle the residue
|
|
if (bitsLeft > 0) {
|
|
this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));
|
|
}
|
|
|
|
// And remove leading zeroes
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype.notn = function notn (width) {
|
|
return this.clone().inotn(width);
|
|
};
|
|
|
|
// Set `bit` of `this`
|
|
BN.prototype.setn = function setn (bit, val) {
|
|
assert(typeof bit === 'number' && bit >= 0);
|
|
|
|
var off = (bit / 26) | 0;
|
|
var wbit = bit % 26;
|
|
|
|
this._expand(off + 1);
|
|
|
|
if (val) {
|
|
this.words[off] = this.words[off] | (1 << wbit);
|
|
} else {
|
|
this.words[off] = this.words[off] & ~(1 << wbit);
|
|
}
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
// Add `num` to `this` in-place
|
|
BN.prototype.iadd = function iadd (num) {
|
|
var r;
|
|
|
|
// negative + positive
|
|
if (this.negative !== 0 && num.negative === 0) {
|
|
this.negative = 0;
|
|
r = this.isub(num);
|
|
this.negative ^= 1;
|
|
return this._normSign();
|
|
|
|
// positive + negative
|
|
} else if (this.negative === 0 && num.negative !== 0) {
|
|
num.negative = 0;
|
|
r = this.isub(num);
|
|
num.negative = 1;
|
|
return r._normSign();
|
|
}
|
|
|
|
// a.length > b.length
|
|
var a, b;
|
|
if (this.length > num.length) {
|
|
a = this;
|
|
b = num;
|
|
} else {
|
|
a = num;
|
|
b = this;
|
|
}
|
|
|
|
var carry = 0;
|
|
for (var i = 0; i < b.length; i++) {
|
|
r = (a.words[i] | 0) + (b.words[i] | 0) + carry;
|
|
this.words[i] = r & 0x3ffffff;
|
|
carry = r >>> 26;
|
|
}
|
|
for (; carry !== 0 && i < a.length; i++) {
|
|
r = (a.words[i] | 0) + carry;
|
|
this.words[i] = r & 0x3ffffff;
|
|
carry = r >>> 26;
|
|
}
|
|
|
|
this.length = a.length;
|
|
if (carry !== 0) {
|
|
this.words[this.length] = carry;
|
|
this.length++;
|
|
// Copy the rest of the words
|
|
} else if (a !== this) {
|
|
for (; i < a.length; i++) {
|
|
this.words[i] = a.words[i];
|
|
}
|
|
}
|
|
|
|
return this;
|
|
};
|
|
|
|
// Add `num` to `this`
|
|
BN.prototype.add = function add (num) {
|
|
var res;
|
|
if (num.negative !== 0 && this.negative === 0) {
|
|
num.negative = 0;
|
|
res = this.sub(num);
|
|
num.negative ^= 1;
|
|
return res;
|
|
} else if (num.negative === 0 && this.negative !== 0) {
|
|
this.negative = 0;
|
|
res = num.sub(this);
|
|
this.negative = 1;
|
|
return res;
|
|
}
|
|
|
|
if (this.length > num.length) return this.clone().iadd(num);
|
|
|
|
return num.clone().iadd(this);
|
|
};
|
|
|
|
// Subtract `num` from `this` in-place
|
|
BN.prototype.isub = function isub (num) {
|
|
// this - (-num) = this + num
|
|
if (num.negative !== 0) {
|
|
num.negative = 0;
|
|
var r = this.iadd(num);
|
|
num.negative = 1;
|
|
return r._normSign();
|
|
|
|
// -this - num = -(this + num)
|
|
} else if (this.negative !== 0) {
|
|
this.negative = 0;
|
|
this.iadd(num);
|
|
this.negative = 1;
|
|
return this._normSign();
|
|
}
|
|
|
|
// At this point both numbers are positive
|
|
var cmp = this.cmp(num);
|
|
|
|
// Optimization - zeroify
|
|
if (cmp === 0) {
|
|
this.negative = 0;
|
|
this.length = 1;
|
|
this.words[0] = 0;
|
|
return this;
|
|
}
|
|
|
|
// a > b
|
|
var a, b;
|
|
if (cmp > 0) {
|
|
a = this;
|
|
b = num;
|
|
} else {
|
|
a = num;
|
|
b = this;
|
|
}
|
|
|
|
var carry = 0;
|
|
for (var i = 0; i < b.length; i++) {
|
|
r = (a.words[i] | 0) - (b.words[i] | 0) + carry;
|
|
carry = r >> 26;
|
|
this.words[i] = r & 0x3ffffff;
|
|
}
|
|
for (; carry !== 0 && i < a.length; i++) {
|
|
r = (a.words[i] | 0) + carry;
|
|
carry = r >> 26;
|
|
this.words[i] = r & 0x3ffffff;
|
|
}
|
|
|
|
// Copy rest of the words
|
|
if (carry === 0 && i < a.length && a !== this) {
|
|
for (; i < a.length; i++) {
|
|
this.words[i] = a.words[i];
|
|
}
|
|
}
|
|
|
|
this.length = Math.max(this.length, i);
|
|
|
|
if (a !== this) {
|
|
this.negative = 1;
|
|
}
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
// Subtract `num` from `this`
|
|
BN.prototype.sub = function sub (num) {
|
|
return this.clone().isub(num);
|
|
};
|
|
|
|
function smallMulTo (self, num, out) {
|
|
out.negative = num.negative ^ self.negative;
|
|
var len = (self.length + num.length) | 0;
|
|
out.length = len;
|
|
len = (len - 1) | 0;
|
|
|
|
// Peel one iteration (compiler can't do it, because of code complexity)
|
|
var a = self.words[0] | 0;
|
|
var b = num.words[0] | 0;
|
|
var r = a * b;
|
|
|
|
var lo = r & 0x3ffffff;
|
|
var carry = (r / 0x4000000) | 0;
|
|
out.words[0] = lo;
|
|
|
|
for (var k = 1; k < len; k++) {
|
|
// Sum all words with the same `i + j = k` and accumulate `ncarry`,
|
|
// note that ncarry could be >= 0x3ffffff
|
|
var ncarry = carry >>> 26;
|
|
var rword = carry & 0x3ffffff;
|
|
var maxJ = Math.min(k, num.length - 1);
|
|
for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
|
|
var i = (k - j) | 0;
|
|
a = self.words[i] | 0;
|
|
b = num.words[j] | 0;
|
|
r = a * b + rword;
|
|
ncarry += (r / 0x4000000) | 0;
|
|
rword = r & 0x3ffffff;
|
|
}
|
|
out.words[k] = rword | 0;
|
|
carry = ncarry | 0;
|
|
}
|
|
if (carry !== 0) {
|
|
out.words[k] = carry | 0;
|
|
} else {
|
|
out.length--;
|
|
}
|
|
|
|
return out.strip();
|
|
}
|
|
|
|
// TODO(indutny): it may be reasonable to omit it for users who don't need
|
|
// to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit
|
|
// multiplication (like elliptic secp256k1).
|
|
var comb10MulTo = function comb10MulTo (self, num, out) {
|
|
var a = self.words;
|
|
var b = num.words;
|
|
var o = out.words;
|
|
var c = 0;
|
|
var lo;
|
|
var mid;
|
|
var hi;
|
|
var a0 = a[0] | 0;
|
|
var al0 = a0 & 0x1fff;
|
|
var ah0 = a0 >>> 13;
|
|
var a1 = a[1] | 0;
|
|
var al1 = a1 & 0x1fff;
|
|
var ah1 = a1 >>> 13;
|
|
var a2 = a[2] | 0;
|
|
var al2 = a2 & 0x1fff;
|
|
var ah2 = a2 >>> 13;
|
|
var a3 = a[3] | 0;
|
|
var al3 = a3 & 0x1fff;
|
|
var ah3 = a3 >>> 13;
|
|
var a4 = a[4] | 0;
|
|
var al4 = a4 & 0x1fff;
|
|
var ah4 = a4 >>> 13;
|
|
var a5 = a[5] | 0;
|
|
var al5 = a5 & 0x1fff;
|
|
var ah5 = a5 >>> 13;
|
|
var a6 = a[6] | 0;
|
|
var al6 = a6 & 0x1fff;
|
|
var ah6 = a6 >>> 13;
|
|
var a7 = a[7] | 0;
|
|
var al7 = a7 & 0x1fff;
|
|
var ah7 = a7 >>> 13;
|
|
var a8 = a[8] | 0;
|
|
var al8 = a8 & 0x1fff;
|
|
var ah8 = a8 >>> 13;
|
|
var a9 = a[9] | 0;
|
|
var al9 = a9 & 0x1fff;
|
|
var ah9 = a9 >>> 13;
|
|
var b0 = b[0] | 0;
|
|
var bl0 = b0 & 0x1fff;
|
|
var bh0 = b0 >>> 13;
|
|
var b1 = b[1] | 0;
|
|
var bl1 = b1 & 0x1fff;
|
|
var bh1 = b1 >>> 13;
|
|
var b2 = b[2] | 0;
|
|
var bl2 = b2 & 0x1fff;
|
|
var bh2 = b2 >>> 13;
|
|
var b3 = b[3] | 0;
|
|
var bl3 = b3 & 0x1fff;
|
|
var bh3 = b3 >>> 13;
|
|
var b4 = b[4] | 0;
|
|
var bl4 = b4 & 0x1fff;
|
|
var bh4 = b4 >>> 13;
|
|
var b5 = b[5] | 0;
|
|
var bl5 = b5 & 0x1fff;
|
|
var bh5 = b5 >>> 13;
|
|
var b6 = b[6] | 0;
|
|
var bl6 = b6 & 0x1fff;
|
|
var bh6 = b6 >>> 13;
|
|
var b7 = b[7] | 0;
|
|
var bl7 = b7 & 0x1fff;
|
|
var bh7 = b7 >>> 13;
|
|
var b8 = b[8] | 0;
|
|
var bl8 = b8 & 0x1fff;
|
|
var bh8 = b8 >>> 13;
|
|
var b9 = b[9] | 0;
|
|
var bl9 = b9 & 0x1fff;
|
|
var bh9 = b9 >>> 13;
|
|
|
|
out.negative = self.negative ^ num.negative;
|
|
out.length = 19;
|
|
/* k = 0 */
|
|
lo = Math.imul(al0, bl0);
|
|
mid = Math.imul(al0, bh0);
|
|
mid = (mid + Math.imul(ah0, bl0)) | 0;
|
|
hi = Math.imul(ah0, bh0);
|
|
var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;
|
|
w0 &= 0x3ffffff;
|
|
/* k = 1 */
|
|
lo = Math.imul(al1, bl0);
|
|
mid = Math.imul(al1, bh0);
|
|
mid = (mid + Math.imul(ah1, bl0)) | 0;
|
|
hi = Math.imul(ah1, bh0);
|
|
lo = (lo + Math.imul(al0, bl1)) | 0;
|
|
mid = (mid + Math.imul(al0, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh1)) | 0;
|
|
var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;
|
|
w1 &= 0x3ffffff;
|
|
/* k = 2 */
|
|
lo = Math.imul(al2, bl0);
|
|
mid = Math.imul(al2, bh0);
|
|
mid = (mid + Math.imul(ah2, bl0)) | 0;
|
|
hi = Math.imul(ah2, bh0);
|
|
lo = (lo + Math.imul(al1, bl1)) | 0;
|
|
mid = (mid + Math.imul(al1, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh1)) | 0;
|
|
lo = (lo + Math.imul(al0, bl2)) | 0;
|
|
mid = (mid + Math.imul(al0, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh2)) | 0;
|
|
var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;
|
|
w2 &= 0x3ffffff;
|
|
/* k = 3 */
|
|
lo = Math.imul(al3, bl0);
|
|
mid = Math.imul(al3, bh0);
|
|
mid = (mid + Math.imul(ah3, bl0)) | 0;
|
|
hi = Math.imul(ah3, bh0);
|
|
lo = (lo + Math.imul(al2, bl1)) | 0;
|
|
mid = (mid + Math.imul(al2, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh1)) | 0;
|
|
lo = (lo + Math.imul(al1, bl2)) | 0;
|
|
mid = (mid + Math.imul(al1, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh2)) | 0;
|
|
lo = (lo + Math.imul(al0, bl3)) | 0;
|
|
mid = (mid + Math.imul(al0, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh3)) | 0;
|
|
var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;
|
|
w3 &= 0x3ffffff;
|
|
/* k = 4 */
|
|
lo = Math.imul(al4, bl0);
|
|
mid = Math.imul(al4, bh0);
|
|
mid = (mid + Math.imul(ah4, bl0)) | 0;
|
|
hi = Math.imul(ah4, bh0);
|
|
lo = (lo + Math.imul(al3, bl1)) | 0;
|
|
mid = (mid + Math.imul(al3, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh1)) | 0;
|
|
lo = (lo + Math.imul(al2, bl2)) | 0;
|
|
mid = (mid + Math.imul(al2, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh2)) | 0;
|
|
lo = (lo + Math.imul(al1, bl3)) | 0;
|
|
mid = (mid + Math.imul(al1, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh3)) | 0;
|
|
lo = (lo + Math.imul(al0, bl4)) | 0;
|
|
mid = (mid + Math.imul(al0, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh4)) | 0;
|
|
var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;
|
|
w4 &= 0x3ffffff;
|
|
/* k = 5 */
|
|
lo = Math.imul(al5, bl0);
|
|
mid = Math.imul(al5, bh0);
|
|
mid = (mid + Math.imul(ah5, bl0)) | 0;
|
|
hi = Math.imul(ah5, bh0);
|
|
lo = (lo + Math.imul(al4, bl1)) | 0;
|
|
mid = (mid + Math.imul(al4, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh1)) | 0;
|
|
lo = (lo + Math.imul(al3, bl2)) | 0;
|
|
mid = (mid + Math.imul(al3, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh2)) | 0;
|
|
lo = (lo + Math.imul(al2, bl3)) | 0;
|
|
mid = (mid + Math.imul(al2, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh3)) | 0;
|
|
lo = (lo + Math.imul(al1, bl4)) | 0;
|
|
mid = (mid + Math.imul(al1, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh4)) | 0;
|
|
lo = (lo + Math.imul(al0, bl5)) | 0;
|
|
mid = (mid + Math.imul(al0, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh5)) | 0;
|
|
var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;
|
|
w5 &= 0x3ffffff;
|
|
/* k = 6 */
|
|
lo = Math.imul(al6, bl0);
|
|
mid = Math.imul(al6, bh0);
|
|
mid = (mid + Math.imul(ah6, bl0)) | 0;
|
|
hi = Math.imul(ah6, bh0);
|
|
lo = (lo + Math.imul(al5, bl1)) | 0;
|
|
mid = (mid + Math.imul(al5, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh1)) | 0;
|
|
lo = (lo + Math.imul(al4, bl2)) | 0;
|
|
mid = (mid + Math.imul(al4, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh2)) | 0;
|
|
lo = (lo + Math.imul(al3, bl3)) | 0;
|
|
mid = (mid + Math.imul(al3, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh3)) | 0;
|
|
lo = (lo + Math.imul(al2, bl4)) | 0;
|
|
mid = (mid + Math.imul(al2, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh4)) | 0;
|
|
lo = (lo + Math.imul(al1, bl5)) | 0;
|
|
mid = (mid + Math.imul(al1, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh5)) | 0;
|
|
lo = (lo + Math.imul(al0, bl6)) | 0;
|
|
mid = (mid + Math.imul(al0, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh6)) | 0;
|
|
var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;
|
|
w6 &= 0x3ffffff;
|
|
/* k = 7 */
|
|
lo = Math.imul(al7, bl0);
|
|
mid = Math.imul(al7, bh0);
|
|
mid = (mid + Math.imul(ah7, bl0)) | 0;
|
|
hi = Math.imul(ah7, bh0);
|
|
lo = (lo + Math.imul(al6, bl1)) | 0;
|
|
mid = (mid + Math.imul(al6, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh1)) | 0;
|
|
lo = (lo + Math.imul(al5, bl2)) | 0;
|
|
mid = (mid + Math.imul(al5, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh2)) | 0;
|
|
lo = (lo + Math.imul(al4, bl3)) | 0;
|
|
mid = (mid + Math.imul(al4, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh3)) | 0;
|
|
lo = (lo + Math.imul(al3, bl4)) | 0;
|
|
mid = (mid + Math.imul(al3, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh4)) | 0;
|
|
lo = (lo + Math.imul(al2, bl5)) | 0;
|
|
mid = (mid + Math.imul(al2, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh5)) | 0;
|
|
lo = (lo + Math.imul(al1, bl6)) | 0;
|
|
mid = (mid + Math.imul(al1, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh6)) | 0;
|
|
lo = (lo + Math.imul(al0, bl7)) | 0;
|
|
mid = (mid + Math.imul(al0, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh7)) | 0;
|
|
var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;
|
|
w7 &= 0x3ffffff;
|
|
/* k = 8 */
|
|
lo = Math.imul(al8, bl0);
|
|
mid = Math.imul(al8, bh0);
|
|
mid = (mid + Math.imul(ah8, bl0)) | 0;
|
|
hi = Math.imul(ah8, bh0);
|
|
lo = (lo + Math.imul(al7, bl1)) | 0;
|
|
mid = (mid + Math.imul(al7, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh1)) | 0;
|
|
lo = (lo + Math.imul(al6, bl2)) | 0;
|
|
mid = (mid + Math.imul(al6, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh2)) | 0;
|
|
lo = (lo + Math.imul(al5, bl3)) | 0;
|
|
mid = (mid + Math.imul(al5, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh3)) | 0;
|
|
lo = (lo + Math.imul(al4, bl4)) | 0;
|
|
mid = (mid + Math.imul(al4, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh4)) | 0;
|
|
lo = (lo + Math.imul(al3, bl5)) | 0;
|
|
mid = (mid + Math.imul(al3, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh5)) | 0;
|
|
lo = (lo + Math.imul(al2, bl6)) | 0;
|
|
mid = (mid + Math.imul(al2, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh6)) | 0;
|
|
lo = (lo + Math.imul(al1, bl7)) | 0;
|
|
mid = (mid + Math.imul(al1, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh7)) | 0;
|
|
lo = (lo + Math.imul(al0, bl8)) | 0;
|
|
mid = (mid + Math.imul(al0, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh8)) | 0;
|
|
var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;
|
|
w8 &= 0x3ffffff;
|
|
/* k = 9 */
|
|
lo = Math.imul(al9, bl0);
|
|
mid = Math.imul(al9, bh0);
|
|
mid = (mid + Math.imul(ah9, bl0)) | 0;
|
|
hi = Math.imul(ah9, bh0);
|
|
lo = (lo + Math.imul(al8, bl1)) | 0;
|
|
mid = (mid + Math.imul(al8, bh1)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl1)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh1)) | 0;
|
|
lo = (lo + Math.imul(al7, bl2)) | 0;
|
|
mid = (mid + Math.imul(al7, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh2)) | 0;
|
|
lo = (lo + Math.imul(al6, bl3)) | 0;
|
|
mid = (mid + Math.imul(al6, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh3)) | 0;
|
|
lo = (lo + Math.imul(al5, bl4)) | 0;
|
|
mid = (mid + Math.imul(al5, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh4)) | 0;
|
|
lo = (lo + Math.imul(al4, bl5)) | 0;
|
|
mid = (mid + Math.imul(al4, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh5)) | 0;
|
|
lo = (lo + Math.imul(al3, bl6)) | 0;
|
|
mid = (mid + Math.imul(al3, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh6)) | 0;
|
|
lo = (lo + Math.imul(al2, bl7)) | 0;
|
|
mid = (mid + Math.imul(al2, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh7)) | 0;
|
|
lo = (lo + Math.imul(al1, bl8)) | 0;
|
|
mid = (mid + Math.imul(al1, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh8)) | 0;
|
|
lo = (lo + Math.imul(al0, bl9)) | 0;
|
|
mid = (mid + Math.imul(al0, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah0, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah0, bh9)) | 0;
|
|
var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;
|
|
w9 &= 0x3ffffff;
|
|
/* k = 10 */
|
|
lo = Math.imul(al9, bl1);
|
|
mid = Math.imul(al9, bh1);
|
|
mid = (mid + Math.imul(ah9, bl1)) | 0;
|
|
hi = Math.imul(ah9, bh1);
|
|
lo = (lo + Math.imul(al8, bl2)) | 0;
|
|
mid = (mid + Math.imul(al8, bh2)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl2)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh2)) | 0;
|
|
lo = (lo + Math.imul(al7, bl3)) | 0;
|
|
mid = (mid + Math.imul(al7, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh3)) | 0;
|
|
lo = (lo + Math.imul(al6, bl4)) | 0;
|
|
mid = (mid + Math.imul(al6, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh4)) | 0;
|
|
lo = (lo + Math.imul(al5, bl5)) | 0;
|
|
mid = (mid + Math.imul(al5, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh5)) | 0;
|
|
lo = (lo + Math.imul(al4, bl6)) | 0;
|
|
mid = (mid + Math.imul(al4, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh6)) | 0;
|
|
lo = (lo + Math.imul(al3, bl7)) | 0;
|
|
mid = (mid + Math.imul(al3, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh7)) | 0;
|
|
lo = (lo + Math.imul(al2, bl8)) | 0;
|
|
mid = (mid + Math.imul(al2, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh8)) | 0;
|
|
lo = (lo + Math.imul(al1, bl9)) | 0;
|
|
mid = (mid + Math.imul(al1, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah1, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah1, bh9)) | 0;
|
|
var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;
|
|
w10 &= 0x3ffffff;
|
|
/* k = 11 */
|
|
lo = Math.imul(al9, bl2);
|
|
mid = Math.imul(al9, bh2);
|
|
mid = (mid + Math.imul(ah9, bl2)) | 0;
|
|
hi = Math.imul(ah9, bh2);
|
|
lo = (lo + Math.imul(al8, bl3)) | 0;
|
|
mid = (mid + Math.imul(al8, bh3)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl3)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh3)) | 0;
|
|
lo = (lo + Math.imul(al7, bl4)) | 0;
|
|
mid = (mid + Math.imul(al7, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh4)) | 0;
|
|
lo = (lo + Math.imul(al6, bl5)) | 0;
|
|
mid = (mid + Math.imul(al6, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh5)) | 0;
|
|
lo = (lo + Math.imul(al5, bl6)) | 0;
|
|
mid = (mid + Math.imul(al5, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh6)) | 0;
|
|
lo = (lo + Math.imul(al4, bl7)) | 0;
|
|
mid = (mid + Math.imul(al4, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh7)) | 0;
|
|
lo = (lo + Math.imul(al3, bl8)) | 0;
|
|
mid = (mid + Math.imul(al3, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh8)) | 0;
|
|
lo = (lo + Math.imul(al2, bl9)) | 0;
|
|
mid = (mid + Math.imul(al2, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah2, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah2, bh9)) | 0;
|
|
var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;
|
|
w11 &= 0x3ffffff;
|
|
/* k = 12 */
|
|
lo = Math.imul(al9, bl3);
|
|
mid = Math.imul(al9, bh3);
|
|
mid = (mid + Math.imul(ah9, bl3)) | 0;
|
|
hi = Math.imul(ah9, bh3);
|
|
lo = (lo + Math.imul(al8, bl4)) | 0;
|
|
mid = (mid + Math.imul(al8, bh4)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl4)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh4)) | 0;
|
|
lo = (lo + Math.imul(al7, bl5)) | 0;
|
|
mid = (mid + Math.imul(al7, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh5)) | 0;
|
|
lo = (lo + Math.imul(al6, bl6)) | 0;
|
|
mid = (mid + Math.imul(al6, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh6)) | 0;
|
|
lo = (lo + Math.imul(al5, bl7)) | 0;
|
|
mid = (mid + Math.imul(al5, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh7)) | 0;
|
|
lo = (lo + Math.imul(al4, bl8)) | 0;
|
|
mid = (mid + Math.imul(al4, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh8)) | 0;
|
|
lo = (lo + Math.imul(al3, bl9)) | 0;
|
|
mid = (mid + Math.imul(al3, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah3, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah3, bh9)) | 0;
|
|
var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;
|
|
w12 &= 0x3ffffff;
|
|
/* k = 13 */
|
|
lo = Math.imul(al9, bl4);
|
|
mid = Math.imul(al9, bh4);
|
|
mid = (mid + Math.imul(ah9, bl4)) | 0;
|
|
hi = Math.imul(ah9, bh4);
|
|
lo = (lo + Math.imul(al8, bl5)) | 0;
|
|
mid = (mid + Math.imul(al8, bh5)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl5)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh5)) | 0;
|
|
lo = (lo + Math.imul(al7, bl6)) | 0;
|
|
mid = (mid + Math.imul(al7, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh6)) | 0;
|
|
lo = (lo + Math.imul(al6, bl7)) | 0;
|
|
mid = (mid + Math.imul(al6, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh7)) | 0;
|
|
lo = (lo + Math.imul(al5, bl8)) | 0;
|
|
mid = (mid + Math.imul(al5, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh8)) | 0;
|
|
lo = (lo + Math.imul(al4, bl9)) | 0;
|
|
mid = (mid + Math.imul(al4, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah4, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah4, bh9)) | 0;
|
|
var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;
|
|
w13 &= 0x3ffffff;
|
|
/* k = 14 */
|
|
lo = Math.imul(al9, bl5);
|
|
mid = Math.imul(al9, bh5);
|
|
mid = (mid + Math.imul(ah9, bl5)) | 0;
|
|
hi = Math.imul(ah9, bh5);
|
|
lo = (lo + Math.imul(al8, bl6)) | 0;
|
|
mid = (mid + Math.imul(al8, bh6)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl6)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh6)) | 0;
|
|
lo = (lo + Math.imul(al7, bl7)) | 0;
|
|
mid = (mid + Math.imul(al7, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh7)) | 0;
|
|
lo = (lo + Math.imul(al6, bl8)) | 0;
|
|
mid = (mid + Math.imul(al6, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh8)) | 0;
|
|
lo = (lo + Math.imul(al5, bl9)) | 0;
|
|
mid = (mid + Math.imul(al5, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah5, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah5, bh9)) | 0;
|
|
var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;
|
|
w14 &= 0x3ffffff;
|
|
/* k = 15 */
|
|
lo = Math.imul(al9, bl6);
|
|
mid = Math.imul(al9, bh6);
|
|
mid = (mid + Math.imul(ah9, bl6)) | 0;
|
|
hi = Math.imul(ah9, bh6);
|
|
lo = (lo + Math.imul(al8, bl7)) | 0;
|
|
mid = (mid + Math.imul(al8, bh7)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl7)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh7)) | 0;
|
|
lo = (lo + Math.imul(al7, bl8)) | 0;
|
|
mid = (mid + Math.imul(al7, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh8)) | 0;
|
|
lo = (lo + Math.imul(al6, bl9)) | 0;
|
|
mid = (mid + Math.imul(al6, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah6, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah6, bh9)) | 0;
|
|
var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;
|
|
w15 &= 0x3ffffff;
|
|
/* k = 16 */
|
|
lo = Math.imul(al9, bl7);
|
|
mid = Math.imul(al9, bh7);
|
|
mid = (mid + Math.imul(ah9, bl7)) | 0;
|
|
hi = Math.imul(ah9, bh7);
|
|
lo = (lo + Math.imul(al8, bl8)) | 0;
|
|
mid = (mid + Math.imul(al8, bh8)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl8)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh8)) | 0;
|
|
lo = (lo + Math.imul(al7, bl9)) | 0;
|
|
mid = (mid + Math.imul(al7, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah7, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah7, bh9)) | 0;
|
|
var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;
|
|
w16 &= 0x3ffffff;
|
|
/* k = 17 */
|
|
lo = Math.imul(al9, bl8);
|
|
mid = Math.imul(al9, bh8);
|
|
mid = (mid + Math.imul(ah9, bl8)) | 0;
|
|
hi = Math.imul(ah9, bh8);
|
|
lo = (lo + Math.imul(al8, bl9)) | 0;
|
|
mid = (mid + Math.imul(al8, bh9)) | 0;
|
|
mid = (mid + Math.imul(ah8, bl9)) | 0;
|
|
hi = (hi + Math.imul(ah8, bh9)) | 0;
|
|
var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;
|
|
w17 &= 0x3ffffff;
|
|
/* k = 18 */
|
|
lo = Math.imul(al9, bl9);
|
|
mid = Math.imul(al9, bh9);
|
|
mid = (mid + Math.imul(ah9, bl9)) | 0;
|
|
hi = Math.imul(ah9, bh9);
|
|
var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
|
|
c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;
|
|
w18 &= 0x3ffffff;
|
|
o[0] = w0;
|
|
o[1] = w1;
|
|
o[2] = w2;
|
|
o[3] = w3;
|
|
o[4] = w4;
|
|
o[5] = w5;
|
|
o[6] = w6;
|
|
o[7] = w7;
|
|
o[8] = w8;
|
|
o[9] = w9;
|
|
o[10] = w10;
|
|
o[11] = w11;
|
|
o[12] = w12;
|
|
o[13] = w13;
|
|
o[14] = w14;
|
|
o[15] = w15;
|
|
o[16] = w16;
|
|
o[17] = w17;
|
|
o[18] = w18;
|
|
if (c !== 0) {
|
|
o[19] = c;
|
|
out.length++;
|
|
}
|
|
return out;
|
|
};
|
|
|
|
// Polyfill comb
|
|
if (!Math.imul) {
|
|
comb10MulTo = smallMulTo;
|
|
}
|
|
|
|
function bigMulTo (self, num, out) {
|
|
out.negative = num.negative ^ self.negative;
|
|
out.length = self.length + num.length;
|
|
|
|
var carry = 0;
|
|
var hncarry = 0;
|
|
for (var k = 0; k < out.length - 1; k++) {
|
|
// Sum all words with the same `i + j = k` and accumulate `ncarry`,
|
|
// note that ncarry could be >= 0x3ffffff
|
|
var ncarry = hncarry;
|
|
hncarry = 0;
|
|
var rword = carry & 0x3ffffff;
|
|
var maxJ = Math.min(k, num.length - 1);
|
|
for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
|
|
var i = k - j;
|
|
var a = self.words[i] | 0;
|
|
var b = num.words[j] | 0;
|
|
var r = a * b;
|
|
|
|
var lo = r & 0x3ffffff;
|
|
ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;
|
|
lo = (lo + rword) | 0;
|
|
rword = lo & 0x3ffffff;
|
|
ncarry = (ncarry + (lo >>> 26)) | 0;
|
|
|
|
hncarry += ncarry >>> 26;
|
|
ncarry &= 0x3ffffff;
|
|
}
|
|
out.words[k] = rword;
|
|
carry = ncarry;
|
|
ncarry = hncarry;
|
|
}
|
|
if (carry !== 0) {
|
|
out.words[k] = carry;
|
|
} else {
|
|
out.length--;
|
|
}
|
|
|
|
return out.strip();
|
|
}
|
|
|
|
function jumboMulTo (self, num, out) {
|
|
var fftm = new FFTM();
|
|
return fftm.mulp(self, num, out);
|
|
}
|
|
|
|
BN.prototype.mulTo = function mulTo (num, out) {
|
|
var res;
|
|
var len = this.length + num.length;
|
|
if (this.length === 10 && num.length === 10) {
|
|
res = comb10MulTo(this, num, out);
|
|
} else if (len < 63) {
|
|
res = smallMulTo(this, num, out);
|
|
} else if (len < 1024) {
|
|
res = bigMulTo(this, num, out);
|
|
} else {
|
|
res = jumboMulTo(this, num, out);
|
|
}
|
|
|
|
return res;
|
|
};
|
|
|
|
// Cooley-Tukey algorithm for FFT
|
|
// slightly revisited to rely on looping instead of recursion
|
|
|
|
function FFTM (x, y) {
|
|
this.x = x;
|
|
this.y = y;
|
|
}
|
|
|
|
FFTM.prototype.makeRBT = function makeRBT (N) {
|
|
var t = new Array(N);
|
|
var l = BN.prototype._countBits(N) - 1;
|
|
for (var i = 0; i < N; i++) {
|
|
t[i] = this.revBin(i, l, N);
|
|
}
|
|
|
|
return t;
|
|
};
|
|
|
|
// Returns binary-reversed representation of `x`
|
|
FFTM.prototype.revBin = function revBin (x, l, N) {
|
|
if (x === 0 || x === N - 1) return x;
|
|
|
|
var rb = 0;
|
|
for (var i = 0; i < l; i++) {
|
|
rb |= (x & 1) << (l - i - 1);
|
|
x >>= 1;
|
|
}
|
|
|
|
return rb;
|
|
};
|
|
|
|
// Performs "tweedling" phase, therefore 'emulating'
|
|
// behaviour of the recursive algorithm
|
|
FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {
|
|
for (var i = 0; i < N; i++) {
|
|
rtws[i] = rws[rbt[i]];
|
|
itws[i] = iws[rbt[i]];
|
|
}
|
|
};
|
|
|
|
FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {
|
|
this.permute(rbt, rws, iws, rtws, itws, N);
|
|
|
|
for (var s = 1; s < N; s <<= 1) {
|
|
var l = s << 1;
|
|
|
|
var rtwdf = Math.cos(2 * Math.PI / l);
|
|
var itwdf = Math.sin(2 * Math.PI / l);
|
|
|
|
for (var p = 0; p < N; p += l) {
|
|
var rtwdf_ = rtwdf;
|
|
var itwdf_ = itwdf;
|
|
|
|
for (var j = 0; j < s; j++) {
|
|
var re = rtws[p + j];
|
|
var ie = itws[p + j];
|
|
|
|
var ro = rtws[p + j + s];
|
|
var io = itws[p + j + s];
|
|
|
|
var rx = rtwdf_ * ro - itwdf_ * io;
|
|
|
|
io = rtwdf_ * io + itwdf_ * ro;
|
|
ro = rx;
|
|
|
|
rtws[p + j] = re + ro;
|
|
itws[p + j] = ie + io;
|
|
|
|
rtws[p + j + s] = re - ro;
|
|
itws[p + j + s] = ie - io;
|
|
|
|
/* jshint maxdepth : false */
|
|
if (j !== l) {
|
|
rx = rtwdf * rtwdf_ - itwdf * itwdf_;
|
|
|
|
itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;
|
|
rtwdf_ = rx;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
};
|
|
|
|
FFTM.prototype.guessLen13b = function guessLen13b (n, m) {
|
|
var N = Math.max(m, n) | 1;
|
|
var odd = N & 1;
|
|
var i = 0;
|
|
for (N = N / 2 | 0; N; N = N >>> 1) {
|
|
i++;
|
|
}
|
|
|
|
return 1 << i + 1 + odd;
|
|
};
|
|
|
|
FFTM.prototype.conjugate = function conjugate (rws, iws, N) {
|
|
if (N <= 1) return;
|
|
|
|
for (var i = 0; i < N / 2; i++) {
|
|
var t = rws[i];
|
|
|
|
rws[i] = rws[N - i - 1];
|
|
rws[N - i - 1] = t;
|
|
|
|
t = iws[i];
|
|
|
|
iws[i] = -iws[N - i - 1];
|
|
iws[N - i - 1] = -t;
|
|
}
|
|
};
|
|
|
|
FFTM.prototype.normalize13b = function normalize13b (ws, N) {
|
|
var carry = 0;
|
|
for (var i = 0; i < N / 2; i++) {
|
|
var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +
|
|
Math.round(ws[2 * i] / N) +
|
|
carry;
|
|
|
|
ws[i] = w & 0x3ffffff;
|
|
|
|
if (w < 0x4000000) {
|
|
carry = 0;
|
|
} else {
|
|
carry = w / 0x4000000 | 0;
|
|
}
|
|
}
|
|
|
|
return ws;
|
|
};
|
|
|
|
FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {
|
|
var carry = 0;
|
|
for (var i = 0; i < len; i++) {
|
|
carry = carry + (ws[i] | 0);
|
|
|
|
rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;
|
|
rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;
|
|
}
|
|
|
|
// Pad with zeroes
|
|
for (i = 2 * len; i < N; ++i) {
|
|
rws[i] = 0;
|
|
}
|
|
|
|
assert(carry === 0);
|
|
assert((carry & ~0x1fff) === 0);
|
|
};
|
|
|
|
FFTM.prototype.stub = function stub (N) {
|
|
var ph = new Array(N);
|
|
for (var i = 0; i < N; i++) {
|
|
ph[i] = 0;
|
|
}
|
|
|
|
return ph;
|
|
};
|
|
|
|
FFTM.prototype.mulp = function mulp (x, y, out) {
|
|
var N = 2 * this.guessLen13b(x.length, y.length);
|
|
|
|
var rbt = this.makeRBT(N);
|
|
|
|
var _ = this.stub(N);
|
|
|
|
var rws = new Array(N);
|
|
var rwst = new Array(N);
|
|
var iwst = new Array(N);
|
|
|
|
var nrws = new Array(N);
|
|
var nrwst = new Array(N);
|
|
var niwst = new Array(N);
|
|
|
|
var rmws = out.words;
|
|
rmws.length = N;
|
|
|
|
this.convert13b(x.words, x.length, rws, N);
|
|
this.convert13b(y.words, y.length, nrws, N);
|
|
|
|
this.transform(rws, _, rwst, iwst, N, rbt);
|
|
this.transform(nrws, _, nrwst, niwst, N, rbt);
|
|
|
|
for (var i = 0; i < N; i++) {
|
|
var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];
|
|
iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];
|
|
rwst[i] = rx;
|
|
}
|
|
|
|
this.conjugate(rwst, iwst, N);
|
|
this.transform(rwst, iwst, rmws, _, N, rbt);
|
|
this.conjugate(rmws, _, N);
|
|
this.normalize13b(rmws, N);
|
|
|
|
out.negative = x.negative ^ y.negative;
|
|
out.length = x.length + y.length;
|
|
return out.strip();
|
|
};
|
|
|
|
// Multiply `this` by `num`
|
|
BN.prototype.mul = function mul (num) {
|
|
var out = new BN(null);
|
|
out.words = new Array(this.length + num.length);
|
|
return this.mulTo(num, out);
|
|
};
|
|
|
|
// Multiply employing FFT
|
|
BN.prototype.mulf = function mulf (num) {
|
|
var out = new BN(null);
|
|
out.words = new Array(this.length + num.length);
|
|
return jumboMulTo(this, num, out);
|
|
};
|
|
|
|
// In-place Multiplication
|
|
BN.prototype.imul = function imul (num) {
|
|
return this.clone().mulTo(num, this);
|
|
};
|
|
|
|
BN.prototype.imuln = function imuln (num) {
|
|
assert(typeof num === 'number');
|
|
assert(num < 0x4000000);
|
|
|
|
// Carry
|
|
var carry = 0;
|
|
for (var i = 0; i < this.length; i++) {
|
|
var w = (this.words[i] | 0) * num;
|
|
var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);
|
|
carry >>= 26;
|
|
carry += (w / 0x4000000) | 0;
|
|
// NOTE: lo is 27bit maximum
|
|
carry += lo >>> 26;
|
|
this.words[i] = lo & 0x3ffffff;
|
|
}
|
|
|
|
if (carry !== 0) {
|
|
this.words[i] = carry;
|
|
this.length++;
|
|
}
|
|
|
|
return this;
|
|
};
|
|
|
|
BN.prototype.muln = function muln (num) {
|
|
return this.clone().imuln(num);
|
|
};
|
|
|
|
// `this` * `this`
|
|
BN.prototype.sqr = function sqr () {
|
|
return this.mul(this);
|
|
};
|
|
|
|
// `this` * `this` in-place
|
|
BN.prototype.isqr = function isqr () {
|
|
return this.imul(this.clone());
|
|
};
|
|
|
|
// Math.pow(`this`, `num`)
|
|
BN.prototype.pow = function pow (num) {
|
|
var w = toBitArray(num);
|
|
if (w.length === 0) return new BN(1);
|
|
|
|
// Skip leading zeroes
|
|
var res = this;
|
|
for (var i = 0; i < w.length; i++, res = res.sqr()) {
|
|
if (w[i] !== 0) break;
|
|
}
|
|
|
|
if (++i < w.length) {
|
|
for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {
|
|
if (w[i] === 0) continue;
|
|
|
|
res = res.mul(q);
|
|
}
|
|
}
|
|
|
|
return res;
|
|
};
|
|
|
|
// Shift-left in-place
|
|
BN.prototype.iushln = function iushln (bits) {
|
|
assert(typeof bits === 'number' && bits >= 0);
|
|
var r = bits % 26;
|
|
var s = (bits - r) / 26;
|
|
var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);
|
|
var i;
|
|
|
|
if (r !== 0) {
|
|
var carry = 0;
|
|
|
|
for (i = 0; i < this.length; i++) {
|
|
var newCarry = this.words[i] & carryMask;
|
|
var c = ((this.words[i] | 0) - newCarry) << r;
|
|
this.words[i] = c | carry;
|
|
carry = newCarry >>> (26 - r);
|
|
}
|
|
|
|
if (carry) {
|
|
this.words[i] = carry;
|
|
this.length++;
|
|
}
|
|
}
|
|
|
|
if (s !== 0) {
|
|
for (i = this.length - 1; i >= 0; i--) {
|
|
this.words[i + s] = this.words[i];
|
|
}
|
|
|
|
for (i = 0; i < s; i++) {
|
|
this.words[i] = 0;
|
|
}
|
|
|
|
this.length += s;
|
|
}
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype.ishln = function ishln (bits) {
|
|
// TODO(indutny): implement me
|
|
assert(this.negative === 0);
|
|
return this.iushln(bits);
|
|
};
|
|
|
|
// Shift-right in-place
|
|
// NOTE: `hint` is a lowest bit before trailing zeroes
|
|
// NOTE: if `extended` is present - it will be filled with destroyed bits
|
|
BN.prototype.iushrn = function iushrn (bits, hint, extended) {
|
|
assert(typeof bits === 'number' && bits >= 0);
|
|
var h;
|
|
if (hint) {
|
|
h = (hint - (hint % 26)) / 26;
|
|
} else {
|
|
h = 0;
|
|
}
|
|
|
|
var r = bits % 26;
|
|
var s = Math.min((bits - r) / 26, this.length);
|
|
var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);
|
|
var maskedWords = extended;
|
|
|
|
h -= s;
|
|
h = Math.max(0, h);
|
|
|
|
// Extended mode, copy masked part
|
|
if (maskedWords) {
|
|
for (var i = 0; i < s; i++) {
|
|
maskedWords.words[i] = this.words[i];
|
|
}
|
|
maskedWords.length = s;
|
|
}
|
|
|
|
if (s === 0) ; else if (this.length > s) {
|
|
this.length -= s;
|
|
for (i = 0; i < this.length; i++) {
|
|
this.words[i] = this.words[i + s];
|
|
}
|
|
} else {
|
|
this.words[0] = 0;
|
|
this.length = 1;
|
|
}
|
|
|
|
var carry = 0;
|
|
for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {
|
|
var word = this.words[i] | 0;
|
|
this.words[i] = (carry << (26 - r)) | (word >>> r);
|
|
carry = word & mask;
|
|
}
|
|
|
|
// Push carried bits as a mask
|
|
if (maskedWords && carry !== 0) {
|
|
maskedWords.words[maskedWords.length++] = carry;
|
|
}
|
|
|
|
if (this.length === 0) {
|
|
this.words[0] = 0;
|
|
this.length = 1;
|
|
}
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype.ishrn = function ishrn (bits, hint, extended) {
|
|
// TODO(indutny): implement me
|
|
assert(this.negative === 0);
|
|
return this.iushrn(bits, hint, extended);
|
|
};
|
|
|
|
// Shift-left
|
|
BN.prototype.shln = function shln (bits) {
|
|
return this.clone().ishln(bits);
|
|
};
|
|
|
|
BN.prototype.ushln = function ushln (bits) {
|
|
return this.clone().iushln(bits);
|
|
};
|
|
|
|
// Shift-right
|
|
BN.prototype.shrn = function shrn (bits) {
|
|
return this.clone().ishrn(bits);
|
|
};
|
|
|
|
BN.prototype.ushrn = function ushrn (bits) {
|
|
return this.clone().iushrn(bits);
|
|
};
|
|
|
|
// Test if n bit is set
|
|
BN.prototype.testn = function testn (bit) {
|
|
assert(typeof bit === 'number' && bit >= 0);
|
|
var r = bit % 26;
|
|
var s = (bit - r) / 26;
|
|
var q = 1 << r;
|
|
|
|
// Fast case: bit is much higher than all existing words
|
|
if (this.length <= s) return false;
|
|
|
|
// Check bit and return
|
|
var w = this.words[s];
|
|
|
|
return !!(w & q);
|
|
};
|
|
|
|
// Return only lowers bits of number (in-place)
|
|
BN.prototype.imaskn = function imaskn (bits) {
|
|
assert(typeof bits === 'number' && bits >= 0);
|
|
var r = bits % 26;
|
|
var s = (bits - r) / 26;
|
|
|
|
assert(this.negative === 0, 'imaskn works only with positive numbers');
|
|
|
|
if (this.length <= s) {
|
|
return this;
|
|
}
|
|
|
|
if (r !== 0) {
|
|
s++;
|
|
}
|
|
this.length = Math.min(s, this.length);
|
|
|
|
if (r !== 0) {
|
|
var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);
|
|
this.words[this.length - 1] &= mask;
|
|
}
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
// Return only lowers bits of number
|
|
BN.prototype.maskn = function maskn (bits) {
|
|
return this.clone().imaskn(bits);
|
|
};
|
|
|
|
// Add plain number `num` to `this`
|
|
BN.prototype.iaddn = function iaddn (num) {
|
|
assert(typeof num === 'number');
|
|
assert(num < 0x4000000);
|
|
if (num < 0) return this.isubn(-num);
|
|
|
|
// Possible sign change
|
|
if (this.negative !== 0) {
|
|
if (this.length === 1 && (this.words[0] | 0) < num) {
|
|
this.words[0] = num - (this.words[0] | 0);
|
|
this.negative = 0;
|
|
return this;
|
|
}
|
|
|
|
this.negative = 0;
|
|
this.isubn(num);
|
|
this.negative = 1;
|
|
return this;
|
|
}
|
|
|
|
// Add without checks
|
|
return this._iaddn(num);
|
|
};
|
|
|
|
BN.prototype._iaddn = function _iaddn (num) {
|
|
this.words[0] += num;
|
|
|
|
// Carry
|
|
for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {
|
|
this.words[i] -= 0x4000000;
|
|
if (i === this.length - 1) {
|
|
this.words[i + 1] = 1;
|
|
} else {
|
|
this.words[i + 1]++;
|
|
}
|
|
}
|
|
this.length = Math.max(this.length, i + 1);
|
|
|
|
return this;
|
|
};
|
|
|
|
// Subtract plain number `num` from `this`
|
|
BN.prototype.isubn = function isubn (num) {
|
|
assert(typeof num === 'number');
|
|
assert(num < 0x4000000);
|
|
if (num < 0) return this.iaddn(-num);
|
|
|
|
if (this.negative !== 0) {
|
|
this.negative = 0;
|
|
this.iaddn(num);
|
|
this.negative = 1;
|
|
return this;
|
|
}
|
|
|
|
this.words[0] -= num;
|
|
|
|
if (this.length === 1 && this.words[0] < 0) {
|
|
this.words[0] = -this.words[0];
|
|
this.negative = 1;
|
|
} else {
|
|
// Carry
|
|
for (var i = 0; i < this.length && this.words[i] < 0; i++) {
|
|
this.words[i] += 0x4000000;
|
|
this.words[i + 1] -= 1;
|
|
}
|
|
}
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype.addn = function addn (num) {
|
|
return this.clone().iaddn(num);
|
|
};
|
|
|
|
BN.prototype.subn = function subn (num) {
|
|
return this.clone().isubn(num);
|
|
};
|
|
|
|
BN.prototype.iabs = function iabs () {
|
|
this.negative = 0;
|
|
|
|
return this;
|
|
};
|
|
|
|
BN.prototype.abs = function abs () {
|
|
return this.clone().iabs();
|
|
};
|
|
|
|
BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {
|
|
var len = num.length + shift;
|
|
var i;
|
|
|
|
this._expand(len);
|
|
|
|
var w;
|
|
var carry = 0;
|
|
for (i = 0; i < num.length; i++) {
|
|
w = (this.words[i + shift] | 0) + carry;
|
|
var right = (num.words[i] | 0) * mul;
|
|
w -= right & 0x3ffffff;
|
|
carry = (w >> 26) - ((right / 0x4000000) | 0);
|
|
this.words[i + shift] = w & 0x3ffffff;
|
|
}
|
|
for (; i < this.length - shift; i++) {
|
|
w = (this.words[i + shift] | 0) + carry;
|
|
carry = w >> 26;
|
|
this.words[i + shift] = w & 0x3ffffff;
|
|
}
|
|
|
|
if (carry === 0) return this.strip();
|
|
|
|
// Subtraction overflow
|
|
assert(carry === -1);
|
|
carry = 0;
|
|
for (i = 0; i < this.length; i++) {
|
|
w = -(this.words[i] | 0) + carry;
|
|
carry = w >> 26;
|
|
this.words[i] = w & 0x3ffffff;
|
|
}
|
|
this.negative = 1;
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype._wordDiv = function _wordDiv (num, mode) {
|
|
var shift = this.length - num.length;
|
|
|
|
var a = this.clone();
|
|
var b = num;
|
|
|
|
// Normalize
|
|
var bhi = b.words[b.length - 1] | 0;
|
|
var bhiBits = this._countBits(bhi);
|
|
shift = 26 - bhiBits;
|
|
if (shift !== 0) {
|
|
b = b.ushln(shift);
|
|
a.iushln(shift);
|
|
bhi = b.words[b.length - 1] | 0;
|
|
}
|
|
|
|
// Initialize quotient
|
|
var m = a.length - b.length;
|
|
var q;
|
|
|
|
if (mode !== 'mod') {
|
|
q = new BN(null);
|
|
q.length = m + 1;
|
|
q.words = new Array(q.length);
|
|
for (var i = 0; i < q.length; i++) {
|
|
q.words[i] = 0;
|
|
}
|
|
}
|
|
|
|
var diff = a.clone()._ishlnsubmul(b, 1, m);
|
|
if (diff.negative === 0) {
|
|
a = diff;
|
|
if (q) {
|
|
q.words[m] = 1;
|
|
}
|
|
}
|
|
|
|
for (var j = m - 1; j >= 0; j--) {
|
|
var qj = (a.words[b.length + j] | 0) * 0x4000000 +
|
|
(a.words[b.length + j - 1] | 0);
|
|
|
|
// NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max
|
|
// (0x7ffffff)
|
|
qj = Math.min((qj / bhi) | 0, 0x3ffffff);
|
|
|
|
a._ishlnsubmul(b, qj, j);
|
|
while (a.negative !== 0) {
|
|
qj--;
|
|
a.negative = 0;
|
|
a._ishlnsubmul(b, 1, j);
|
|
if (!a.isZero()) {
|
|
a.negative ^= 1;
|
|
}
|
|
}
|
|
if (q) {
|
|
q.words[j] = qj;
|
|
}
|
|
}
|
|
if (q) {
|
|
q.strip();
|
|
}
|
|
a.strip();
|
|
|
|
// Denormalize
|
|
if (mode !== 'div' && shift !== 0) {
|
|
a.iushrn(shift);
|
|
}
|
|
|
|
return {
|
|
div: q || null,
|
|
mod: a
|
|
};
|
|
};
|
|
|
|
// NOTE: 1) `mode` can be set to `mod` to request mod only,
|
|
// to `div` to request div only, or be absent to
|
|
// request both div & mod
|
|
// 2) `positive` is true if unsigned mod is requested
|
|
BN.prototype.divmod = function divmod (num, mode, positive) {
|
|
assert(!num.isZero());
|
|
|
|
if (this.isZero()) {
|
|
return {
|
|
div: new BN(0),
|
|
mod: new BN(0)
|
|
};
|
|
}
|
|
|
|
var div, mod, res;
|
|
if (this.negative !== 0 && num.negative === 0) {
|
|
res = this.neg().divmod(num, mode);
|
|
|
|
if (mode !== 'mod') {
|
|
div = res.div.neg();
|
|
}
|
|
|
|
if (mode !== 'div') {
|
|
mod = res.mod.neg();
|
|
if (positive && mod.negative !== 0) {
|
|
mod.iadd(num);
|
|
}
|
|
}
|
|
|
|
return {
|
|
div: div,
|
|
mod: mod
|
|
};
|
|
}
|
|
|
|
if (this.negative === 0 && num.negative !== 0) {
|
|
res = this.divmod(num.neg(), mode);
|
|
|
|
if (mode !== 'mod') {
|
|
div = res.div.neg();
|
|
}
|
|
|
|
return {
|
|
div: div,
|
|
mod: res.mod
|
|
};
|
|
}
|
|
|
|
if ((this.negative & num.negative) !== 0) {
|
|
res = this.neg().divmod(num.neg(), mode);
|
|
|
|
if (mode !== 'div') {
|
|
mod = res.mod.neg();
|
|
if (positive && mod.negative !== 0) {
|
|
mod.isub(num);
|
|
}
|
|
}
|
|
|
|
return {
|
|
div: res.div,
|
|
mod: mod
|
|
};
|
|
}
|
|
|
|
// Both numbers are positive at this point
|
|
|
|
// Strip both numbers to approximate shift value
|
|
if (num.length > this.length || this.cmp(num) < 0) {
|
|
return {
|
|
div: new BN(0),
|
|
mod: this
|
|
};
|
|
}
|
|
|
|
// Very short reduction
|
|
if (num.length === 1) {
|
|
if (mode === 'div') {
|
|
return {
|
|
div: this.divn(num.words[0]),
|
|
mod: null
|
|
};
|
|
}
|
|
|
|
if (mode === 'mod') {
|
|
return {
|
|
div: null,
|
|
mod: new BN(this.modn(num.words[0]))
|
|
};
|
|
}
|
|
|
|
return {
|
|
div: this.divn(num.words[0]),
|
|
mod: new BN(this.modn(num.words[0]))
|
|
};
|
|
}
|
|
|
|
return this._wordDiv(num, mode);
|
|
};
|
|
|
|
// Find `this` / `num`
|
|
BN.prototype.div = function div (num) {
|
|
return this.divmod(num, 'div', false).div;
|
|
};
|
|
|
|
// Find `this` % `num`
|
|
BN.prototype.mod = function mod (num) {
|
|
return this.divmod(num, 'mod', false).mod;
|
|
};
|
|
|
|
BN.prototype.umod = function umod (num) {
|
|
return this.divmod(num, 'mod', true).mod;
|
|
};
|
|
|
|
// Find Round(`this` / `num`)
|
|
BN.prototype.divRound = function divRound (num) {
|
|
var dm = this.divmod(num);
|
|
|
|
// Fast case - exact division
|
|
if (dm.mod.isZero()) return dm.div;
|
|
|
|
var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;
|
|
|
|
var half = num.ushrn(1);
|
|
var r2 = num.andln(1);
|
|
var cmp = mod.cmp(half);
|
|
|
|
// Round down
|
|
if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;
|
|
|
|
// Round up
|
|
return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);
|
|
};
|
|
|
|
BN.prototype.modn = function modn (num) {
|
|
assert(num <= 0x3ffffff);
|
|
var p = (1 << 26) % num;
|
|
|
|
var acc = 0;
|
|
for (var i = this.length - 1; i >= 0; i--) {
|
|
acc = (p * acc + (this.words[i] | 0)) % num;
|
|
}
|
|
|
|
return acc;
|
|
};
|
|
|
|
// In-place division by number
|
|
BN.prototype.idivn = function idivn (num) {
|
|
assert(num <= 0x3ffffff);
|
|
|
|
var carry = 0;
|
|
for (var i = this.length - 1; i >= 0; i--) {
|
|
var w = (this.words[i] | 0) + carry * 0x4000000;
|
|
this.words[i] = (w / num) | 0;
|
|
carry = w % num;
|
|
}
|
|
|
|
return this.strip();
|
|
};
|
|
|
|
BN.prototype.divn = function divn (num) {
|
|
return this.clone().idivn(num);
|
|
};
|
|
|
|
BN.prototype.egcd = function egcd (p) {
|
|
assert(p.negative === 0);
|
|
assert(!p.isZero());
|
|
|
|
var x = this;
|
|
var y = p.clone();
|
|
|
|
if (x.negative !== 0) {
|
|
x = x.umod(p);
|
|
} else {
|
|
x = x.clone();
|
|
}
|
|
|
|
// A * x + B * y = x
|
|
var A = new BN(1);
|
|
var B = new BN(0);
|
|
|
|
// C * x + D * y = y
|
|
var C = new BN(0);
|
|
var D = new BN(1);
|
|
|
|
var g = 0;
|
|
|
|
while (x.isEven() && y.isEven()) {
|
|
x.iushrn(1);
|
|
y.iushrn(1);
|
|
++g;
|
|
}
|
|
|
|
var yp = y.clone();
|
|
var xp = x.clone();
|
|
|
|
while (!x.isZero()) {
|
|
for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);
|
|
if (i > 0) {
|
|
x.iushrn(i);
|
|
while (i-- > 0) {
|
|
if (A.isOdd() || B.isOdd()) {
|
|
A.iadd(yp);
|
|
B.isub(xp);
|
|
}
|
|
|
|
A.iushrn(1);
|
|
B.iushrn(1);
|
|
}
|
|
}
|
|
|
|
for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);
|
|
if (j > 0) {
|
|
y.iushrn(j);
|
|
while (j-- > 0) {
|
|
if (C.isOdd() || D.isOdd()) {
|
|
C.iadd(yp);
|
|
D.isub(xp);
|
|
}
|
|
|
|
C.iushrn(1);
|
|
D.iushrn(1);
|
|
}
|
|
}
|
|
|
|
if (x.cmp(y) >= 0) {
|
|
x.isub(y);
|
|
A.isub(C);
|
|
B.isub(D);
|
|
} else {
|
|
y.isub(x);
|
|
C.isub(A);
|
|
D.isub(B);
|
|
}
|
|
}
|
|
|
|
return {
|
|
a: C,
|
|
b: D,
|
|
gcd: y.iushln(g)
|
|
};
|
|
};
|
|
|
|
// This is reduced incarnation of the binary EEA
|
|
// above, designated to invert members of the
|
|
// _prime_ fields F(p) at a maximal speed
|
|
BN.prototype._invmp = function _invmp (p) {
|
|
assert(p.negative === 0);
|
|
assert(!p.isZero());
|
|
|
|
var a = this;
|
|
var b = p.clone();
|
|
|
|
if (a.negative !== 0) {
|
|
a = a.umod(p);
|
|
} else {
|
|
a = a.clone();
|
|
}
|
|
|
|
var x1 = new BN(1);
|
|
var x2 = new BN(0);
|
|
|
|
var delta = b.clone();
|
|
|
|
while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {
|
|
for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);
|
|
if (i > 0) {
|
|
a.iushrn(i);
|
|
while (i-- > 0) {
|
|
if (x1.isOdd()) {
|
|
x1.iadd(delta);
|
|
}
|
|
|
|
x1.iushrn(1);
|
|
}
|
|
}
|
|
|
|
for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);
|
|
if (j > 0) {
|
|
b.iushrn(j);
|
|
while (j-- > 0) {
|
|
if (x2.isOdd()) {
|
|
x2.iadd(delta);
|
|
}
|
|
|
|
x2.iushrn(1);
|
|
}
|
|
}
|
|
|
|
if (a.cmp(b) >= 0) {
|
|
a.isub(b);
|
|
x1.isub(x2);
|
|
} else {
|
|
b.isub(a);
|
|
x2.isub(x1);
|
|
}
|
|
}
|
|
|
|
var res;
|
|
if (a.cmpn(1) === 0) {
|
|
res = x1;
|
|
} else {
|
|
res = x2;
|
|
}
|
|
|
|
if (res.cmpn(0) < 0) {
|
|
res.iadd(p);
|
|
}
|
|
|
|
return res;
|
|
};
|
|
|
|
BN.prototype.gcd = function gcd (num) {
|
|
if (this.isZero()) return num.abs();
|
|
if (num.isZero()) return this.abs();
|
|
|
|
var a = this.clone();
|
|
var b = num.clone();
|
|
a.negative = 0;
|
|
b.negative = 0;
|
|
|
|
// Remove common factor of two
|
|
for (var shift = 0; a.isEven() && b.isEven(); shift++) {
|
|
a.iushrn(1);
|
|
b.iushrn(1);
|
|
}
|
|
|
|
do {
|
|
while (a.isEven()) {
|
|
a.iushrn(1);
|
|
}
|
|
while (b.isEven()) {
|
|
b.iushrn(1);
|
|
}
|
|
|
|
var r = a.cmp(b);
|
|
if (r < 0) {
|
|
// Swap `a` and `b` to make `a` always bigger than `b`
|
|
var t = a;
|
|
a = b;
|
|
b = t;
|
|
} else if (r === 0 || b.cmpn(1) === 0) {
|
|
break;
|
|
}
|
|
|
|
a.isub(b);
|
|
} while (true);
|
|
|
|
return b.iushln(shift);
|
|
};
|
|
|
|
// Invert number in the field F(num)
|
|
BN.prototype.invm = function invm (num) {
|
|
return this.egcd(num).a.umod(num);
|
|
};
|
|
|
|
BN.prototype.isEven = function isEven () {
|
|
return (this.words[0] & 1) === 0;
|
|
};
|
|
|
|
BN.prototype.isOdd = function isOdd () {
|
|
return (this.words[0] & 1) === 1;
|
|
};
|
|
|
|
// And first word and num
|
|
BN.prototype.andln = function andln (num) {
|
|
return this.words[0] & num;
|
|
};
|
|
|
|
// Increment at the bit position in-line
|
|
BN.prototype.bincn = function bincn (bit) {
|
|
assert(typeof bit === 'number');
|
|
var r = bit % 26;
|
|
var s = (bit - r) / 26;
|
|
var q = 1 << r;
|
|
|
|
// Fast case: bit is much higher than all existing words
|
|
if (this.length <= s) {
|
|
this._expand(s + 1);
|
|
this.words[s] |= q;
|
|
return this;
|
|
}
|
|
|
|
// Add bit and propagate, if needed
|
|
var carry = q;
|
|
for (var i = s; carry !== 0 && i < this.length; i++) {
|
|
var w = this.words[i] | 0;
|
|
w += carry;
|
|
carry = w >>> 26;
|
|
w &= 0x3ffffff;
|
|
this.words[i] = w;
|
|
}
|
|
if (carry !== 0) {
|
|
this.words[i] = carry;
|
|
this.length++;
|
|
}
|
|
return this;
|
|
};
|
|
|
|
BN.prototype.isZero = function isZero () {
|
|
return this.length === 1 && this.words[0] === 0;
|
|
};
|
|
|
|
BN.prototype.cmpn = function cmpn (num) {
|
|
var negative = num < 0;
|
|
|
|
if (this.negative !== 0 && !negative) return -1;
|
|
if (this.negative === 0 && negative) return 1;
|
|
|
|
this.strip();
|
|
|
|
var res;
|
|
if (this.length > 1) {
|
|
res = 1;
|
|
} else {
|
|
if (negative) {
|
|
num = -num;
|
|
}
|
|
|
|
assert(num <= 0x3ffffff, 'Number is too big');
|
|
|
|
var w = this.words[0] | 0;
|
|
res = w === num ? 0 : w < num ? -1 : 1;
|
|
}
|
|
if (this.negative !== 0) return -res | 0;
|
|
return res;
|
|
};
|
|
|
|
// Compare two numbers and return:
|
|
// 1 - if `this` > `num`
|
|
// 0 - if `this` == `num`
|
|
// -1 - if `this` < `num`
|
|
BN.prototype.cmp = function cmp (num) {
|
|
if (this.negative !== 0 && num.negative === 0) return -1;
|
|
if (this.negative === 0 && num.negative !== 0) return 1;
|
|
|
|
var res = this.ucmp(num);
|
|
if (this.negative !== 0) return -res | 0;
|
|
return res;
|
|
};
|
|
|
|
// Unsigned comparison
|
|
BN.prototype.ucmp = function ucmp (num) {
|
|
// At this point both numbers have the same sign
|
|
if (this.length > num.length) return 1;
|
|
if (this.length < num.length) return -1;
|
|
|
|
var res = 0;
|
|
for (var i = this.length - 1; i >= 0; i--) {
|
|
var a = this.words[i] | 0;
|
|
var b = num.words[i] | 0;
|
|
|
|
if (a === b) continue;
|
|
if (a < b) {
|
|
res = -1;
|
|
} else if (a > b) {
|
|
res = 1;
|
|
}
|
|
break;
|
|
}
|
|
return res;
|
|
};
|
|
|
|
BN.prototype.gtn = function gtn (num) {
|
|
return this.cmpn(num) === 1;
|
|
};
|
|
|
|
BN.prototype.gt = function gt (num) {
|
|
return this.cmp(num) === 1;
|
|
};
|
|
|
|
BN.prototype.gten = function gten (num) {
|
|
return this.cmpn(num) >= 0;
|
|
};
|
|
|
|
BN.prototype.gte = function gte (num) {
|
|
return this.cmp(num) >= 0;
|
|
};
|
|
|
|
BN.prototype.ltn = function ltn (num) {
|
|
return this.cmpn(num) === -1;
|
|
};
|
|
|
|
BN.prototype.lt = function lt (num) {
|
|
return this.cmp(num) === -1;
|
|
};
|
|
|
|
BN.prototype.lten = function lten (num) {
|
|
return this.cmpn(num) <= 0;
|
|
};
|
|
|
|
BN.prototype.lte = function lte (num) {
|
|
return this.cmp(num) <= 0;
|
|
};
|
|
|
|
BN.prototype.eqn = function eqn (num) {
|
|
return this.cmpn(num) === 0;
|
|
};
|
|
|
|
BN.prototype.eq = function eq (num) {
|
|
return this.cmp(num) === 0;
|
|
};
|
|
|
|
//
|
|
// A reduce context, could be using montgomery or something better, depending
|
|
// on the `m` itself.
|
|
//
|
|
BN.red = function red (num) {
|
|
return new Red(num);
|
|
};
|
|
|
|
BN.prototype.toRed = function toRed (ctx) {
|
|
assert(!this.red, 'Already a number in reduction context');
|
|
assert(this.negative === 0, 'red works only with positives');
|
|
return ctx.convertTo(this)._forceRed(ctx);
|
|
};
|
|
|
|
BN.prototype.fromRed = function fromRed () {
|
|
assert(this.red, 'fromRed works only with numbers in reduction context');
|
|
return this.red.convertFrom(this);
|
|
};
|
|
|
|
BN.prototype._forceRed = function _forceRed (ctx) {
|
|
this.red = ctx;
|
|
return this;
|
|
};
|
|
|
|
BN.prototype.forceRed = function forceRed (ctx) {
|
|
assert(!this.red, 'Already a number in reduction context');
|
|
return this._forceRed(ctx);
|
|
};
|
|
|
|
BN.prototype.redAdd = function redAdd (num) {
|
|
assert(this.red, 'redAdd works only with red numbers');
|
|
return this.red.add(this, num);
|
|
};
|
|
|
|
BN.prototype.redIAdd = function redIAdd (num) {
|
|
assert(this.red, 'redIAdd works only with red numbers');
|
|
return this.red.iadd(this, num);
|
|
};
|
|
|
|
BN.prototype.redSub = function redSub (num) {
|
|
assert(this.red, 'redSub works only with red numbers');
|
|
return this.red.sub(this, num);
|
|
};
|
|
|
|
BN.prototype.redISub = function redISub (num) {
|
|
assert(this.red, 'redISub works only with red numbers');
|
|
return this.red.isub(this, num);
|
|
};
|
|
|
|
BN.prototype.redShl = function redShl (num) {
|
|
assert(this.red, 'redShl works only with red numbers');
|
|
return this.red.shl(this, num);
|
|
};
|
|
|
|
BN.prototype.redMul = function redMul (num) {
|
|
assert(this.red, 'redMul works only with red numbers');
|
|
this.red._verify2(this, num);
|
|
return this.red.mul(this, num);
|
|
};
|
|
|
|
BN.prototype.redIMul = function redIMul (num) {
|
|
assert(this.red, 'redMul works only with red numbers');
|
|
this.red._verify2(this, num);
|
|
return this.red.imul(this, num);
|
|
};
|
|
|
|
BN.prototype.redSqr = function redSqr () {
|
|
assert(this.red, 'redSqr works only with red numbers');
|
|
this.red._verify1(this);
|
|
return this.red.sqr(this);
|
|
};
|
|
|
|
BN.prototype.redISqr = function redISqr () {
|
|
assert(this.red, 'redISqr works only with red numbers');
|
|
this.red._verify1(this);
|
|
return this.red.isqr(this);
|
|
};
|
|
|
|
// Square root over p
|
|
BN.prototype.redSqrt = function redSqrt () {
|
|
assert(this.red, 'redSqrt works only with red numbers');
|
|
this.red._verify1(this);
|
|
return this.red.sqrt(this);
|
|
};
|
|
|
|
BN.prototype.redInvm = function redInvm () {
|
|
assert(this.red, 'redInvm works only with red numbers');
|
|
this.red._verify1(this);
|
|
return this.red.invm(this);
|
|
};
|
|
|
|
// Return negative clone of `this` % `red modulo`
|
|
BN.prototype.redNeg = function redNeg () {
|
|
assert(this.red, 'redNeg works only with red numbers');
|
|
this.red._verify1(this);
|
|
return this.red.neg(this);
|
|
};
|
|
|
|
BN.prototype.redPow = function redPow (num) {
|
|
assert(this.red && !num.red, 'redPow(normalNum)');
|
|
this.red._verify1(this);
|
|
return this.red.pow(this, num);
|
|
};
|
|
|
|
// Prime numbers with efficient reduction
|
|
var primes = {
|
|
k256: null,
|
|
p224: null,
|
|
p192: null,
|
|
p25519: null
|
|
};
|
|
|
|
// Pseudo-Mersenne prime
|
|
function MPrime (name, p) {
|
|
// P = 2 ^ N - K
|
|
this.name = name;
|
|
this.p = new BN(p, 16);
|
|
this.n = this.p.bitLength();
|
|
this.k = new BN(1).iushln(this.n).isub(this.p);
|
|
|
|
this.tmp = this._tmp();
|
|
}
|
|
|
|
MPrime.prototype._tmp = function _tmp () {
|
|
var tmp = new BN(null);
|
|
tmp.words = new Array(Math.ceil(this.n / 13));
|
|
return tmp;
|
|
};
|
|
|
|
MPrime.prototype.ireduce = function ireduce (num) {
|
|
// Assumes that `num` is less than `P^2`
|
|
// num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)
|
|
var r = num;
|
|
var rlen;
|
|
|
|
do {
|
|
this.split(r, this.tmp);
|
|
r = this.imulK(r);
|
|
r = r.iadd(this.tmp);
|
|
rlen = r.bitLength();
|
|
} while (rlen > this.n);
|
|
|
|
var cmp = rlen < this.n ? -1 : r.ucmp(this.p);
|
|
if (cmp === 0) {
|
|
r.words[0] = 0;
|
|
r.length = 1;
|
|
} else if (cmp > 0) {
|
|
r.isub(this.p);
|
|
} else {
|
|
r.strip();
|
|
}
|
|
|
|
return r;
|
|
};
|
|
|
|
MPrime.prototype.split = function split (input, out) {
|
|
input.iushrn(this.n, 0, out);
|
|
};
|
|
|
|
MPrime.prototype.imulK = function imulK (num) {
|
|
return num.imul(this.k);
|
|
};
|
|
|
|
function K256 () {
|
|
MPrime.call(
|
|
this,
|
|
'k256',
|
|
'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');
|
|
}
|
|
inherits(K256, MPrime);
|
|
|
|
K256.prototype.split = function split (input, output) {
|
|
// 256 = 9 * 26 + 22
|
|
var mask = 0x3fffff;
|
|
|
|
var outLen = Math.min(input.length, 9);
|
|
for (var i = 0; i < outLen; i++) {
|
|
output.words[i] = input.words[i];
|
|
}
|
|
output.length = outLen;
|
|
|
|
if (input.length <= 9) {
|
|
input.words[0] = 0;
|
|
input.length = 1;
|
|
return;
|
|
}
|
|
|
|
// Shift by 9 limbs
|
|
var prev = input.words[9];
|
|
output.words[output.length++] = prev & mask;
|
|
|
|
for (i = 10; i < input.length; i++) {
|
|
var next = input.words[i] | 0;
|
|
input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);
|
|
prev = next;
|
|
}
|
|
prev >>>= 22;
|
|
input.words[i - 10] = prev;
|
|
if (prev === 0 && input.length > 10) {
|
|
input.length -= 10;
|
|
} else {
|
|
input.length -= 9;
|
|
}
|
|
};
|
|
|
|
K256.prototype.imulK = function imulK (num) {
|
|
// K = 0x1000003d1 = [ 0x40, 0x3d1 ]
|
|
num.words[num.length] = 0;
|
|
num.words[num.length + 1] = 0;
|
|
num.length += 2;
|
|
|
|
// bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390
|
|
var lo = 0;
|
|
for (var i = 0; i < num.length; i++) {
|
|
var w = num.words[i] | 0;
|
|
lo += w * 0x3d1;
|
|
num.words[i] = lo & 0x3ffffff;
|
|
lo = w * 0x40 + ((lo / 0x4000000) | 0);
|
|
}
|
|
|
|
// Fast length reduction
|
|
if (num.words[num.length - 1] === 0) {
|
|
num.length--;
|
|
if (num.words[num.length - 1] === 0) {
|
|
num.length--;
|
|
}
|
|
}
|
|
return num;
|
|
};
|
|
|
|
function P224 () {
|
|
MPrime.call(
|
|
this,
|
|
'p224',
|
|
'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');
|
|
}
|
|
inherits(P224, MPrime);
|
|
|
|
function P192 () {
|
|
MPrime.call(
|
|
this,
|
|
'p192',
|
|
'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');
|
|
}
|
|
inherits(P192, MPrime);
|
|
|
|
function P25519 () {
|
|
// 2 ^ 255 - 19
|
|
MPrime.call(
|
|
this,
|
|
'25519',
|
|
'7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');
|
|
}
|
|
inherits(P25519, MPrime);
|
|
|
|
P25519.prototype.imulK = function imulK (num) {
|
|
// K = 0x13
|
|
var carry = 0;
|
|
for (var i = 0; i < num.length; i++) {
|
|
var hi = (num.words[i] | 0) * 0x13 + carry;
|
|
var lo = hi & 0x3ffffff;
|
|
hi >>>= 26;
|
|
|
|
num.words[i] = lo;
|
|
carry = hi;
|
|
}
|
|
if (carry !== 0) {
|
|
num.words[num.length++] = carry;
|
|
}
|
|
return num;
|
|
};
|
|
|
|
// Exported mostly for testing purposes, use plain name instead
|
|
BN._prime = function prime (name) {
|
|
// Cached version of prime
|
|
if (primes[name]) return primes[name];
|
|
|
|
var prime;
|
|
if (name === 'k256') {
|
|
prime = new K256();
|
|
} else if (name === 'p224') {
|
|
prime = new P224();
|
|
} else if (name === 'p192') {
|
|
prime = new P192();
|
|
} else if (name === 'p25519') {
|
|
prime = new P25519();
|
|
} else {
|
|
throw new Error('Unknown prime ' + name);
|
|
}
|
|
primes[name] = prime;
|
|
|
|
return prime;
|
|
};
|
|
|
|
//
|
|
// Base reduction engine
|
|
//
|
|
function Red (m) {
|
|
if (typeof m === 'string') {
|
|
var prime = BN._prime(m);
|
|
this.m = prime.p;
|
|
this.prime = prime;
|
|
} else {
|
|
assert(m.gtn(1), 'modulus must be greater than 1');
|
|
this.m = m;
|
|
this.prime = null;
|
|
}
|
|
}
|
|
|
|
Red.prototype._verify1 = function _verify1 (a) {
|
|
assert(a.negative === 0, 'red works only with positives');
|
|
assert(a.red, 'red works only with red numbers');
|
|
};
|
|
|
|
Red.prototype._verify2 = function _verify2 (a, b) {
|
|
assert((a.negative | b.negative) === 0, 'red works only with positives');
|
|
assert(a.red && a.red === b.red,
|
|
'red works only with red numbers');
|
|
};
|
|
|
|
Red.prototype.imod = function imod (a) {
|
|
if (this.prime) return this.prime.ireduce(a)._forceRed(this);
|
|
return a.umod(this.m)._forceRed(this);
|
|
};
|
|
|
|
Red.prototype.neg = function neg (a) {
|
|
if (a.isZero()) {
|
|
return a.clone();
|
|
}
|
|
|
|
return this.m.sub(a)._forceRed(this);
|
|
};
|
|
|
|
Red.prototype.add = function add (a, b) {
|
|
this._verify2(a, b);
|
|
|
|
var res = a.add(b);
|
|
if (res.cmp(this.m) >= 0) {
|
|
res.isub(this.m);
|
|
}
|
|
return res._forceRed(this);
|
|
};
|
|
|
|
Red.prototype.iadd = function iadd (a, b) {
|
|
this._verify2(a, b);
|
|
|
|
var res = a.iadd(b);
|
|
if (res.cmp(this.m) >= 0) {
|
|
res.isub(this.m);
|
|
}
|
|
return res;
|
|
};
|
|
|
|
Red.prototype.sub = function sub (a, b) {
|
|
this._verify2(a, b);
|
|
|
|
var res = a.sub(b);
|
|
if (res.cmpn(0) < 0) {
|
|
res.iadd(this.m);
|
|
}
|
|
return res._forceRed(this);
|
|
};
|
|
|
|
Red.prototype.isub = function isub (a, b) {
|
|
this._verify2(a, b);
|
|
|
|
var res = a.isub(b);
|
|
if (res.cmpn(0) < 0) {
|
|
res.iadd(this.m);
|
|
}
|
|
return res;
|
|
};
|
|
|
|
Red.prototype.shl = function shl (a, num) {
|
|
this._verify1(a);
|
|
return this.imod(a.ushln(num));
|
|
};
|
|
|
|
Red.prototype.imul = function imul (a, b) {
|
|
this._verify2(a, b);
|
|
return this.imod(a.imul(b));
|
|
};
|
|
|
|
Red.prototype.mul = function mul (a, b) {
|
|
this._verify2(a, b);
|
|
return this.imod(a.mul(b));
|
|
};
|
|
|
|
Red.prototype.isqr = function isqr (a) {
|
|
return this.imul(a, a.clone());
|
|
};
|
|
|
|
Red.prototype.sqr = function sqr (a) {
|
|
return this.mul(a, a);
|
|
};
|
|
|
|
Red.prototype.sqrt = function sqrt (a) {
|
|
if (a.isZero()) return a.clone();
|
|
|
|
var mod3 = this.m.andln(3);
|
|
assert(mod3 % 2 === 1);
|
|
|
|
// Fast case
|
|
if (mod3 === 3) {
|
|
var pow = this.m.add(new BN(1)).iushrn(2);
|
|
return this.pow(a, pow);
|
|
}
|
|
|
|
// Tonelli-Shanks algorithm (Totally unoptimized and slow)
|
|
//
|
|
// Find Q and S, that Q * 2 ^ S = (P - 1)
|
|
var q = this.m.subn(1);
|
|
var s = 0;
|
|
while (!q.isZero() && q.andln(1) === 0) {
|
|
s++;
|
|
q.iushrn(1);
|
|
}
|
|
assert(!q.isZero());
|
|
|
|
var one = new BN(1).toRed(this);
|
|
var nOne = one.redNeg();
|
|
|
|
// Find quadratic non-residue
|
|
// NOTE: Max is such because of generalized Riemann hypothesis.
|
|
var lpow = this.m.subn(1).iushrn(1);
|
|
var z = this.m.bitLength();
|
|
z = new BN(2 * z * z).toRed(this);
|
|
|
|
while (this.pow(z, lpow).cmp(nOne) !== 0) {
|
|
z.redIAdd(nOne);
|
|
}
|
|
|
|
var c = this.pow(z, q);
|
|
var r = this.pow(a, q.addn(1).iushrn(1));
|
|
var t = this.pow(a, q);
|
|
var m = s;
|
|
while (t.cmp(one) !== 0) {
|
|
var tmp = t;
|
|
for (var i = 0; tmp.cmp(one) !== 0; i++) {
|
|
tmp = tmp.redSqr();
|
|
}
|
|
assert(i < m);
|
|
var b = this.pow(c, new BN(1).iushln(m - i - 1));
|
|
|
|
r = r.redMul(b);
|
|
c = b.redSqr();
|
|
t = t.redMul(c);
|
|
m = i;
|
|
}
|
|
|
|
return r;
|
|
};
|
|
|
|
Red.prototype.invm = function invm (a) {
|
|
var inv = a._invmp(this.m);
|
|
if (inv.negative !== 0) {
|
|
inv.negative = 0;
|
|
return this.imod(inv).redNeg();
|
|
} else {
|
|
return this.imod(inv);
|
|
}
|
|
};
|
|
|
|
Red.prototype.pow = function pow (a, num) {
|
|
if (num.isZero()) return new BN(1).toRed(this);
|
|
if (num.cmpn(1) === 0) return a.clone();
|
|
|
|
var windowSize = 4;
|
|
var wnd = new Array(1 << windowSize);
|
|
wnd[0] = new BN(1).toRed(this);
|
|
wnd[1] = a;
|
|
for (var i = 2; i < wnd.length; i++) {
|
|
wnd[i] = this.mul(wnd[i - 1], a);
|
|
}
|
|
|
|
var res = wnd[0];
|
|
var current = 0;
|
|
var currentLen = 0;
|
|
var start = num.bitLength() % 26;
|
|
if (start === 0) {
|
|
start = 26;
|
|
}
|
|
|
|
for (i = num.length - 1; i >= 0; i--) {
|
|
var word = num.words[i];
|
|
for (var j = start - 1; j >= 0; j--) {
|
|
var bit = (word >> j) & 1;
|
|
if (res !== wnd[0]) {
|
|
res = this.sqr(res);
|
|
}
|
|
|
|
if (bit === 0 && current === 0) {
|
|
currentLen = 0;
|
|
continue;
|
|
}
|
|
|
|
current <<= 1;
|
|
current |= bit;
|
|
currentLen++;
|
|
if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;
|
|
|
|
res = this.mul(res, wnd[current]);
|
|
currentLen = 0;
|
|
current = 0;
|
|
}
|
|
start = 26;
|
|
}
|
|
|
|
return res;
|
|
};
|
|
|
|
Red.prototype.convertTo = function convertTo (num) {
|
|
var r = num.umod(this.m);
|
|
|
|
return r === num ? r.clone() : r;
|
|
};
|
|
|
|
Red.prototype.convertFrom = function convertFrom (num) {
|
|
var res = num.clone();
|
|
res.red = null;
|
|
return res;
|
|
};
|
|
|
|
//
|
|
// Montgomery method engine
|
|
//
|
|
|
|
BN.mont = function mont (num) {
|
|
return new Mont(num);
|
|
};
|
|
|
|
function Mont (m) {
|
|
Red.call(this, m);
|
|
|
|
this.shift = this.m.bitLength();
|
|
if (this.shift % 26 !== 0) {
|
|
this.shift += 26 - (this.shift % 26);
|
|
}
|
|
|
|
this.r = new BN(1).iushln(this.shift);
|
|
this.r2 = this.imod(this.r.sqr());
|
|
this.rinv = this.r._invmp(this.m);
|
|
|
|
this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);
|
|
this.minv = this.minv.umod(this.r);
|
|
this.minv = this.r.sub(this.minv);
|
|
}
|
|
inherits(Mont, Red);
|
|
|
|
Mont.prototype.convertTo = function convertTo (num) {
|
|
return this.imod(num.ushln(this.shift));
|
|
};
|
|
|
|
Mont.prototype.convertFrom = function convertFrom (num) {
|
|
var r = this.imod(num.mul(this.rinv));
|
|
r.red = null;
|
|
return r;
|
|
};
|
|
|
|
Mont.prototype.imul = function imul (a, b) {
|
|
if (a.isZero() || b.isZero()) {
|
|
a.words[0] = 0;
|
|
a.length = 1;
|
|
return a;
|
|
}
|
|
|
|
var t = a.imul(b);
|
|
var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);
|
|
var u = t.isub(c).iushrn(this.shift);
|
|
var res = u;
|
|
|
|
if (u.cmp(this.m) >= 0) {
|
|
res = u.isub(this.m);
|
|
} else if (u.cmpn(0) < 0) {
|
|
res = u.iadd(this.m);
|
|
}
|
|
|
|
return res._forceRed(this);
|
|
};
|
|
|
|
Mont.prototype.mul = function mul (a, b) {
|
|
if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);
|
|
|
|
var t = a.mul(b);
|
|
var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);
|
|
var u = t.isub(c).iushrn(this.shift);
|
|
var res = u;
|
|
if (u.cmp(this.m) >= 0) {
|
|
res = u.isub(this.m);
|
|
} else if (u.cmpn(0) < 0) {
|
|
res = u.iadd(this.m);
|
|
}
|
|
|
|
return res._forceRed(this);
|
|
};
|
|
|
|
Mont.prototype.invm = function invm (a) {
|
|
// (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R
|
|
var res = this.imod(a._invmp(this.m).mul(this.r2));
|
|
return res._forceRed(this);
|
|
};
|
|
})(module, commonjsGlobal);
|
|
});
|
|
|
|
var r;
|
|
|
|
var brorand = function rand(len) {
|
|
if (!r)
|
|
r = new Rand(null);
|
|
|
|
return r.generate(len);
|
|
};
|
|
|
|
function Rand(rand) {
|
|
this.rand = rand;
|
|
}
|
|
var Rand_1 = Rand;
|
|
|
|
Rand.prototype.generate = function generate(len) {
|
|
return this._rand(len);
|
|
};
|
|
|
|
// Emulate crypto API using randy
|
|
Rand.prototype._rand = function _rand(n) {
|
|
if (this.rand.getBytes)
|
|
return this.rand.getBytes(n);
|
|
|
|
var res = new Uint8Array(n);
|
|
for (var i = 0; i < res.length; i++)
|
|
res[i] = this.rand.getByte();
|
|
return res;
|
|
};
|
|
|
|
if (typeof self === 'object') {
|
|
if (self.crypto && self.crypto.getRandomValues) {
|
|
// Modern browsers
|
|
Rand.prototype._rand = function _rand(n) {
|
|
var arr = new Uint8Array(n);
|
|
self.crypto.getRandomValues(arr);
|
|
return arr;
|
|
};
|
|
} else if (self.msCrypto && self.msCrypto.getRandomValues) {
|
|
// IE
|
|
Rand.prototype._rand = function _rand(n) {
|
|
var arr = new Uint8Array(n);
|
|
self.msCrypto.getRandomValues(arr);
|
|
return arr;
|
|
};
|
|
|
|
// Safari's WebWorkers do not have `crypto`
|
|
} else if (typeof window === 'object') {
|
|
// Old junk
|
|
Rand.prototype._rand = function() {
|
|
throw new Error('Not implemented yet');
|
|
};
|
|
}
|
|
} else {
|
|
// Node.js or Web worker with no crypto support
|
|
try {
|
|
var crypto = crypto$1;
|
|
if (typeof crypto.randomBytes !== 'function')
|
|
throw new Error('Not supported');
|
|
|
|
Rand.prototype._rand = function _rand(n) {
|
|
return crypto.randomBytes(n);
|
|
};
|
|
} catch (e) {
|
|
}
|
|
}
|
|
brorand.Rand = Rand_1;
|
|
|
|
function MillerRabin(rand) {
|
|
this.rand = rand || new brorand.Rand();
|
|
}
|
|
var mr = MillerRabin;
|
|
|
|
MillerRabin.create = function create(rand) {
|
|
return new MillerRabin(rand);
|
|
};
|
|
|
|
MillerRabin.prototype._randbelow = function _randbelow(n) {
|
|
var len = n.bitLength();
|
|
var min_bytes = Math.ceil(len / 8);
|
|
|
|
// Generage random bytes until a number less than n is found.
|
|
// This ensures that 0..n-1 have an equal probability of being selected.
|
|
do
|
|
var a = new bn(this.rand.generate(min_bytes));
|
|
while (a.cmp(n) >= 0);
|
|
|
|
return a;
|
|
};
|
|
|
|
MillerRabin.prototype._randrange = function _randrange(start, stop) {
|
|
// Generate a random number greater than or equal to start and less than stop.
|
|
var size = stop.sub(start);
|
|
return start.add(this._randbelow(size));
|
|
};
|
|
|
|
MillerRabin.prototype.test = function test(n, k, cb) {
|
|
var len = n.bitLength();
|
|
var red = bn.mont(n);
|
|
var rone = new bn(1).toRed(red);
|
|
|
|
if (!k)
|
|
k = Math.max(1, (len / 48) | 0);
|
|
|
|
// Find d and s, (n - 1) = (2 ^ s) * d;
|
|
var n1 = n.subn(1);
|
|
for (var s = 0; !n1.testn(s); s++) {}
|
|
var d = n.shrn(s);
|
|
|
|
var rn1 = n1.toRed(red);
|
|
|
|
var prime = true;
|
|
for (; k > 0; k--) {
|
|
var a = this._randrange(new bn(2), n1);
|
|
if (cb)
|
|
cb(a);
|
|
|
|
var x = a.toRed(red).redPow(d);
|
|
if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)
|
|
continue;
|
|
|
|
for (var i = 1; i < s; i++) {
|
|
x = x.redSqr();
|
|
|
|
if (x.cmp(rone) === 0)
|
|
return false;
|
|
if (x.cmp(rn1) === 0)
|
|
break;
|
|
}
|
|
|
|
if (i === s)
|
|
return false;
|
|
}
|
|
|
|
return prime;
|
|
};
|
|
|
|
MillerRabin.prototype.getDivisor = function getDivisor(n, k) {
|
|
var len = n.bitLength();
|
|
var red = bn.mont(n);
|
|
var rone = new bn(1).toRed(red);
|
|
|
|
if (!k)
|
|
k = Math.max(1, (len / 48) | 0);
|
|
|
|
// Find d and s, (n - 1) = (2 ^ s) * d;
|
|
var n1 = n.subn(1);
|
|
for (var s = 0; !n1.testn(s); s++) {}
|
|
var d = n.shrn(s);
|
|
|
|
var rn1 = n1.toRed(red);
|
|
|
|
for (; k > 0; k--) {
|
|
var a = this._randrange(new bn(2), n1);
|
|
|
|
var g = n.gcd(a);
|
|
if (g.cmpn(1) !== 0)
|
|
return g;
|
|
|
|
var x = a.toRed(red).redPow(d);
|
|
if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)
|
|
continue;
|
|
|
|
for (var i = 1; i < s; i++) {
|
|
x = x.redSqr();
|
|
|
|
if (x.cmp(rone) === 0)
|
|
return x.fromRed().subn(1).gcd(n);
|
|
if (x.cmp(rn1) === 0)
|
|
break;
|
|
}
|
|
|
|
if (i === s) {
|
|
x = x.redSqr();
|
|
return x.fromRed().subn(1).gcd(n);
|
|
}
|
|
}
|
|
|
|
return false;
|
|
};
|
|
|
|
var generatePrime = findPrime;
|
|
findPrime.simpleSieve = simpleSieve;
|
|
findPrime.fermatTest = fermatTest;
|
|
|
|
var TWENTYFOUR = new bn(24);
|
|
|
|
var millerRabin = new mr();
|
|
var ONE = new bn(1);
|
|
var TWO = new bn(2);
|
|
var FIVE = new bn(5);
|
|
var SIXTEEN = new bn(16);
|
|
var EIGHT = new bn(8);
|
|
var TEN = new bn(10);
|
|
var THREE = new bn(3);
|
|
var SEVEN = new bn(7);
|
|
var ELEVEN = new bn(11);
|
|
var FOUR = new bn(4);
|
|
var TWELVE = new bn(12);
|
|
var primes = null;
|
|
|
|
function _getPrimes() {
|
|
if (primes !== null)
|
|
return primes;
|
|
|
|
var limit = 0x100000;
|
|
var res = [];
|
|
res[0] = 2;
|
|
for (var i = 1, k = 3; k < limit; k += 2) {
|
|
var sqrt = Math.ceil(Math.sqrt(k));
|
|
for (var j = 0; j < i && res[j] <= sqrt; j++)
|
|
if (k % res[j] === 0)
|
|
break;
|
|
|
|
if (i !== j && res[j] <= sqrt)
|
|
continue;
|
|
|
|
res[i++] = k;
|
|
}
|
|
primes = res;
|
|
return res;
|
|
}
|
|
|
|
function simpleSieve(p) {
|
|
var primes = _getPrimes();
|
|
|
|
for (var i = 0; i < primes.length; i++)
|
|
if (p.modn(primes[i]) === 0) {
|
|
if (p.cmpn(primes[i]) === 0) {
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
function fermatTest(p) {
|
|
var red = bn.mont(p);
|
|
return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;
|
|
}
|
|
|
|
function findPrime(bits, gen) {
|
|
if (bits < 16) {
|
|
// this is what openssl does
|
|
if (gen === 2 || gen === 5) {
|
|
return new bn([0x8c, 0x7b]);
|
|
} else {
|
|
return new bn([0x8c, 0x27]);
|
|
}
|
|
}
|
|
gen = new bn(gen);
|
|
|
|
var num, n2;
|
|
|
|
while (true) {
|
|
num = new bn(browser(Math.ceil(bits / 8)));
|
|
while (num.bitLength() > bits) {
|
|
num.ishrn(1);
|
|
}
|
|
if (num.isEven()) {
|
|
num.iadd(ONE);
|
|
}
|
|
if (!num.testn(1)) {
|
|
num.iadd(TWO);
|
|
}
|
|
if (!gen.cmp(TWO)) {
|
|
while (num.mod(TWENTYFOUR).cmp(ELEVEN)) {
|
|
num.iadd(FOUR);
|
|
}
|
|
} else if (!gen.cmp(FIVE)) {
|
|
while (num.mod(TEN).cmp(THREE)) {
|
|
num.iadd(FOUR);
|
|
}
|
|
}
|
|
n2 = num.shrn(1);
|
|
if (simpleSieve(n2) && simpleSieve(num) &&
|
|
fermatTest(n2) && fermatTest(num) &&
|
|
millerRabin.test(n2) && millerRabin.test(num)) {
|
|
return num;
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
var modp1 = {
|
|
gen: "02",
|
|
prime: "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff"
|
|
};
|
|
var modp2 = {
|
|
gen: "02",
|
|
prime: "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff"
|
|
};
|
|
var modp5 = {
|
|
gen: "02",
|
|
prime: "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff"
|
|
};
|
|
var modp14 = {
|
|
gen: "02",
|
|
prime: "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff"
|
|
};
|
|
var modp15 = {
|
|
gen: "02",
|
|
prime: "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff"
|
|
};
|
|
var modp16 = {
|
|
gen: "02",
|
|
prime: "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff"
|
|
};
|
|
var modp17 = {
|
|
gen: "02",
|
|
prime: "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff"
|
|
};
|
|
var modp18 = {
|
|
gen: "02",
|
|
prime: "ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff"
|
|
};
|
|
var primes$1 = {
|
|
modp1: modp1,
|
|
modp2: modp2,
|
|
modp5: modp5,
|
|
modp14: modp14,
|
|
modp15: modp15,
|
|
modp16: modp16,
|
|
modp17: modp17,
|
|
modp18: modp18
|
|
};
|
|
|
|
var primes$2 = /*#__PURE__*/Object.freeze({
|
|
modp1: modp1,
|
|
modp2: modp2,
|
|
modp5: modp5,
|
|
modp14: modp14,
|
|
modp15: modp15,
|
|
modp16: modp16,
|
|
modp17: modp17,
|
|
modp18: modp18,
|
|
'default': primes$1
|
|
});
|
|
|
|
var millerRabin$1 = new mr();
|
|
var TWENTYFOUR$1 = new bn(24);
|
|
var ELEVEN$1 = new bn(11);
|
|
var TEN$1 = new bn(10);
|
|
var THREE$1 = new bn(3);
|
|
var SEVEN$1 = new bn(7);
|
|
|
|
|
|
var dh = DH;
|
|
|
|
function setPublicKey(pub, enc) {
|
|
enc = enc || 'utf8';
|
|
if (!Buffer.isBuffer(pub)) {
|
|
pub = new Buffer(pub, enc);
|
|
}
|
|
this._pub = new bn(pub);
|
|
return this;
|
|
}
|
|
|
|
function setPrivateKey(priv, enc) {
|
|
enc = enc || 'utf8';
|
|
if (!Buffer.isBuffer(priv)) {
|
|
priv = new Buffer(priv, enc);
|
|
}
|
|
this._priv = new bn(priv);
|
|
return this;
|
|
}
|
|
|
|
var primeCache = {};
|
|
function checkPrime(prime, generator) {
|
|
var gen = generator.toString('hex');
|
|
var hex = [gen, prime.toString(16)].join('_');
|
|
if (hex in primeCache) {
|
|
return primeCache[hex];
|
|
}
|
|
var error = 0;
|
|
|
|
if (prime.isEven() ||
|
|
!generatePrime.simpleSieve ||
|
|
!generatePrime.fermatTest(prime) ||
|
|
!millerRabin$1.test(prime)) {
|
|
//not a prime so +1
|
|
error += 1;
|
|
|
|
if (gen === '02' || gen === '05') {
|
|
// we'd be able to check the generator
|
|
// it would fail so +8
|
|
error += 8;
|
|
} else {
|
|
//we wouldn't be able to test the generator
|
|
// so +4
|
|
error += 4;
|
|
}
|
|
primeCache[hex] = error;
|
|
return error;
|
|
}
|
|
if (!millerRabin$1.test(prime.shrn(1))) {
|
|
//not a safe prime
|
|
error += 2;
|
|
}
|
|
var rem;
|
|
switch (gen) {
|
|
case '02':
|
|
if (prime.mod(TWENTYFOUR$1).cmp(ELEVEN$1)) {
|
|
// unsuidable generator
|
|
error += 8;
|
|
}
|
|
break;
|
|
case '05':
|
|
rem = prime.mod(TEN$1);
|
|
if (rem.cmp(THREE$1) && rem.cmp(SEVEN$1)) {
|
|
// prime mod 10 needs to equal 3 or 7
|
|
error += 8;
|
|
}
|
|
break;
|
|
default:
|
|
error += 4;
|
|
}
|
|
primeCache[hex] = error;
|
|
return error;
|
|
}
|
|
|
|
function DH(prime, generator, malleable) {
|
|
this.setGenerator(generator);
|
|
this.__prime = new bn(prime);
|
|
this._prime = bn.mont(this.__prime);
|
|
this._primeLen = prime.length;
|
|
this._pub = undefined;
|
|
this._priv = undefined;
|
|
this._primeCode = undefined;
|
|
if (malleable) {
|
|
this.setPublicKey = setPublicKey;
|
|
this.setPrivateKey = setPrivateKey;
|
|
} else {
|
|
this._primeCode = 8;
|
|
}
|
|
}
|
|
Object.defineProperty(DH.prototype, 'verifyError', {
|
|
enumerable: true,
|
|
get: function () {
|
|
if (typeof this._primeCode !== 'number') {
|
|
this._primeCode = checkPrime(this.__prime, this.__gen);
|
|
}
|
|
return this._primeCode;
|
|
}
|
|
});
|
|
DH.prototype.generateKeys = function () {
|
|
if (!this._priv) {
|
|
this._priv = new bn(browser(this._primeLen));
|
|
}
|
|
this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();
|
|
return this.getPublicKey();
|
|
};
|
|
|
|
DH.prototype.computeSecret = function (other) {
|
|
other = new bn(other);
|
|
other = other.toRed(this._prime);
|
|
var secret = other.redPow(this._priv).fromRed();
|
|
var out = new Buffer(secret.toArray());
|
|
var prime = this.getPrime();
|
|
if (out.length < prime.length) {
|
|
var front = new Buffer(prime.length - out.length);
|
|
front.fill(0);
|
|
out = Buffer.concat([front, out]);
|
|
}
|
|
return out;
|
|
};
|
|
|
|
DH.prototype.getPublicKey = function getPublicKey(enc) {
|
|
return formatReturnValue(this._pub, enc);
|
|
};
|
|
|
|
DH.prototype.getPrivateKey = function getPrivateKey(enc) {
|
|
return formatReturnValue(this._priv, enc);
|
|
};
|
|
|
|
DH.prototype.getPrime = function (enc) {
|
|
return formatReturnValue(this.__prime, enc);
|
|
};
|
|
|
|
DH.prototype.getGenerator = function (enc) {
|
|
return formatReturnValue(this._gen, enc);
|
|
};
|
|
|
|
DH.prototype.setGenerator = function (gen, enc) {
|
|
enc = enc || 'utf8';
|
|
if (!Buffer.isBuffer(gen)) {
|
|
gen = new Buffer(gen, enc);
|
|
}
|
|
this.__gen = gen;
|
|
this._gen = new bn(gen);
|
|
return this;
|
|
};
|
|
|
|
function formatReturnValue(bn, enc) {
|
|
var buf = new Buffer(bn.toArray());
|
|
if (!enc) {
|
|
return buf;
|
|
} else {
|
|
return buf.toString(enc);
|
|
}
|
|
}
|
|
|
|
var primes$3 = getCjsExportFromNamespace(primes$2);
|
|
|
|
var browser$6 = createCommonjsModule(function (module, exports) {
|
|
function getDiffieHellman (mod) {
|
|
var prime = new Buffer(primes$3[mod].prime, 'hex');
|
|
var gen = new Buffer(primes$3[mod].gen, 'hex');
|
|
|
|
return new dh(prime, gen)
|
|
}
|
|
|
|
var ENCODINGS = {
|
|
'binary': true, 'hex': true, 'base64': true
|
|
};
|
|
|
|
function createDiffieHellman (prime, enc, generator, genc) {
|
|
if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {
|
|
return createDiffieHellman(prime, 'binary', enc, generator)
|
|
}
|
|
|
|
enc = enc || 'binary';
|
|
genc = genc || 'binary';
|
|
generator = generator || new Buffer([2]);
|
|
|
|
if (!Buffer.isBuffer(generator)) {
|
|
generator = new Buffer(generator, genc);
|
|
}
|
|
|
|
if (typeof prime === 'number') {
|
|
return new dh(generatePrime(prime, generator), generator, true)
|
|
}
|
|
|
|
if (!Buffer.isBuffer(prime)) {
|
|
prime = new Buffer(prime, enc);
|
|
}
|
|
|
|
return new dh(prime, generator, true)
|
|
}
|
|
|
|
exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman;
|
|
exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman;
|
|
});
|
|
var browser_1$2 = browser$6.DiffieHellmanGroup;
|
|
var browser_2$2 = browser$6.createDiffieHellmanGroup;
|
|
var browser_3$2 = browser$6.getDiffieHellman;
|
|
var browser_4$2 = browser$6.createDiffieHellman;
|
|
var browser_5$2 = browser$6.DiffieHellman;
|
|
|
|
var browserifyRsa = crt;
|
|
function blind(priv) {
|
|
var r = getr(priv);
|
|
var blinder = r.toRed(bn.mont(priv.modulus))
|
|
.redPow(new bn(priv.publicExponent)).fromRed();
|
|
return {
|
|
blinder: blinder,
|
|
unblinder:r.invm(priv.modulus)
|
|
};
|
|
}
|
|
function crt(msg, priv) {
|
|
var blinds = blind(priv);
|
|
var len = priv.modulus.byteLength();
|
|
var mod = bn.mont(priv.modulus);
|
|
var blinded = new bn(msg).mul(blinds.blinder).umod(priv.modulus);
|
|
var c1 = blinded.toRed(bn.mont(priv.prime1));
|
|
var c2 = blinded.toRed(bn.mont(priv.prime2));
|
|
var qinv = priv.coefficient;
|
|
var p = priv.prime1;
|
|
var q = priv.prime2;
|
|
var m1 = c1.redPow(priv.exponent1);
|
|
var m2 = c2.redPow(priv.exponent2);
|
|
m1 = m1.fromRed();
|
|
m2 = m2.fromRed();
|
|
var h = m1.isub(m2).imul(qinv).umod(p);
|
|
h.imul(q);
|
|
m2.iadd(h);
|
|
return new Buffer(m2.imul(blinds.unblinder).umod(priv.modulus).toArray(false, len));
|
|
}
|
|
crt.getr = getr;
|
|
function getr(priv) {
|
|
var len = priv.modulus.byteLength();
|
|
var r = new bn(browser(len));
|
|
while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2)) {
|
|
r = new bn(browser(len));
|
|
}
|
|
return r;
|
|
}
|
|
|
|
var name = "elliptic";
|
|
var version = "6.4.1";
|
|
var description = "EC cryptography";
|
|
var main = "lib/elliptic.js";
|
|
var files = [
|
|
"lib"
|
|
];
|
|
var scripts = {
|
|
jscs: "jscs benchmarks/*.js lib/*.js lib/**/*.js lib/**/**/*.js test/index.js",
|
|
jshint: "jscs benchmarks/*.js lib/*.js lib/**/*.js lib/**/**/*.js test/index.js",
|
|
lint: "npm run jscs && npm run jshint",
|
|
unit: "istanbul test _mocha --reporter=spec test/index.js",
|
|
test: "npm run lint && npm run unit",
|
|
version: "grunt dist && git add dist/"
|
|
};
|
|
var repository = {
|
|
type: "git",
|
|
url: "git@github.com:indutny/elliptic"
|
|
};
|
|
var keywords = [
|
|
"EC",
|
|
"Elliptic",
|
|
"curve",
|
|
"Cryptography"
|
|
];
|
|
var author = "Fedor Indutny <fedor@indutny.com>";
|
|
var license = "MIT";
|
|
var bugs = {
|
|
url: "https://github.com/indutny/elliptic/issues"
|
|
};
|
|
var homepage = "https://github.com/indutny/elliptic";
|
|
var devDependencies = {
|
|
brfs: "^1.4.3",
|
|
coveralls: "^2.11.3",
|
|
grunt: "^0.4.5",
|
|
"grunt-browserify": "^5.0.0",
|
|
"grunt-cli": "^1.2.0",
|
|
"grunt-contrib-connect": "^1.0.0",
|
|
"grunt-contrib-copy": "^1.0.0",
|
|
"grunt-contrib-uglify": "^1.0.1",
|
|
"grunt-mocha-istanbul": "^3.0.1",
|
|
"grunt-saucelabs": "^8.6.2",
|
|
istanbul: "^0.4.2",
|
|
jscs: "^2.9.0",
|
|
jshint: "^2.6.0",
|
|
mocha: "^2.1.0"
|
|
};
|
|
var dependencies = {
|
|
"bn.js": "^4.4.0",
|
|
brorand: "^1.0.1",
|
|
"hash.js": "^1.0.0",
|
|
"hmac-drbg": "^1.0.0",
|
|
inherits: "^2.0.1",
|
|
"minimalistic-assert": "^1.0.0",
|
|
"minimalistic-crypto-utils": "^1.0.0"
|
|
};
|
|
var _resolved = "https://registry.npmjs.org/elliptic/-/elliptic-6.4.1.tgz";
|
|
var _integrity = "sha512-BsXLz5sqX8OHcsh7CqBMztyXARmGQ3LWPtGjJi6DiJHq5C/qvi9P3OqgswKSDftbu8+IoI/QDTAm2fFnQ9SZSQ==";
|
|
var _from = "elliptic@6.4.1";
|
|
var _package = {
|
|
name: name,
|
|
version: version,
|
|
description: description,
|
|
main: main,
|
|
files: files,
|
|
scripts: scripts,
|
|
repository: repository,
|
|
keywords: keywords,
|
|
author: author,
|
|
license: license,
|
|
bugs: bugs,
|
|
homepage: homepage,
|
|
devDependencies: devDependencies,
|
|
dependencies: dependencies,
|
|
_resolved: _resolved,
|
|
_integrity: _integrity,
|
|
_from: _from
|
|
};
|
|
|
|
var _package$1 = /*#__PURE__*/Object.freeze({
|
|
name: name,
|
|
version: version,
|
|
description: description,
|
|
main: main,
|
|
files: files,
|
|
scripts: scripts,
|
|
repository: repository,
|
|
keywords: keywords,
|
|
author: author,
|
|
license: license,
|
|
bugs: bugs,
|
|
homepage: homepage,
|
|
devDependencies: devDependencies,
|
|
dependencies: dependencies,
|
|
_resolved: _resolved,
|
|
_integrity: _integrity,
|
|
_from: _from,
|
|
'default': _package
|
|
});
|
|
|
|
var utils_1 = createCommonjsModule(function (module, exports) {
|
|
|
|
var utils = exports;
|
|
|
|
function toArray(msg, enc) {
|
|
if (Array.isArray(msg))
|
|
return msg.slice();
|
|
if (!msg)
|
|
return [];
|
|
var res = [];
|
|
if (typeof msg !== 'string') {
|
|
for (var i = 0; i < msg.length; i++)
|
|
res[i] = msg[i] | 0;
|
|
return res;
|
|
}
|
|
if (enc === 'hex') {
|
|
msg = msg.replace(/[^a-z0-9]+/ig, '');
|
|
if (msg.length % 2 !== 0)
|
|
msg = '0' + msg;
|
|
for (var i = 0; i < msg.length; i += 2)
|
|
res.push(parseInt(msg[i] + msg[i + 1], 16));
|
|
} else {
|
|
for (var i = 0; i < msg.length; i++) {
|
|
var c = msg.charCodeAt(i);
|
|
var hi = c >> 8;
|
|
var lo = c & 0xff;
|
|
if (hi)
|
|
res.push(hi, lo);
|
|
else
|
|
res.push(lo);
|
|
}
|
|
}
|
|
return res;
|
|
}
|
|
utils.toArray = toArray;
|
|
|
|
function zero2(word) {
|
|
if (word.length === 1)
|
|
return '0' + word;
|
|
else
|
|
return word;
|
|
}
|
|
utils.zero2 = zero2;
|
|
|
|
function toHex(msg) {
|
|
var res = '';
|
|
for (var i = 0; i < msg.length; i++)
|
|
res += zero2(msg[i].toString(16));
|
|
return res;
|
|
}
|
|
utils.toHex = toHex;
|
|
|
|
utils.encode = function encode(arr, enc) {
|
|
if (enc === 'hex')
|
|
return toHex(arr);
|
|
else
|
|
return arr;
|
|
};
|
|
});
|
|
|
|
var utils_1$1 = createCommonjsModule(function (module, exports) {
|
|
|
|
var utils = exports;
|
|
|
|
|
|
|
|
|
|
utils.assert = minimalisticAssert;
|
|
utils.toArray = utils_1.toArray;
|
|
utils.zero2 = utils_1.zero2;
|
|
utils.toHex = utils_1.toHex;
|
|
utils.encode = utils_1.encode;
|
|
|
|
// Represent num in a w-NAF form
|
|
function getNAF(num, w) {
|
|
var naf = [];
|
|
var ws = 1 << (w + 1);
|
|
var k = num.clone();
|
|
while (k.cmpn(1) >= 0) {
|
|
var z;
|
|
if (k.isOdd()) {
|
|
var mod = k.andln(ws - 1);
|
|
if (mod > (ws >> 1) - 1)
|
|
z = (ws >> 1) - mod;
|
|
else
|
|
z = mod;
|
|
k.isubn(z);
|
|
} else {
|
|
z = 0;
|
|
}
|
|
naf.push(z);
|
|
|
|
// Optimization, shift by word if possible
|
|
var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;
|
|
for (var i = 1; i < shift; i++)
|
|
naf.push(0);
|
|
k.iushrn(shift);
|
|
}
|
|
|
|
return naf;
|
|
}
|
|
utils.getNAF = getNAF;
|
|
|
|
// Represent k1, k2 in a Joint Sparse Form
|
|
function getJSF(k1, k2) {
|
|
var jsf = [
|
|
[],
|
|
[]
|
|
];
|
|
|
|
k1 = k1.clone();
|
|
k2 = k2.clone();
|
|
var d1 = 0;
|
|
var d2 = 0;
|
|
while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {
|
|
|
|
// First phase
|
|
var m14 = (k1.andln(3) + d1) & 3;
|
|
var m24 = (k2.andln(3) + d2) & 3;
|
|
if (m14 === 3)
|
|
m14 = -1;
|
|
if (m24 === 3)
|
|
m24 = -1;
|
|
var u1;
|
|
if ((m14 & 1) === 0) {
|
|
u1 = 0;
|
|
} else {
|
|
var m8 = (k1.andln(7) + d1) & 7;
|
|
if ((m8 === 3 || m8 === 5) && m24 === 2)
|
|
u1 = -m14;
|
|
else
|
|
u1 = m14;
|
|
}
|
|
jsf[0].push(u1);
|
|
|
|
var u2;
|
|
if ((m24 & 1) === 0) {
|
|
u2 = 0;
|
|
} else {
|
|
var m8 = (k2.andln(7) + d2) & 7;
|
|
if ((m8 === 3 || m8 === 5) && m14 === 2)
|
|
u2 = -m24;
|
|
else
|
|
u2 = m24;
|
|
}
|
|
jsf[1].push(u2);
|
|
|
|
// Second phase
|
|
if (2 * d1 === u1 + 1)
|
|
d1 = 1 - d1;
|
|
if (2 * d2 === u2 + 1)
|
|
d2 = 1 - d2;
|
|
k1.iushrn(1);
|
|
k2.iushrn(1);
|
|
}
|
|
|
|
return jsf;
|
|
}
|
|
utils.getJSF = getJSF;
|
|
|
|
function cachedProperty(obj, name, computer) {
|
|
var key = '_' + name;
|
|
obj.prototype[name] = function cachedProperty() {
|
|
return this[key] !== undefined ? this[key] :
|
|
this[key] = computer.call(this);
|
|
};
|
|
}
|
|
utils.cachedProperty = cachedProperty;
|
|
|
|
function parseBytes(bytes) {
|
|
return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :
|
|
bytes;
|
|
}
|
|
utils.parseBytes = parseBytes;
|
|
|
|
function intFromLE(bytes) {
|
|
return new bn(bytes, 'hex', 'le');
|
|
}
|
|
utils.intFromLE = intFromLE;
|
|
});
|
|
|
|
var utils$3 = elliptic_1.utils;
|
|
var getNAF = utils$3.getNAF;
|
|
var getJSF = utils$3.getJSF;
|
|
var assert$1 = utils$3.assert;
|
|
|
|
function BaseCurve(type, conf) {
|
|
this.type = type;
|
|
this.p = new bn(conf.p, 16);
|
|
|
|
// Use Montgomery, when there is no fast reduction for the prime
|
|
this.red = conf.prime ? bn.red(conf.prime) : bn.mont(this.p);
|
|
|
|
// Useful for many curves
|
|
this.zero = new bn(0).toRed(this.red);
|
|
this.one = new bn(1).toRed(this.red);
|
|
this.two = new bn(2).toRed(this.red);
|
|
|
|
// Curve configuration, optional
|
|
this.n = conf.n && new bn(conf.n, 16);
|
|
this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);
|
|
|
|
// Temporary arrays
|
|
this._wnafT1 = new Array(4);
|
|
this._wnafT2 = new Array(4);
|
|
this._wnafT3 = new Array(4);
|
|
this._wnafT4 = new Array(4);
|
|
|
|
// Generalized Greg Maxwell's trick
|
|
var adjustCount = this.n && this.p.div(this.n);
|
|
if (!adjustCount || adjustCount.cmpn(100) > 0) {
|
|
this.redN = null;
|
|
} else {
|
|
this._maxwellTrick = true;
|
|
this.redN = this.n.toRed(this.red);
|
|
}
|
|
}
|
|
var base = BaseCurve;
|
|
|
|
BaseCurve.prototype.point = function point() {
|
|
throw new Error('Not implemented');
|
|
};
|
|
|
|
BaseCurve.prototype.validate = function validate() {
|
|
throw new Error('Not implemented');
|
|
};
|
|
|
|
BaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {
|
|
assert$1(p.precomputed);
|
|
var doubles = p._getDoubles();
|
|
|
|
var naf = getNAF(k, 1);
|
|
var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);
|
|
I /= 3;
|
|
|
|
// Translate into more windowed form
|
|
var repr = [];
|
|
for (var j = 0; j < naf.length; j += doubles.step) {
|
|
var nafW = 0;
|
|
for (var k = j + doubles.step - 1; k >= j; k--)
|
|
nafW = (nafW << 1) + naf[k];
|
|
repr.push(nafW);
|
|
}
|
|
|
|
var a = this.jpoint(null, null, null);
|
|
var b = this.jpoint(null, null, null);
|
|
for (var i = I; i > 0; i--) {
|
|
for (var j = 0; j < repr.length; j++) {
|
|
var nafW = repr[j];
|
|
if (nafW === i)
|
|
b = b.mixedAdd(doubles.points[j]);
|
|
else if (nafW === -i)
|
|
b = b.mixedAdd(doubles.points[j].neg());
|
|
}
|
|
a = a.add(b);
|
|
}
|
|
return a.toP();
|
|
};
|
|
|
|
BaseCurve.prototype._wnafMul = function _wnafMul(p, k) {
|
|
var w = 4;
|
|
|
|
// Precompute window
|
|
var nafPoints = p._getNAFPoints(w);
|
|
w = nafPoints.wnd;
|
|
var wnd = nafPoints.points;
|
|
|
|
// Get NAF form
|
|
var naf = getNAF(k, w);
|
|
|
|
// Add `this`*(N+1) for every w-NAF index
|
|
var acc = this.jpoint(null, null, null);
|
|
for (var i = naf.length - 1; i >= 0; i--) {
|
|
// Count zeroes
|
|
for (var k = 0; i >= 0 && naf[i] === 0; i--)
|
|
k++;
|
|
if (i >= 0)
|
|
k++;
|
|
acc = acc.dblp(k);
|
|
|
|
if (i < 0)
|
|
break;
|
|
var z = naf[i];
|
|
assert$1(z !== 0);
|
|
if (p.type === 'affine') {
|
|
// J +- P
|
|
if (z > 0)
|
|
acc = acc.mixedAdd(wnd[(z - 1) >> 1]);
|
|
else
|
|
acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());
|
|
} else {
|
|
// J +- J
|
|
if (z > 0)
|
|
acc = acc.add(wnd[(z - 1) >> 1]);
|
|
else
|
|
acc = acc.add(wnd[(-z - 1) >> 1].neg());
|
|
}
|
|
}
|
|
return p.type === 'affine' ? acc.toP() : acc;
|
|
};
|
|
|
|
BaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,
|
|
points,
|
|
coeffs,
|
|
len,
|
|
jacobianResult) {
|
|
var wndWidth = this._wnafT1;
|
|
var wnd = this._wnafT2;
|
|
var naf = this._wnafT3;
|
|
|
|
// Fill all arrays
|
|
var max = 0;
|
|
for (var i = 0; i < len; i++) {
|
|
var p = points[i];
|
|
var nafPoints = p._getNAFPoints(defW);
|
|
wndWidth[i] = nafPoints.wnd;
|
|
wnd[i] = nafPoints.points;
|
|
}
|
|
|
|
// Comb small window NAFs
|
|
for (var i = len - 1; i >= 1; i -= 2) {
|
|
var a = i - 1;
|
|
var b = i;
|
|
if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {
|
|
naf[a] = getNAF(coeffs[a], wndWidth[a]);
|
|
naf[b] = getNAF(coeffs[b], wndWidth[b]);
|
|
max = Math.max(naf[a].length, max);
|
|
max = Math.max(naf[b].length, max);
|
|
continue;
|
|
}
|
|
|
|
var comb = [
|
|
points[a], /* 1 */
|
|
null, /* 3 */
|
|
null, /* 5 */
|
|
points[b] /* 7 */
|
|
];
|
|
|
|
// Try to avoid Projective points, if possible
|
|
if (points[a].y.cmp(points[b].y) === 0) {
|
|
comb[1] = points[a].add(points[b]);
|
|
comb[2] = points[a].toJ().mixedAdd(points[b].neg());
|
|
} else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {
|
|
comb[1] = points[a].toJ().mixedAdd(points[b]);
|
|
comb[2] = points[a].add(points[b].neg());
|
|
} else {
|
|
comb[1] = points[a].toJ().mixedAdd(points[b]);
|
|
comb[2] = points[a].toJ().mixedAdd(points[b].neg());
|
|
}
|
|
|
|
var index = [
|
|
-3, /* -1 -1 */
|
|
-1, /* -1 0 */
|
|
-5, /* -1 1 */
|
|
-7, /* 0 -1 */
|
|
0, /* 0 0 */
|
|
7, /* 0 1 */
|
|
5, /* 1 -1 */
|
|
1, /* 1 0 */
|
|
3 /* 1 1 */
|
|
];
|
|
|
|
var jsf = getJSF(coeffs[a], coeffs[b]);
|
|
max = Math.max(jsf[0].length, max);
|
|
naf[a] = new Array(max);
|
|
naf[b] = new Array(max);
|
|
for (var j = 0; j < max; j++) {
|
|
var ja = jsf[0][j] | 0;
|
|
var jb = jsf[1][j] | 0;
|
|
|
|
naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];
|
|
naf[b][j] = 0;
|
|
wnd[a] = comb;
|
|
}
|
|
}
|
|
|
|
var acc = this.jpoint(null, null, null);
|
|
var tmp = this._wnafT4;
|
|
for (var i = max; i >= 0; i--) {
|
|
var k = 0;
|
|
|
|
while (i >= 0) {
|
|
var zero = true;
|
|
for (var j = 0; j < len; j++) {
|
|
tmp[j] = naf[j][i] | 0;
|
|
if (tmp[j] !== 0)
|
|
zero = false;
|
|
}
|
|
if (!zero)
|
|
break;
|
|
k++;
|
|
i--;
|
|
}
|
|
if (i >= 0)
|
|
k++;
|
|
acc = acc.dblp(k);
|
|
if (i < 0)
|
|
break;
|
|
|
|
for (var j = 0; j < len; j++) {
|
|
var z = tmp[j];
|
|
var p;
|
|
if (z === 0)
|
|
continue;
|
|
else if (z > 0)
|
|
p = wnd[j][(z - 1) >> 1];
|
|
else if (z < 0)
|
|
p = wnd[j][(-z - 1) >> 1].neg();
|
|
|
|
if (p.type === 'affine')
|
|
acc = acc.mixedAdd(p);
|
|
else
|
|
acc = acc.add(p);
|
|
}
|
|
}
|
|
// Zeroify references
|
|
for (var i = 0; i < len; i++)
|
|
wnd[i] = null;
|
|
|
|
if (jacobianResult)
|
|
return acc;
|
|
else
|
|
return acc.toP();
|
|
};
|
|
|
|
function BasePoint(curve, type) {
|
|
this.curve = curve;
|
|
this.type = type;
|
|
this.precomputed = null;
|
|
}
|
|
BaseCurve.BasePoint = BasePoint;
|
|
|
|
BasePoint.prototype.eq = function eq(/*other*/) {
|
|
throw new Error('Not implemented');
|
|
};
|
|
|
|
BasePoint.prototype.validate = function validate() {
|
|
return this.curve.validate(this);
|
|
};
|
|
|
|
BaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {
|
|
bytes = utils$3.toArray(bytes, enc);
|
|
|
|
var len = this.p.byteLength();
|
|
|
|
// uncompressed, hybrid-odd, hybrid-even
|
|
if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) &&
|
|
bytes.length - 1 === 2 * len) {
|
|
if (bytes[0] === 0x06)
|
|
assert$1(bytes[bytes.length - 1] % 2 === 0);
|
|
else if (bytes[0] === 0x07)
|
|
assert$1(bytes[bytes.length - 1] % 2 === 1);
|
|
|
|
var res = this.point(bytes.slice(1, 1 + len),
|
|
bytes.slice(1 + len, 1 + 2 * len));
|
|
|
|
return res;
|
|
} else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&
|
|
bytes.length - 1 === len) {
|
|
return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);
|
|
}
|
|
throw new Error('Unknown point format');
|
|
};
|
|
|
|
BasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {
|
|
return this.encode(enc, true);
|
|
};
|
|
|
|
BasePoint.prototype._encode = function _encode(compact) {
|
|
var len = this.curve.p.byteLength();
|
|
var x = this.getX().toArray('be', len);
|
|
|
|
if (compact)
|
|
return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);
|
|
|
|
return [ 0x04 ].concat(x, this.getY().toArray('be', len)) ;
|
|
};
|
|
|
|
BasePoint.prototype.encode = function encode(enc, compact) {
|
|
return utils$3.encode(this._encode(compact), enc);
|
|
};
|
|
|
|
BasePoint.prototype.precompute = function precompute(power) {
|
|
if (this.precomputed)
|
|
return this;
|
|
|
|
var precomputed = {
|
|
doubles: null,
|
|
naf: null,
|
|
beta: null
|
|
};
|
|
precomputed.naf = this._getNAFPoints(8);
|
|
precomputed.doubles = this._getDoubles(4, power);
|
|
precomputed.beta = this._getBeta();
|
|
this.precomputed = precomputed;
|
|
|
|
return this;
|
|
};
|
|
|
|
BasePoint.prototype._hasDoubles = function _hasDoubles(k) {
|
|
if (!this.precomputed)
|
|
return false;
|
|
|
|
var doubles = this.precomputed.doubles;
|
|
if (!doubles)
|
|
return false;
|
|
|
|
return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);
|
|
};
|
|
|
|
BasePoint.prototype._getDoubles = function _getDoubles(step, power) {
|
|
if (this.precomputed && this.precomputed.doubles)
|
|
return this.precomputed.doubles;
|
|
|
|
var doubles = [ this ];
|
|
var acc = this;
|
|
for (var i = 0; i < power; i += step) {
|
|
for (var j = 0; j < step; j++)
|
|
acc = acc.dbl();
|
|
doubles.push(acc);
|
|
}
|
|
return {
|
|
step: step,
|
|
points: doubles
|
|
};
|
|
};
|
|
|
|
BasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {
|
|
if (this.precomputed && this.precomputed.naf)
|
|
return this.precomputed.naf;
|
|
|
|
var res = [ this ];
|
|
var max = (1 << wnd) - 1;
|
|
var dbl = max === 1 ? null : this.dbl();
|
|
for (var i = 1; i < max; i++)
|
|
res[i] = res[i - 1].add(dbl);
|
|
return {
|
|
wnd: wnd,
|
|
points: res
|
|
};
|
|
};
|
|
|
|
BasePoint.prototype._getBeta = function _getBeta() {
|
|
return null;
|
|
};
|
|
|
|
BasePoint.prototype.dblp = function dblp(k) {
|
|
var r = this;
|
|
for (var i = 0; i < k; i++)
|
|
r = r.dbl();
|
|
return r;
|
|
};
|
|
|
|
var Base = curve_1.base;
|
|
|
|
var assert$2 = elliptic_1.utils.assert;
|
|
|
|
function ShortCurve(conf) {
|
|
Base.call(this, 'short', conf);
|
|
|
|
this.a = new bn(conf.a, 16).toRed(this.red);
|
|
this.b = new bn(conf.b, 16).toRed(this.red);
|
|
this.tinv = this.two.redInvm();
|
|
|
|
this.zeroA = this.a.fromRed().cmpn(0) === 0;
|
|
this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;
|
|
|
|
// If the curve is endomorphic, precalculate beta and lambda
|
|
this.endo = this._getEndomorphism(conf);
|
|
this._endoWnafT1 = new Array(4);
|
|
this._endoWnafT2 = new Array(4);
|
|
}
|
|
inherits_browser(ShortCurve, Base);
|
|
var short_1 = ShortCurve;
|
|
|
|
ShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {
|
|
// No efficient endomorphism
|
|
if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)
|
|
return;
|
|
|
|
// Compute beta and lambda, that lambda * P = (beta * Px; Py)
|
|
var beta;
|
|
var lambda;
|
|
if (conf.beta) {
|
|
beta = new bn(conf.beta, 16).toRed(this.red);
|
|
} else {
|
|
var betas = this._getEndoRoots(this.p);
|
|
// Choose the smallest beta
|
|
beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];
|
|
beta = beta.toRed(this.red);
|
|
}
|
|
if (conf.lambda) {
|
|
lambda = new bn(conf.lambda, 16);
|
|
} else {
|
|
// Choose the lambda that is matching selected beta
|
|
var lambdas = this._getEndoRoots(this.n);
|
|
if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {
|
|
lambda = lambdas[0];
|
|
} else {
|
|
lambda = lambdas[1];
|
|
assert$2(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);
|
|
}
|
|
}
|
|
|
|
// Get basis vectors, used for balanced length-two representation
|
|
var basis;
|
|
if (conf.basis) {
|
|
basis = conf.basis.map(function(vec) {
|
|
return {
|
|
a: new bn(vec.a, 16),
|
|
b: new bn(vec.b, 16)
|
|
};
|
|
});
|
|
} else {
|
|
basis = this._getEndoBasis(lambda);
|
|
}
|
|
|
|
return {
|
|
beta: beta,
|
|
lambda: lambda,
|
|
basis: basis
|
|
};
|
|
};
|
|
|
|
ShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {
|
|
// Find roots of for x^2 + x + 1 in F
|
|
// Root = (-1 +- Sqrt(-3)) / 2
|
|
//
|
|
var red = num === this.p ? this.red : bn.mont(num);
|
|
var tinv = new bn(2).toRed(red).redInvm();
|
|
var ntinv = tinv.redNeg();
|
|
|
|
var s = new bn(3).toRed(red).redNeg().redSqrt().redMul(tinv);
|
|
|
|
var l1 = ntinv.redAdd(s).fromRed();
|
|
var l2 = ntinv.redSub(s).fromRed();
|
|
return [ l1, l2 ];
|
|
};
|
|
|
|
ShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {
|
|
// aprxSqrt >= sqrt(this.n)
|
|
var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));
|
|
|
|
// 3.74
|
|
// Run EGCD, until r(L + 1) < aprxSqrt
|
|
var u = lambda;
|
|
var v = this.n.clone();
|
|
var x1 = new bn(1);
|
|
var y1 = new bn(0);
|
|
var x2 = new bn(0);
|
|
var y2 = new bn(1);
|
|
|
|
// NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)
|
|
var a0;
|
|
var b0;
|
|
// First vector
|
|
var a1;
|
|
var b1;
|
|
// Second vector
|
|
var a2;
|
|
var b2;
|
|
|
|
var prevR;
|
|
var i = 0;
|
|
var r;
|
|
var x;
|
|
while (u.cmpn(0) !== 0) {
|
|
var q = v.div(u);
|
|
r = v.sub(q.mul(u));
|
|
x = x2.sub(q.mul(x1));
|
|
var y = y2.sub(q.mul(y1));
|
|
|
|
if (!a1 && r.cmp(aprxSqrt) < 0) {
|
|
a0 = prevR.neg();
|
|
b0 = x1;
|
|
a1 = r.neg();
|
|
b1 = x;
|
|
} else if (a1 && ++i === 2) {
|
|
break;
|
|
}
|
|
prevR = r;
|
|
|
|
v = u;
|
|
u = r;
|
|
x2 = x1;
|
|
x1 = x;
|
|
y2 = y1;
|
|
y1 = y;
|
|
}
|
|
a2 = r.neg();
|
|
b2 = x;
|
|
|
|
var len1 = a1.sqr().add(b1.sqr());
|
|
var len2 = a2.sqr().add(b2.sqr());
|
|
if (len2.cmp(len1) >= 0) {
|
|
a2 = a0;
|
|
b2 = b0;
|
|
}
|
|
|
|
// Normalize signs
|
|
if (a1.negative) {
|
|
a1 = a1.neg();
|
|
b1 = b1.neg();
|
|
}
|
|
if (a2.negative) {
|
|
a2 = a2.neg();
|
|
b2 = b2.neg();
|
|
}
|
|
|
|
return [
|
|
{ a: a1, b: b1 },
|
|
{ a: a2, b: b2 }
|
|
];
|
|
};
|
|
|
|
ShortCurve.prototype._endoSplit = function _endoSplit(k) {
|
|
var basis = this.endo.basis;
|
|
var v1 = basis[0];
|
|
var v2 = basis[1];
|
|
|
|
var c1 = v2.b.mul(k).divRound(this.n);
|
|
var c2 = v1.b.neg().mul(k).divRound(this.n);
|
|
|
|
var p1 = c1.mul(v1.a);
|
|
var p2 = c2.mul(v2.a);
|
|
var q1 = c1.mul(v1.b);
|
|
var q2 = c2.mul(v2.b);
|
|
|
|
// Calculate answer
|
|
var k1 = k.sub(p1).sub(p2);
|
|
var k2 = q1.add(q2).neg();
|
|
return { k1: k1, k2: k2 };
|
|
};
|
|
|
|
ShortCurve.prototype.pointFromX = function pointFromX(x, odd) {
|
|
x = new bn(x, 16);
|
|
if (!x.red)
|
|
x = x.toRed(this.red);
|
|
|
|
var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);
|
|
var y = y2.redSqrt();
|
|
if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)
|
|
throw new Error('invalid point');
|
|
|
|
// XXX Is there any way to tell if the number is odd without converting it
|
|
// to non-red form?
|
|
var isOdd = y.fromRed().isOdd();
|
|
if (odd && !isOdd || !odd && isOdd)
|
|
y = y.redNeg();
|
|
|
|
return this.point(x, y);
|
|
};
|
|
|
|
ShortCurve.prototype.validate = function validate(point) {
|
|
if (point.inf)
|
|
return true;
|
|
|
|
var x = point.x;
|
|
var y = point.y;
|
|
|
|
var ax = this.a.redMul(x);
|
|
var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);
|
|
return y.redSqr().redISub(rhs).cmpn(0) === 0;
|
|
};
|
|
|
|
ShortCurve.prototype._endoWnafMulAdd =
|
|
function _endoWnafMulAdd(points, coeffs, jacobianResult) {
|
|
var npoints = this._endoWnafT1;
|
|
var ncoeffs = this._endoWnafT2;
|
|
for (var i = 0; i < points.length; i++) {
|
|
var split = this._endoSplit(coeffs[i]);
|
|
var p = points[i];
|
|
var beta = p._getBeta();
|
|
|
|
if (split.k1.negative) {
|
|
split.k1.ineg();
|
|
p = p.neg(true);
|
|
}
|
|
if (split.k2.negative) {
|
|
split.k2.ineg();
|
|
beta = beta.neg(true);
|
|
}
|
|
|
|
npoints[i * 2] = p;
|
|
npoints[i * 2 + 1] = beta;
|
|
ncoeffs[i * 2] = split.k1;
|
|
ncoeffs[i * 2 + 1] = split.k2;
|
|
}
|
|
var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult);
|
|
|
|
// Clean-up references to points and coefficients
|
|
for (var j = 0; j < i * 2; j++) {
|
|
npoints[j] = null;
|
|
ncoeffs[j] = null;
|
|
}
|
|
return res;
|
|
};
|
|
|
|
function Point(curve, x, y, isRed) {
|
|
Base.BasePoint.call(this, curve, 'affine');
|
|
if (x === null && y === null) {
|
|
this.x = null;
|
|
this.y = null;
|
|
this.inf = true;
|
|
} else {
|
|
this.x = new bn(x, 16);
|
|
this.y = new bn(y, 16);
|
|
// Force redgomery representation when loading from JSON
|
|
if (isRed) {
|
|
this.x.forceRed(this.curve.red);
|
|
this.y.forceRed(this.curve.red);
|
|
}
|
|
if (!this.x.red)
|
|
this.x = this.x.toRed(this.curve.red);
|
|
if (!this.y.red)
|
|
this.y = this.y.toRed(this.curve.red);
|
|
this.inf = false;
|
|
}
|
|
}
|
|
inherits_browser(Point, Base.BasePoint);
|
|
|
|
ShortCurve.prototype.point = function point(x, y, isRed) {
|
|
return new Point(this, x, y, isRed);
|
|
};
|
|
|
|
ShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {
|
|
return Point.fromJSON(this, obj, red);
|
|
};
|
|
|
|
Point.prototype._getBeta = function _getBeta() {
|
|
if (!this.curve.endo)
|
|
return;
|
|
|
|
var pre = this.precomputed;
|
|
if (pre && pre.beta)
|
|
return pre.beta;
|
|
|
|
var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);
|
|
if (pre) {
|
|
var curve = this.curve;
|
|
var endoMul = function(p) {
|
|
return curve.point(p.x.redMul(curve.endo.beta), p.y);
|
|
};
|
|
pre.beta = beta;
|
|
beta.precomputed = {
|
|
beta: null,
|
|
naf: pre.naf && {
|
|
wnd: pre.naf.wnd,
|
|
points: pre.naf.points.map(endoMul)
|
|
},
|
|
doubles: pre.doubles && {
|
|
step: pre.doubles.step,
|
|
points: pre.doubles.points.map(endoMul)
|
|
}
|
|
};
|
|
}
|
|
return beta;
|
|
};
|
|
|
|
Point.prototype.toJSON = function toJSON() {
|
|
if (!this.precomputed)
|
|
return [ this.x, this.y ];
|
|
|
|
return [ this.x, this.y, this.precomputed && {
|
|
doubles: this.precomputed.doubles && {
|
|
step: this.precomputed.doubles.step,
|
|
points: this.precomputed.doubles.points.slice(1)
|
|
},
|
|
naf: this.precomputed.naf && {
|
|
wnd: this.precomputed.naf.wnd,
|
|
points: this.precomputed.naf.points.slice(1)
|
|
}
|
|
} ];
|
|
};
|
|
|
|
Point.fromJSON = function fromJSON(curve, obj, red) {
|
|
if (typeof obj === 'string')
|
|
obj = JSON.parse(obj);
|
|
var res = curve.point(obj[0], obj[1], red);
|
|
if (!obj[2])
|
|
return res;
|
|
|
|
function obj2point(obj) {
|
|
return curve.point(obj[0], obj[1], red);
|
|
}
|
|
|
|
var pre = obj[2];
|
|
res.precomputed = {
|
|
beta: null,
|
|
doubles: pre.doubles && {
|
|
step: pre.doubles.step,
|
|
points: [ res ].concat(pre.doubles.points.map(obj2point))
|
|
},
|
|
naf: pre.naf && {
|
|
wnd: pre.naf.wnd,
|
|
points: [ res ].concat(pre.naf.points.map(obj2point))
|
|
}
|
|
};
|
|
return res;
|
|
};
|
|
|
|
Point.prototype.inspect = function inspect() {
|
|
if (this.isInfinity())
|
|
return '<EC Point Infinity>';
|
|
return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +
|
|
' y: ' + this.y.fromRed().toString(16, 2) + '>';
|
|
};
|
|
|
|
Point.prototype.isInfinity = function isInfinity() {
|
|
return this.inf;
|
|
};
|
|
|
|
Point.prototype.add = function add(p) {
|
|
// O + P = P
|
|
if (this.inf)
|
|
return p;
|
|
|
|
// P + O = P
|
|
if (p.inf)
|
|
return this;
|
|
|
|
// P + P = 2P
|
|
if (this.eq(p))
|
|
return this.dbl();
|
|
|
|
// P + (-P) = O
|
|
if (this.neg().eq(p))
|
|
return this.curve.point(null, null);
|
|
|
|
// P + Q = O
|
|
if (this.x.cmp(p.x) === 0)
|
|
return this.curve.point(null, null);
|
|
|
|
var c = this.y.redSub(p.y);
|
|
if (c.cmpn(0) !== 0)
|
|
c = c.redMul(this.x.redSub(p.x).redInvm());
|
|
var nx = c.redSqr().redISub(this.x).redISub(p.x);
|
|
var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);
|
|
return this.curve.point(nx, ny);
|
|
};
|
|
|
|
Point.prototype.dbl = function dbl() {
|
|
if (this.inf)
|
|
return this;
|
|
|
|
// 2P = O
|
|
var ys1 = this.y.redAdd(this.y);
|
|
if (ys1.cmpn(0) === 0)
|
|
return this.curve.point(null, null);
|
|
|
|
var a = this.curve.a;
|
|
|
|
var x2 = this.x.redSqr();
|
|
var dyinv = ys1.redInvm();
|
|
var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);
|
|
|
|
var nx = c.redSqr().redISub(this.x.redAdd(this.x));
|
|
var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);
|
|
return this.curve.point(nx, ny);
|
|
};
|
|
|
|
Point.prototype.getX = function getX() {
|
|
return this.x.fromRed();
|
|
};
|
|
|
|
Point.prototype.getY = function getY() {
|
|
return this.y.fromRed();
|
|
};
|
|
|
|
Point.prototype.mul = function mul(k) {
|
|
k = new bn(k, 16);
|
|
|
|
if (this._hasDoubles(k))
|
|
return this.curve._fixedNafMul(this, k);
|
|
else if (this.curve.endo)
|
|
return this.curve._endoWnafMulAdd([ this ], [ k ]);
|
|
else
|
|
return this.curve._wnafMul(this, k);
|
|
};
|
|
|
|
Point.prototype.mulAdd = function mulAdd(k1, p2, k2) {
|
|
var points = [ this, p2 ];
|
|
var coeffs = [ k1, k2 ];
|
|
if (this.curve.endo)
|
|
return this.curve._endoWnafMulAdd(points, coeffs);
|
|
else
|
|
return this.curve._wnafMulAdd(1, points, coeffs, 2);
|
|
};
|
|
|
|
Point.prototype.jmulAdd = function jmulAdd(k1, p2, k2) {
|
|
var points = [ this, p2 ];
|
|
var coeffs = [ k1, k2 ];
|
|
if (this.curve.endo)
|
|
return this.curve._endoWnafMulAdd(points, coeffs, true);
|
|
else
|
|
return this.curve._wnafMulAdd(1, points, coeffs, 2, true);
|
|
};
|
|
|
|
Point.prototype.eq = function eq(p) {
|
|
return this === p ||
|
|
this.inf === p.inf &&
|
|
(this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);
|
|
};
|
|
|
|
Point.prototype.neg = function neg(_precompute) {
|
|
if (this.inf)
|
|
return this;
|
|
|
|
var res = this.curve.point(this.x, this.y.redNeg());
|
|
if (_precompute && this.precomputed) {
|
|
var pre = this.precomputed;
|
|
var negate = function(p) {
|
|
return p.neg();
|
|
};
|
|
res.precomputed = {
|
|
naf: pre.naf && {
|
|
wnd: pre.naf.wnd,
|
|
points: pre.naf.points.map(negate)
|
|
},
|
|
doubles: pre.doubles && {
|
|
step: pre.doubles.step,
|
|
points: pre.doubles.points.map(negate)
|
|
}
|
|
};
|
|
}
|
|
return res;
|
|
};
|
|
|
|
Point.prototype.toJ = function toJ() {
|
|
if (this.inf)
|
|
return this.curve.jpoint(null, null, null);
|
|
|
|
var res = this.curve.jpoint(this.x, this.y, this.curve.one);
|
|
return res;
|
|
};
|
|
|
|
function JPoint(curve, x, y, z) {
|
|
Base.BasePoint.call(this, curve, 'jacobian');
|
|
if (x === null && y === null && z === null) {
|
|
this.x = this.curve.one;
|
|
this.y = this.curve.one;
|
|
this.z = new bn(0);
|
|
} else {
|
|
this.x = new bn(x, 16);
|
|
this.y = new bn(y, 16);
|
|
this.z = new bn(z, 16);
|
|
}
|
|
if (!this.x.red)
|
|
this.x = this.x.toRed(this.curve.red);
|
|
if (!this.y.red)
|
|
this.y = this.y.toRed(this.curve.red);
|
|
if (!this.z.red)
|
|
this.z = this.z.toRed(this.curve.red);
|
|
|
|
this.zOne = this.z === this.curve.one;
|
|
}
|
|
inherits_browser(JPoint, Base.BasePoint);
|
|
|
|
ShortCurve.prototype.jpoint = function jpoint(x, y, z) {
|
|
return new JPoint(this, x, y, z);
|
|
};
|
|
|
|
JPoint.prototype.toP = function toP() {
|
|
if (this.isInfinity())
|
|
return this.curve.point(null, null);
|
|
|
|
var zinv = this.z.redInvm();
|
|
var zinv2 = zinv.redSqr();
|
|
var ax = this.x.redMul(zinv2);
|
|
var ay = this.y.redMul(zinv2).redMul(zinv);
|
|
|
|
return this.curve.point(ax, ay);
|
|
};
|
|
|
|
JPoint.prototype.neg = function neg() {
|
|
return this.curve.jpoint(this.x, this.y.redNeg(), this.z);
|
|
};
|
|
|
|
JPoint.prototype.add = function add(p) {
|
|
// O + P = P
|
|
if (this.isInfinity())
|
|
return p;
|
|
|
|
// P + O = P
|
|
if (p.isInfinity())
|
|
return this;
|
|
|
|
// 12M + 4S + 7A
|
|
var pz2 = p.z.redSqr();
|
|
var z2 = this.z.redSqr();
|
|
var u1 = this.x.redMul(pz2);
|
|
var u2 = p.x.redMul(z2);
|
|
var s1 = this.y.redMul(pz2.redMul(p.z));
|
|
var s2 = p.y.redMul(z2.redMul(this.z));
|
|
|
|
var h = u1.redSub(u2);
|
|
var r = s1.redSub(s2);
|
|
if (h.cmpn(0) === 0) {
|
|
if (r.cmpn(0) !== 0)
|
|
return this.curve.jpoint(null, null, null);
|
|
else
|
|
return this.dbl();
|
|
}
|
|
|
|
var h2 = h.redSqr();
|
|
var h3 = h2.redMul(h);
|
|
var v = u1.redMul(h2);
|
|
|
|
var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);
|
|
var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));
|
|
var nz = this.z.redMul(p.z).redMul(h);
|
|
|
|
return this.curve.jpoint(nx, ny, nz);
|
|
};
|
|
|
|
JPoint.prototype.mixedAdd = function mixedAdd(p) {
|
|
// O + P = P
|
|
if (this.isInfinity())
|
|
return p.toJ();
|
|
|
|
// P + O = P
|
|
if (p.isInfinity())
|
|
return this;
|
|
|
|
// 8M + 3S + 7A
|
|
var z2 = this.z.redSqr();
|
|
var u1 = this.x;
|
|
var u2 = p.x.redMul(z2);
|
|
var s1 = this.y;
|
|
var s2 = p.y.redMul(z2).redMul(this.z);
|
|
|
|
var h = u1.redSub(u2);
|
|
var r = s1.redSub(s2);
|
|
if (h.cmpn(0) === 0) {
|
|
if (r.cmpn(0) !== 0)
|
|
return this.curve.jpoint(null, null, null);
|
|
else
|
|
return this.dbl();
|
|
}
|
|
|
|
var h2 = h.redSqr();
|
|
var h3 = h2.redMul(h);
|
|
var v = u1.redMul(h2);
|
|
|
|
var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);
|
|
var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));
|
|
var nz = this.z.redMul(h);
|
|
|
|
return this.curve.jpoint(nx, ny, nz);
|
|
};
|
|
|
|
JPoint.prototype.dblp = function dblp(pow) {
|
|
if (pow === 0)
|
|
return this;
|
|
if (this.isInfinity())
|
|
return this;
|
|
if (!pow)
|
|
return this.dbl();
|
|
|
|
if (this.curve.zeroA || this.curve.threeA) {
|
|
var r = this;
|
|
for (var i = 0; i < pow; i++)
|
|
r = r.dbl();
|
|
return r;
|
|
}
|
|
|
|
// 1M + 2S + 1A + N * (4S + 5M + 8A)
|
|
// N = 1 => 6M + 6S + 9A
|
|
var a = this.curve.a;
|
|
var tinv = this.curve.tinv;
|
|
|
|
var jx = this.x;
|
|
var jy = this.y;
|
|
var jz = this.z;
|
|
var jz4 = jz.redSqr().redSqr();
|
|
|
|
// Reuse results
|
|
var jyd = jy.redAdd(jy);
|
|
for (var i = 0; i < pow; i++) {
|
|
var jx2 = jx.redSqr();
|
|
var jyd2 = jyd.redSqr();
|
|
var jyd4 = jyd2.redSqr();
|
|
var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));
|
|
|
|
var t1 = jx.redMul(jyd2);
|
|
var nx = c.redSqr().redISub(t1.redAdd(t1));
|
|
var t2 = t1.redISub(nx);
|
|
var dny = c.redMul(t2);
|
|
dny = dny.redIAdd(dny).redISub(jyd4);
|
|
var nz = jyd.redMul(jz);
|
|
if (i + 1 < pow)
|
|
jz4 = jz4.redMul(jyd4);
|
|
|
|
jx = nx;
|
|
jz = nz;
|
|
jyd = dny;
|
|
}
|
|
|
|
return this.curve.jpoint(jx, jyd.redMul(tinv), jz);
|
|
};
|
|
|
|
JPoint.prototype.dbl = function dbl() {
|
|
if (this.isInfinity())
|
|
return this;
|
|
|
|
if (this.curve.zeroA)
|
|
return this._zeroDbl();
|
|
else if (this.curve.threeA)
|
|
return this._threeDbl();
|
|
else
|
|
return this._dbl();
|
|
};
|
|
|
|
JPoint.prototype._zeroDbl = function _zeroDbl() {
|
|
var nx;
|
|
var ny;
|
|
var nz;
|
|
// Z = 1
|
|
if (this.zOne) {
|
|
// hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html
|
|
// #doubling-mdbl-2007-bl
|
|
// 1M + 5S + 14A
|
|
|
|
// XX = X1^2
|
|
var xx = this.x.redSqr();
|
|
// YY = Y1^2
|
|
var yy = this.y.redSqr();
|
|
// YYYY = YY^2
|
|
var yyyy = yy.redSqr();
|
|
// S = 2 * ((X1 + YY)^2 - XX - YYYY)
|
|
var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
|
|
s = s.redIAdd(s);
|
|
// M = 3 * XX + a; a = 0
|
|
var m = xx.redAdd(xx).redIAdd(xx);
|
|
// T = M ^ 2 - 2*S
|
|
var t = m.redSqr().redISub(s).redISub(s);
|
|
|
|
// 8 * YYYY
|
|
var yyyy8 = yyyy.redIAdd(yyyy);
|
|
yyyy8 = yyyy8.redIAdd(yyyy8);
|
|
yyyy8 = yyyy8.redIAdd(yyyy8);
|
|
|
|
// X3 = T
|
|
nx = t;
|
|
// Y3 = M * (S - T) - 8 * YYYY
|
|
ny = m.redMul(s.redISub(t)).redISub(yyyy8);
|
|
// Z3 = 2*Y1
|
|
nz = this.y.redAdd(this.y);
|
|
} else {
|
|
// hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html
|
|
// #doubling-dbl-2009-l
|
|
// 2M + 5S + 13A
|
|
|
|
// A = X1^2
|
|
var a = this.x.redSqr();
|
|
// B = Y1^2
|
|
var b = this.y.redSqr();
|
|
// C = B^2
|
|
var c = b.redSqr();
|
|
// D = 2 * ((X1 + B)^2 - A - C)
|
|
var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);
|
|
d = d.redIAdd(d);
|
|
// E = 3 * A
|
|
var e = a.redAdd(a).redIAdd(a);
|
|
// F = E^2
|
|
var f = e.redSqr();
|
|
|
|
// 8 * C
|
|
var c8 = c.redIAdd(c);
|
|
c8 = c8.redIAdd(c8);
|
|
c8 = c8.redIAdd(c8);
|
|
|
|
// X3 = F - 2 * D
|
|
nx = f.redISub(d).redISub(d);
|
|
// Y3 = E * (D - X3) - 8 * C
|
|
ny = e.redMul(d.redISub(nx)).redISub(c8);
|
|
// Z3 = 2 * Y1 * Z1
|
|
nz = this.y.redMul(this.z);
|
|
nz = nz.redIAdd(nz);
|
|
}
|
|
|
|
return this.curve.jpoint(nx, ny, nz);
|
|
};
|
|
|
|
JPoint.prototype._threeDbl = function _threeDbl() {
|
|
var nx;
|
|
var ny;
|
|
var nz;
|
|
// Z = 1
|
|
if (this.zOne) {
|
|
// hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html
|
|
// #doubling-mdbl-2007-bl
|
|
// 1M + 5S + 15A
|
|
|
|
// XX = X1^2
|
|
var xx = this.x.redSqr();
|
|
// YY = Y1^2
|
|
var yy = this.y.redSqr();
|
|
// YYYY = YY^2
|
|
var yyyy = yy.redSqr();
|
|
// S = 2 * ((X1 + YY)^2 - XX - YYYY)
|
|
var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
|
|
s = s.redIAdd(s);
|
|
// M = 3 * XX + a
|
|
var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);
|
|
// T = M^2 - 2 * S
|
|
var t = m.redSqr().redISub(s).redISub(s);
|
|
// X3 = T
|
|
nx = t;
|
|
// Y3 = M * (S - T) - 8 * YYYY
|
|
var yyyy8 = yyyy.redIAdd(yyyy);
|
|
yyyy8 = yyyy8.redIAdd(yyyy8);
|
|
yyyy8 = yyyy8.redIAdd(yyyy8);
|
|
ny = m.redMul(s.redISub(t)).redISub(yyyy8);
|
|
// Z3 = 2 * Y1
|
|
nz = this.y.redAdd(this.y);
|
|
} else {
|
|
// hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b
|
|
// 3M + 5S
|
|
|
|
// delta = Z1^2
|
|
var delta = this.z.redSqr();
|
|
// gamma = Y1^2
|
|
var gamma = this.y.redSqr();
|
|
// beta = X1 * gamma
|
|
var beta = this.x.redMul(gamma);
|
|
// alpha = 3 * (X1 - delta) * (X1 + delta)
|
|
var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));
|
|
alpha = alpha.redAdd(alpha).redIAdd(alpha);
|
|
// X3 = alpha^2 - 8 * beta
|
|
var beta4 = beta.redIAdd(beta);
|
|
beta4 = beta4.redIAdd(beta4);
|
|
var beta8 = beta4.redAdd(beta4);
|
|
nx = alpha.redSqr().redISub(beta8);
|
|
// Z3 = (Y1 + Z1)^2 - gamma - delta
|
|
nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);
|
|
// Y3 = alpha * (4 * beta - X3) - 8 * gamma^2
|
|
var ggamma8 = gamma.redSqr();
|
|
ggamma8 = ggamma8.redIAdd(ggamma8);
|
|
ggamma8 = ggamma8.redIAdd(ggamma8);
|
|
ggamma8 = ggamma8.redIAdd(ggamma8);
|
|
ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);
|
|
}
|
|
|
|
return this.curve.jpoint(nx, ny, nz);
|
|
};
|
|
|
|
JPoint.prototype._dbl = function _dbl() {
|
|
var a = this.curve.a;
|
|
|
|
// 4M + 6S + 10A
|
|
var jx = this.x;
|
|
var jy = this.y;
|
|
var jz = this.z;
|
|
var jz4 = jz.redSqr().redSqr();
|
|
|
|
var jx2 = jx.redSqr();
|
|
var jy2 = jy.redSqr();
|
|
|
|
var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));
|
|
|
|
var jxd4 = jx.redAdd(jx);
|
|
jxd4 = jxd4.redIAdd(jxd4);
|
|
var t1 = jxd4.redMul(jy2);
|
|
var nx = c.redSqr().redISub(t1.redAdd(t1));
|
|
var t2 = t1.redISub(nx);
|
|
|
|
var jyd8 = jy2.redSqr();
|
|
jyd8 = jyd8.redIAdd(jyd8);
|
|
jyd8 = jyd8.redIAdd(jyd8);
|
|
jyd8 = jyd8.redIAdd(jyd8);
|
|
var ny = c.redMul(t2).redISub(jyd8);
|
|
var nz = jy.redAdd(jy).redMul(jz);
|
|
|
|
return this.curve.jpoint(nx, ny, nz);
|
|
};
|
|
|
|
JPoint.prototype.trpl = function trpl() {
|
|
if (!this.curve.zeroA)
|
|
return this.dbl().add(this);
|
|
|
|
// hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl
|
|
// 5M + 10S + ...
|
|
|
|
// XX = X1^2
|
|
var xx = this.x.redSqr();
|
|
// YY = Y1^2
|
|
var yy = this.y.redSqr();
|
|
// ZZ = Z1^2
|
|
var zz = this.z.redSqr();
|
|
// YYYY = YY^2
|
|
var yyyy = yy.redSqr();
|
|
// M = 3 * XX + a * ZZ2; a = 0
|
|
var m = xx.redAdd(xx).redIAdd(xx);
|
|
// MM = M^2
|
|
var mm = m.redSqr();
|
|
// E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM
|
|
var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
|
|
e = e.redIAdd(e);
|
|
e = e.redAdd(e).redIAdd(e);
|
|
e = e.redISub(mm);
|
|
// EE = E^2
|
|
var ee = e.redSqr();
|
|
// T = 16*YYYY
|
|
var t = yyyy.redIAdd(yyyy);
|
|
t = t.redIAdd(t);
|
|
t = t.redIAdd(t);
|
|
t = t.redIAdd(t);
|
|
// U = (M + E)^2 - MM - EE - T
|
|
var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);
|
|
// X3 = 4 * (X1 * EE - 4 * YY * U)
|
|
var yyu4 = yy.redMul(u);
|
|
yyu4 = yyu4.redIAdd(yyu4);
|
|
yyu4 = yyu4.redIAdd(yyu4);
|
|
var nx = this.x.redMul(ee).redISub(yyu4);
|
|
nx = nx.redIAdd(nx);
|
|
nx = nx.redIAdd(nx);
|
|
// Y3 = 8 * Y1 * (U * (T - U) - E * EE)
|
|
var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));
|
|
ny = ny.redIAdd(ny);
|
|
ny = ny.redIAdd(ny);
|
|
ny = ny.redIAdd(ny);
|
|
// Z3 = (Z1 + E)^2 - ZZ - EE
|
|
var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);
|
|
|
|
return this.curve.jpoint(nx, ny, nz);
|
|
};
|
|
|
|
JPoint.prototype.mul = function mul(k, kbase) {
|
|
k = new bn(k, kbase);
|
|
|
|
return this.curve._wnafMul(this, k);
|
|
};
|
|
|
|
JPoint.prototype.eq = function eq(p) {
|
|
if (p.type === 'affine')
|
|
return this.eq(p.toJ());
|
|
|
|
if (this === p)
|
|
return true;
|
|
|
|
// x1 * z2^2 == x2 * z1^2
|
|
var z2 = this.z.redSqr();
|
|
var pz2 = p.z.redSqr();
|
|
if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)
|
|
return false;
|
|
|
|
// y1 * z2^3 == y2 * z1^3
|
|
var z3 = z2.redMul(this.z);
|
|
var pz3 = pz2.redMul(p.z);
|
|
return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;
|
|
};
|
|
|
|
JPoint.prototype.eqXToP = function eqXToP(x) {
|
|
var zs = this.z.redSqr();
|
|
var rx = x.toRed(this.curve.red).redMul(zs);
|
|
if (this.x.cmp(rx) === 0)
|
|
return true;
|
|
|
|
var xc = x.clone();
|
|
var t = this.curve.redN.redMul(zs);
|
|
for (;;) {
|
|
xc.iadd(this.curve.n);
|
|
if (xc.cmp(this.curve.p) >= 0)
|
|
return false;
|
|
|
|
rx.redIAdd(t);
|
|
if (this.x.cmp(rx) === 0)
|
|
return true;
|
|
}
|
|
};
|
|
|
|
JPoint.prototype.inspect = function inspect() {
|
|
if (this.isInfinity())
|
|
return '<EC JPoint Infinity>';
|
|
return '<EC JPoint x: ' + this.x.toString(16, 2) +
|
|
' y: ' + this.y.toString(16, 2) +
|
|
' z: ' + this.z.toString(16, 2) + '>';
|
|
};
|
|
|
|
JPoint.prototype.isInfinity = function isInfinity() {
|
|
// XXX This code assumes that zero is always zero in red
|
|
return this.z.cmpn(0) === 0;
|
|
};
|
|
|
|
var Base$1 = curve_1.base;
|
|
|
|
|
|
var utils$4 = elliptic_1.utils;
|
|
|
|
function MontCurve(conf) {
|
|
Base$1.call(this, 'mont', conf);
|
|
|
|
this.a = new bn(conf.a, 16).toRed(this.red);
|
|
this.b = new bn(conf.b, 16).toRed(this.red);
|
|
this.i4 = new bn(4).toRed(this.red).redInvm();
|
|
this.two = new bn(2).toRed(this.red);
|
|
this.a24 = this.i4.redMul(this.a.redAdd(this.two));
|
|
}
|
|
inherits_browser(MontCurve, Base$1);
|
|
var mont = MontCurve;
|
|
|
|
MontCurve.prototype.validate = function validate(point) {
|
|
var x = point.normalize().x;
|
|
var x2 = x.redSqr();
|
|
var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x);
|
|
var y = rhs.redSqrt();
|
|
|
|
return y.redSqr().cmp(rhs) === 0;
|
|
};
|
|
|
|
function Point$1(curve, x, z) {
|
|
Base$1.BasePoint.call(this, curve, 'projective');
|
|
if (x === null && z === null) {
|
|
this.x = this.curve.one;
|
|
this.z = this.curve.zero;
|
|
} else {
|
|
this.x = new bn(x, 16);
|
|
this.z = new bn(z, 16);
|
|
if (!this.x.red)
|
|
this.x = this.x.toRed(this.curve.red);
|
|
if (!this.z.red)
|
|
this.z = this.z.toRed(this.curve.red);
|
|
}
|
|
}
|
|
inherits_browser(Point$1, Base$1.BasePoint);
|
|
|
|
MontCurve.prototype.decodePoint = function decodePoint(bytes, enc) {
|
|
return this.point(utils$4.toArray(bytes, enc), 1);
|
|
};
|
|
|
|
MontCurve.prototype.point = function point(x, z) {
|
|
return new Point$1(this, x, z);
|
|
};
|
|
|
|
MontCurve.prototype.pointFromJSON = function pointFromJSON(obj) {
|
|
return Point$1.fromJSON(this, obj);
|
|
};
|
|
|
|
Point$1.prototype.precompute = function precompute() {
|
|
// No-op
|
|
};
|
|
|
|
Point$1.prototype._encode = function _encode() {
|
|
return this.getX().toArray('be', this.curve.p.byteLength());
|
|
};
|
|
|
|
Point$1.fromJSON = function fromJSON(curve, obj) {
|
|
return new Point$1(curve, obj[0], obj[1] || curve.one);
|
|
};
|
|
|
|
Point$1.prototype.inspect = function inspect() {
|
|
if (this.isInfinity())
|
|
return '<EC Point Infinity>';
|
|
return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +
|
|
' z: ' + this.z.fromRed().toString(16, 2) + '>';
|
|
};
|
|
|
|
Point$1.prototype.isInfinity = function isInfinity() {
|
|
// XXX This code assumes that zero is always zero in red
|
|
return this.z.cmpn(0) === 0;
|
|
};
|
|
|
|
Point$1.prototype.dbl = function dbl() {
|
|
// http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3
|
|
// 2M + 2S + 4A
|
|
|
|
// A = X1 + Z1
|
|
var a = this.x.redAdd(this.z);
|
|
// AA = A^2
|
|
var aa = a.redSqr();
|
|
// B = X1 - Z1
|
|
var b = this.x.redSub(this.z);
|
|
// BB = B^2
|
|
var bb = b.redSqr();
|
|
// C = AA - BB
|
|
var c = aa.redSub(bb);
|
|
// X3 = AA * BB
|
|
var nx = aa.redMul(bb);
|
|
// Z3 = C * (BB + A24 * C)
|
|
var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));
|
|
return this.curve.point(nx, nz);
|
|
};
|
|
|
|
Point$1.prototype.add = function add() {
|
|
throw new Error('Not supported on Montgomery curve');
|
|
};
|
|
|
|
Point$1.prototype.diffAdd = function diffAdd(p, diff) {
|
|
// http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3
|
|
// 4M + 2S + 6A
|
|
|
|
// A = X2 + Z2
|
|
var a = this.x.redAdd(this.z);
|
|
// B = X2 - Z2
|
|
var b = this.x.redSub(this.z);
|
|
// C = X3 + Z3
|
|
var c = p.x.redAdd(p.z);
|
|
// D = X3 - Z3
|
|
var d = p.x.redSub(p.z);
|
|
// DA = D * A
|
|
var da = d.redMul(a);
|
|
// CB = C * B
|
|
var cb = c.redMul(b);
|
|
// X5 = Z1 * (DA + CB)^2
|
|
var nx = diff.z.redMul(da.redAdd(cb).redSqr());
|
|
// Z5 = X1 * (DA - CB)^2
|
|
var nz = diff.x.redMul(da.redISub(cb).redSqr());
|
|
return this.curve.point(nx, nz);
|
|
};
|
|
|
|
Point$1.prototype.mul = function mul(k) {
|
|
var t = k.clone();
|
|
var a = this; // (N / 2) * Q + Q
|
|
var b = this.curve.point(null, null); // (N / 2) * Q
|
|
var c = this; // Q
|
|
|
|
for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1))
|
|
bits.push(t.andln(1));
|
|
|
|
for (var i = bits.length - 1; i >= 0; i--) {
|
|
if (bits[i] === 0) {
|
|
// N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q
|
|
a = a.diffAdd(b, c);
|
|
// N * Q = 2 * ((N / 2) * Q + Q))
|
|
b = b.dbl();
|
|
} else {
|
|
// N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q)
|
|
b = a.diffAdd(b, c);
|
|
// N * Q + Q = 2 * ((N / 2) * Q + Q)
|
|
a = a.dbl();
|
|
}
|
|
}
|
|
return b;
|
|
};
|
|
|
|
Point$1.prototype.mulAdd = function mulAdd() {
|
|
throw new Error('Not supported on Montgomery curve');
|
|
};
|
|
|
|
Point$1.prototype.jumlAdd = function jumlAdd() {
|
|
throw new Error('Not supported on Montgomery curve');
|
|
};
|
|
|
|
Point$1.prototype.eq = function eq(other) {
|
|
return this.getX().cmp(other.getX()) === 0;
|
|
};
|
|
|
|
Point$1.prototype.normalize = function normalize() {
|
|
this.x = this.x.redMul(this.z.redInvm());
|
|
this.z = this.curve.one;
|
|
return this;
|
|
};
|
|
|
|
Point$1.prototype.getX = function getX() {
|
|
// Normalize coordinates
|
|
this.normalize();
|
|
|
|
return this.x.fromRed();
|
|
};
|
|
|
|
var Base$2 = curve_1.base;
|
|
|
|
var assert$3 = elliptic_1.utils.assert;
|
|
|
|
function EdwardsCurve(conf) {
|
|
// NOTE: Important as we are creating point in Base.call()
|
|
this.twisted = (conf.a | 0) !== 1;
|
|
this.mOneA = this.twisted && (conf.a | 0) === -1;
|
|
this.extended = this.mOneA;
|
|
|
|
Base$2.call(this, 'edwards', conf);
|
|
|
|
this.a = new bn(conf.a, 16).umod(this.red.m);
|
|
this.a = this.a.toRed(this.red);
|
|
this.c = new bn(conf.c, 16).toRed(this.red);
|
|
this.c2 = this.c.redSqr();
|
|
this.d = new bn(conf.d, 16).toRed(this.red);
|
|
this.dd = this.d.redAdd(this.d);
|
|
|
|
assert$3(!this.twisted || this.c.fromRed().cmpn(1) === 0);
|
|
this.oneC = (conf.c | 0) === 1;
|
|
}
|
|
inherits_browser(EdwardsCurve, Base$2);
|
|
var edwards = EdwardsCurve;
|
|
|
|
EdwardsCurve.prototype._mulA = function _mulA(num) {
|
|
if (this.mOneA)
|
|
return num.redNeg();
|
|
else
|
|
return this.a.redMul(num);
|
|
};
|
|
|
|
EdwardsCurve.prototype._mulC = function _mulC(num) {
|
|
if (this.oneC)
|
|
return num;
|
|
else
|
|
return this.c.redMul(num);
|
|
};
|
|
|
|
// Just for compatibility with Short curve
|
|
EdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) {
|
|
return this.point(x, y, z, t);
|
|
};
|
|
|
|
EdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) {
|
|
x = new bn(x, 16);
|
|
if (!x.red)
|
|
x = x.toRed(this.red);
|
|
|
|
var x2 = x.redSqr();
|
|
var rhs = this.c2.redSub(this.a.redMul(x2));
|
|
var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2));
|
|
|
|
var y2 = rhs.redMul(lhs.redInvm());
|
|
var y = y2.redSqrt();
|
|
if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)
|
|
throw new Error('invalid point');
|
|
|
|
var isOdd = y.fromRed().isOdd();
|
|
if (odd && !isOdd || !odd && isOdd)
|
|
y = y.redNeg();
|
|
|
|
return this.point(x, y);
|
|
};
|
|
|
|
EdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) {
|
|
y = new bn(y, 16);
|
|
if (!y.red)
|
|
y = y.toRed(this.red);
|
|
|
|
// x^2 = (y^2 - c^2) / (c^2 d y^2 - a)
|
|
var y2 = y.redSqr();
|
|
var lhs = y2.redSub(this.c2);
|
|
var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a);
|
|
var x2 = lhs.redMul(rhs.redInvm());
|
|
|
|
if (x2.cmp(this.zero) === 0) {
|
|
if (odd)
|
|
throw new Error('invalid point');
|
|
else
|
|
return this.point(this.zero, y);
|
|
}
|
|
|
|
var x = x2.redSqrt();
|
|
if (x.redSqr().redSub(x2).cmp(this.zero) !== 0)
|
|
throw new Error('invalid point');
|
|
|
|
if (x.fromRed().isOdd() !== odd)
|
|
x = x.redNeg();
|
|
|
|
return this.point(x, y);
|
|
};
|
|
|
|
EdwardsCurve.prototype.validate = function validate(point) {
|
|
if (point.isInfinity())
|
|
return true;
|
|
|
|
// Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2)
|
|
point.normalize();
|
|
|
|
var x2 = point.x.redSqr();
|
|
var y2 = point.y.redSqr();
|
|
var lhs = x2.redMul(this.a).redAdd(y2);
|
|
var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));
|
|
|
|
return lhs.cmp(rhs) === 0;
|
|
};
|
|
|
|
function Point$2(curve, x, y, z, t) {
|
|
Base$2.BasePoint.call(this, curve, 'projective');
|
|
if (x === null && y === null && z === null) {
|
|
this.x = this.curve.zero;
|
|
this.y = this.curve.one;
|
|
this.z = this.curve.one;
|
|
this.t = this.curve.zero;
|
|
this.zOne = true;
|
|
} else {
|
|
this.x = new bn(x, 16);
|
|
this.y = new bn(y, 16);
|
|
this.z = z ? new bn(z, 16) : this.curve.one;
|
|
this.t = t && new bn(t, 16);
|
|
if (!this.x.red)
|
|
this.x = this.x.toRed(this.curve.red);
|
|
if (!this.y.red)
|
|
this.y = this.y.toRed(this.curve.red);
|
|
if (!this.z.red)
|
|
this.z = this.z.toRed(this.curve.red);
|
|
if (this.t && !this.t.red)
|
|
this.t = this.t.toRed(this.curve.red);
|
|
this.zOne = this.z === this.curve.one;
|
|
|
|
// Use extended coordinates
|
|
if (this.curve.extended && !this.t) {
|
|
this.t = this.x.redMul(this.y);
|
|
if (!this.zOne)
|
|
this.t = this.t.redMul(this.z.redInvm());
|
|
}
|
|
}
|
|
}
|
|
inherits_browser(Point$2, Base$2.BasePoint);
|
|
|
|
EdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) {
|
|
return Point$2.fromJSON(this, obj);
|
|
};
|
|
|
|
EdwardsCurve.prototype.point = function point(x, y, z, t) {
|
|
return new Point$2(this, x, y, z, t);
|
|
};
|
|
|
|
Point$2.fromJSON = function fromJSON(curve, obj) {
|
|
return new Point$2(curve, obj[0], obj[1], obj[2]);
|
|
};
|
|
|
|
Point$2.prototype.inspect = function inspect() {
|
|
if (this.isInfinity())
|
|
return '<EC Point Infinity>';
|
|
return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +
|
|
' y: ' + this.y.fromRed().toString(16, 2) +
|
|
' z: ' + this.z.fromRed().toString(16, 2) + '>';
|
|
};
|
|
|
|
Point$2.prototype.isInfinity = function isInfinity() {
|
|
// XXX This code assumes that zero is always zero in red
|
|
return this.x.cmpn(0) === 0 &&
|
|
(this.y.cmp(this.z) === 0 ||
|
|
(this.zOne && this.y.cmp(this.curve.c) === 0));
|
|
};
|
|
|
|
Point$2.prototype._extDbl = function _extDbl() {
|
|
// hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html
|
|
// #doubling-dbl-2008-hwcd
|
|
// 4M + 4S
|
|
|
|
// A = X1^2
|
|
var a = this.x.redSqr();
|
|
// B = Y1^2
|
|
var b = this.y.redSqr();
|
|
// C = 2 * Z1^2
|
|
var c = this.z.redSqr();
|
|
c = c.redIAdd(c);
|
|
// D = a * A
|
|
var d = this.curve._mulA(a);
|
|
// E = (X1 + Y1)^2 - A - B
|
|
var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);
|
|
// G = D + B
|
|
var g = d.redAdd(b);
|
|
// F = G - C
|
|
var f = g.redSub(c);
|
|
// H = D - B
|
|
var h = d.redSub(b);
|
|
// X3 = E * F
|
|
var nx = e.redMul(f);
|
|
// Y3 = G * H
|
|
var ny = g.redMul(h);
|
|
// T3 = E * H
|
|
var nt = e.redMul(h);
|
|
// Z3 = F * G
|
|
var nz = f.redMul(g);
|
|
return this.curve.point(nx, ny, nz, nt);
|
|
};
|
|
|
|
Point$2.prototype._projDbl = function _projDbl() {
|
|
// hyperelliptic.org/EFD/g1p/auto-twisted-projective.html
|
|
// #doubling-dbl-2008-bbjlp
|
|
// #doubling-dbl-2007-bl
|
|
// and others
|
|
// Generally 3M + 4S or 2M + 4S
|
|
|
|
// B = (X1 + Y1)^2
|
|
var b = this.x.redAdd(this.y).redSqr();
|
|
// C = X1^2
|
|
var c = this.x.redSqr();
|
|
// D = Y1^2
|
|
var d = this.y.redSqr();
|
|
|
|
var nx;
|
|
var ny;
|
|
var nz;
|
|
if (this.curve.twisted) {
|
|
// E = a * C
|
|
var e = this.curve._mulA(c);
|
|
// F = E + D
|
|
var f = e.redAdd(d);
|
|
if (this.zOne) {
|
|
// X3 = (B - C - D) * (F - 2)
|
|
nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two));
|
|
// Y3 = F * (E - D)
|
|
ny = f.redMul(e.redSub(d));
|
|
// Z3 = F^2 - 2 * F
|
|
nz = f.redSqr().redSub(f).redSub(f);
|
|
} else {
|
|
// H = Z1^2
|
|
var h = this.z.redSqr();
|
|
// J = F - 2 * H
|
|
var j = f.redSub(h).redISub(h);
|
|
// X3 = (B-C-D)*J
|
|
nx = b.redSub(c).redISub(d).redMul(j);
|
|
// Y3 = F * (E - D)
|
|
ny = f.redMul(e.redSub(d));
|
|
// Z3 = F * J
|
|
nz = f.redMul(j);
|
|
}
|
|
} else {
|
|
// E = C + D
|
|
var e = c.redAdd(d);
|
|
// H = (c * Z1)^2
|
|
var h = this.curve._mulC(this.z).redSqr();
|
|
// J = E - 2 * H
|
|
var j = e.redSub(h).redSub(h);
|
|
// X3 = c * (B - E) * J
|
|
nx = this.curve._mulC(b.redISub(e)).redMul(j);
|
|
// Y3 = c * E * (C - D)
|
|
ny = this.curve._mulC(e).redMul(c.redISub(d));
|
|
// Z3 = E * J
|
|
nz = e.redMul(j);
|
|
}
|
|
return this.curve.point(nx, ny, nz);
|
|
};
|
|
|
|
Point$2.prototype.dbl = function dbl() {
|
|
if (this.isInfinity())
|
|
return this;
|
|
|
|
// Double in extended coordinates
|
|
if (this.curve.extended)
|
|
return this._extDbl();
|
|
else
|
|
return this._projDbl();
|
|
};
|
|
|
|
Point$2.prototype._extAdd = function _extAdd(p) {
|
|
// hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html
|
|
// #addition-add-2008-hwcd-3
|
|
// 8M
|
|
|
|
// A = (Y1 - X1) * (Y2 - X2)
|
|
var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));
|
|
// B = (Y1 + X1) * (Y2 + X2)
|
|
var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));
|
|
// C = T1 * k * T2
|
|
var c = this.t.redMul(this.curve.dd).redMul(p.t);
|
|
// D = Z1 * 2 * Z2
|
|
var d = this.z.redMul(p.z.redAdd(p.z));
|
|
// E = B - A
|
|
var e = b.redSub(a);
|
|
// F = D - C
|
|
var f = d.redSub(c);
|
|
// G = D + C
|
|
var g = d.redAdd(c);
|
|
// H = B + A
|
|
var h = b.redAdd(a);
|
|
// X3 = E * F
|
|
var nx = e.redMul(f);
|
|
// Y3 = G * H
|
|
var ny = g.redMul(h);
|
|
// T3 = E * H
|
|
var nt = e.redMul(h);
|
|
// Z3 = F * G
|
|
var nz = f.redMul(g);
|
|
return this.curve.point(nx, ny, nz, nt);
|
|
};
|
|
|
|
Point$2.prototype._projAdd = function _projAdd(p) {
|
|
// hyperelliptic.org/EFD/g1p/auto-twisted-projective.html
|
|
// #addition-add-2008-bbjlp
|
|
// #addition-add-2007-bl
|
|
// 10M + 1S
|
|
|
|
// A = Z1 * Z2
|
|
var a = this.z.redMul(p.z);
|
|
// B = A^2
|
|
var b = a.redSqr();
|
|
// C = X1 * X2
|
|
var c = this.x.redMul(p.x);
|
|
// D = Y1 * Y2
|
|
var d = this.y.redMul(p.y);
|
|
// E = d * C * D
|
|
var e = this.curve.d.redMul(c).redMul(d);
|
|
// F = B - E
|
|
var f = b.redSub(e);
|
|
// G = B + E
|
|
var g = b.redAdd(e);
|
|
// X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D)
|
|
var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d);
|
|
var nx = a.redMul(f).redMul(tmp);
|
|
var ny;
|
|
var nz;
|
|
if (this.curve.twisted) {
|
|
// Y3 = A * G * (D - a * C)
|
|
ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)));
|
|
// Z3 = F * G
|
|
nz = f.redMul(g);
|
|
} else {
|
|
// Y3 = A * G * (D - C)
|
|
ny = a.redMul(g).redMul(d.redSub(c));
|
|
// Z3 = c * F * G
|
|
nz = this.curve._mulC(f).redMul(g);
|
|
}
|
|
return this.curve.point(nx, ny, nz);
|
|
};
|
|
|
|
Point$2.prototype.add = function add(p) {
|
|
if (this.isInfinity())
|
|
return p;
|
|
if (p.isInfinity())
|
|
return this;
|
|
|
|
if (this.curve.extended)
|
|
return this._extAdd(p);
|
|
else
|
|
return this._projAdd(p);
|
|
};
|
|
|
|
Point$2.prototype.mul = function mul(k) {
|
|
if (this._hasDoubles(k))
|
|
return this.curve._fixedNafMul(this, k);
|
|
else
|
|
return this.curve._wnafMul(this, k);
|
|
};
|
|
|
|
Point$2.prototype.mulAdd = function mulAdd(k1, p, k2) {
|
|
return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false);
|
|
};
|
|
|
|
Point$2.prototype.jmulAdd = function jmulAdd(k1, p, k2) {
|
|
return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true);
|
|
};
|
|
|
|
Point$2.prototype.normalize = function normalize() {
|
|
if (this.zOne)
|
|
return this;
|
|
|
|
// Normalize coordinates
|
|
var zi = this.z.redInvm();
|
|
this.x = this.x.redMul(zi);
|
|
this.y = this.y.redMul(zi);
|
|
if (this.t)
|
|
this.t = this.t.redMul(zi);
|
|
this.z = this.curve.one;
|
|
this.zOne = true;
|
|
return this;
|
|
};
|
|
|
|
Point$2.prototype.neg = function neg() {
|
|
return this.curve.point(this.x.redNeg(),
|
|
this.y,
|
|
this.z,
|
|
this.t && this.t.redNeg());
|
|
};
|
|
|
|
Point$2.prototype.getX = function getX() {
|
|
this.normalize();
|
|
return this.x.fromRed();
|
|
};
|
|
|
|
Point$2.prototype.getY = function getY() {
|
|
this.normalize();
|
|
return this.y.fromRed();
|
|
};
|
|
|
|
Point$2.prototype.eq = function eq(other) {
|
|
return this === other ||
|
|
this.getX().cmp(other.getX()) === 0 &&
|
|
this.getY().cmp(other.getY()) === 0;
|
|
};
|
|
|
|
Point$2.prototype.eqXToP = function eqXToP(x) {
|
|
var rx = x.toRed(this.curve.red).redMul(this.z);
|
|
if (this.x.cmp(rx) === 0)
|
|
return true;
|
|
|
|
var xc = x.clone();
|
|
var t = this.curve.redN.redMul(this.z);
|
|
for (;;) {
|
|
xc.iadd(this.curve.n);
|
|
if (xc.cmp(this.curve.p) >= 0)
|
|
return false;
|
|
|
|
rx.redIAdd(t);
|
|
if (this.x.cmp(rx) === 0)
|
|
return true;
|
|
}
|
|
};
|
|
|
|
// Compatibility with BaseCurve
|
|
Point$2.prototype.toP = Point$2.prototype.normalize;
|
|
Point$2.prototype.mixedAdd = Point$2.prototype.add;
|
|
|
|
var curve_1 = createCommonjsModule(function (module, exports) {
|
|
|
|
var curve = exports;
|
|
|
|
curve.base = base;
|
|
curve.short = short_1;
|
|
curve.mont = mont;
|
|
curve.edwards = edwards;
|
|
});
|
|
|
|
var inherits_1 = inherits_browser;
|
|
|
|
function isSurrogatePair(msg, i) {
|
|
if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) {
|
|
return false;
|
|
}
|
|
if (i < 0 || i + 1 >= msg.length) {
|
|
return false;
|
|
}
|
|
return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;
|
|
}
|
|
|
|
function toArray$1(msg, enc) {
|
|
if (Array.isArray(msg))
|
|
return msg.slice();
|
|
if (!msg)
|
|
return [];
|
|
var res = [];
|
|
if (typeof msg === 'string') {
|
|
if (!enc) {
|
|
// Inspired by stringToUtf8ByteArray() in closure-library by Google
|
|
// https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143
|
|
// Apache License 2.0
|
|
// https://github.com/google/closure-library/blob/master/LICENSE
|
|
var p = 0;
|
|
for (var i = 0; i < msg.length; i++) {
|
|
var c = msg.charCodeAt(i);
|
|
if (c < 128) {
|
|
res[p++] = c;
|
|
} else if (c < 2048) {
|
|
res[p++] = (c >> 6) | 192;
|
|
res[p++] = (c & 63) | 128;
|
|
} else if (isSurrogatePair(msg, i)) {
|
|
c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF);
|
|
res[p++] = (c >> 18) | 240;
|
|
res[p++] = ((c >> 12) & 63) | 128;
|
|
res[p++] = ((c >> 6) & 63) | 128;
|
|
res[p++] = (c & 63) | 128;
|
|
} else {
|
|
res[p++] = (c >> 12) | 224;
|
|
res[p++] = ((c >> 6) & 63) | 128;
|
|
res[p++] = (c & 63) | 128;
|
|
}
|
|
}
|
|
} else if (enc === 'hex') {
|
|
msg = msg.replace(/[^a-z0-9]+/ig, '');
|
|
if (msg.length % 2 !== 0)
|
|
msg = '0' + msg;
|
|
for (i = 0; i < msg.length; i += 2)
|
|
res.push(parseInt(msg[i] + msg[i + 1], 16));
|
|
}
|
|
} else {
|
|
for (i = 0; i < msg.length; i++)
|
|
res[i] = msg[i] | 0;
|
|
}
|
|
return res;
|
|
}
|
|
var toArray_1 = toArray$1;
|
|
|
|
function toHex(msg) {
|
|
var res = '';
|
|
for (var i = 0; i < msg.length; i++)
|
|
res += zero2(msg[i].toString(16));
|
|
return res;
|
|
}
|
|
var toHex_1 = toHex;
|
|
|
|
function htonl(w) {
|
|
var res = (w >>> 24) |
|
|
((w >>> 8) & 0xff00) |
|
|
((w << 8) & 0xff0000) |
|
|
((w & 0xff) << 24);
|
|
return res >>> 0;
|
|
}
|
|
var htonl_1 = htonl;
|
|
|
|
function toHex32(msg, endian) {
|
|
var res = '';
|
|
for (var i = 0; i < msg.length; i++) {
|
|
var w = msg[i];
|
|
if (endian === 'little')
|
|
w = htonl(w);
|
|
res += zero8(w.toString(16));
|
|
}
|
|
return res;
|
|
}
|
|
var toHex32_1 = toHex32;
|
|
|
|
function zero2(word) {
|
|
if (word.length === 1)
|
|
return '0' + word;
|
|
else
|
|
return word;
|
|
}
|
|
var zero2_1 = zero2;
|
|
|
|
function zero8(word) {
|
|
if (word.length === 7)
|
|
return '0' + word;
|
|
else if (word.length === 6)
|
|
return '00' + word;
|
|
else if (word.length === 5)
|
|
return '000' + word;
|
|
else if (word.length === 4)
|
|
return '0000' + word;
|
|
else if (word.length === 3)
|
|
return '00000' + word;
|
|
else if (word.length === 2)
|
|
return '000000' + word;
|
|
else if (word.length === 1)
|
|
return '0000000' + word;
|
|
else
|
|
return word;
|
|
}
|
|
var zero8_1 = zero8;
|
|
|
|
function join32(msg, start, end, endian) {
|
|
var len = end - start;
|
|
minimalisticAssert(len % 4 === 0);
|
|
var res = new Array(len / 4);
|
|
for (var i = 0, k = start; i < res.length; i++, k += 4) {
|
|
var w;
|
|
if (endian === 'big')
|
|
w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];
|
|
else
|
|
w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];
|
|
res[i] = w >>> 0;
|
|
}
|
|
return res;
|
|
}
|
|
var join32_1 = join32;
|
|
|
|
function split32(msg, endian) {
|
|
var res = new Array(msg.length * 4);
|
|
for (var i = 0, k = 0; i < msg.length; i++, k += 4) {
|
|
var m = msg[i];
|
|
if (endian === 'big') {
|
|
res[k] = m >>> 24;
|
|
res[k + 1] = (m >>> 16) & 0xff;
|
|
res[k + 2] = (m >>> 8) & 0xff;
|
|
res[k + 3] = m & 0xff;
|
|
} else {
|
|
res[k + 3] = m >>> 24;
|
|
res[k + 2] = (m >>> 16) & 0xff;
|
|
res[k + 1] = (m >>> 8) & 0xff;
|
|
res[k] = m & 0xff;
|
|
}
|
|
}
|
|
return res;
|
|
}
|
|
var split32_1 = split32;
|
|
|
|
function rotr32(w, b) {
|
|
return (w >>> b) | (w << (32 - b));
|
|
}
|
|
var rotr32_1 = rotr32;
|
|
|
|
function rotl32(w, b) {
|
|
return (w << b) | (w >>> (32 - b));
|
|
}
|
|
var rotl32_1 = rotl32;
|
|
|
|
function sum32(a, b) {
|
|
return (a + b) >>> 0;
|
|
}
|
|
var sum32_1 = sum32;
|
|
|
|
function sum32_3(a, b, c) {
|
|
return (a + b + c) >>> 0;
|
|
}
|
|
var sum32_3_1 = sum32_3;
|
|
|
|
function sum32_4(a, b, c, d) {
|
|
return (a + b + c + d) >>> 0;
|
|
}
|
|
var sum32_4_1 = sum32_4;
|
|
|
|
function sum32_5(a, b, c, d, e) {
|
|
return (a + b + c + d + e) >>> 0;
|
|
}
|
|
var sum32_5_1 = sum32_5;
|
|
|
|
function sum64(buf, pos, ah, al) {
|
|
var bh = buf[pos];
|
|
var bl = buf[pos + 1];
|
|
|
|
var lo = (al + bl) >>> 0;
|
|
var hi = (lo < al ? 1 : 0) + ah + bh;
|
|
buf[pos] = hi >>> 0;
|
|
buf[pos + 1] = lo;
|
|
}
|
|
var sum64_1 = sum64;
|
|
|
|
function sum64_hi(ah, al, bh, bl) {
|
|
var lo = (al + bl) >>> 0;
|
|
var hi = (lo < al ? 1 : 0) + ah + bh;
|
|
return hi >>> 0;
|
|
}
|
|
var sum64_hi_1 = sum64_hi;
|
|
|
|
function sum64_lo(ah, al, bh, bl) {
|
|
var lo = al + bl;
|
|
return lo >>> 0;
|
|
}
|
|
var sum64_lo_1 = sum64_lo;
|
|
|
|
function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {
|
|
var carry = 0;
|
|
var lo = al;
|
|
lo = (lo + bl) >>> 0;
|
|
carry += lo < al ? 1 : 0;
|
|
lo = (lo + cl) >>> 0;
|
|
carry += lo < cl ? 1 : 0;
|
|
lo = (lo + dl) >>> 0;
|
|
carry += lo < dl ? 1 : 0;
|
|
|
|
var hi = ah + bh + ch + dh + carry;
|
|
return hi >>> 0;
|
|
}
|
|
var sum64_4_hi_1 = sum64_4_hi;
|
|
|
|
function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {
|
|
var lo = al + bl + cl + dl;
|
|
return lo >>> 0;
|
|
}
|
|
var sum64_4_lo_1 = sum64_4_lo;
|
|
|
|
function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {
|
|
var carry = 0;
|
|
var lo = al;
|
|
lo = (lo + bl) >>> 0;
|
|
carry += lo < al ? 1 : 0;
|
|
lo = (lo + cl) >>> 0;
|
|
carry += lo < cl ? 1 : 0;
|
|
lo = (lo + dl) >>> 0;
|
|
carry += lo < dl ? 1 : 0;
|
|
lo = (lo + el) >>> 0;
|
|
carry += lo < el ? 1 : 0;
|
|
|
|
var hi = ah + bh + ch + dh + eh + carry;
|
|
return hi >>> 0;
|
|
}
|
|
var sum64_5_hi_1 = sum64_5_hi;
|
|
|
|
function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {
|
|
var lo = al + bl + cl + dl + el;
|
|
|
|
return lo >>> 0;
|
|
}
|
|
var sum64_5_lo_1 = sum64_5_lo;
|
|
|
|
function rotr64_hi(ah, al, num) {
|
|
var r = (al << (32 - num)) | (ah >>> num);
|
|
return r >>> 0;
|
|
}
|
|
var rotr64_hi_1 = rotr64_hi;
|
|
|
|
function rotr64_lo(ah, al, num) {
|
|
var r = (ah << (32 - num)) | (al >>> num);
|
|
return r >>> 0;
|
|
}
|
|
var rotr64_lo_1 = rotr64_lo;
|
|
|
|
function shr64_hi(ah, al, num) {
|
|
return ah >>> num;
|
|
}
|
|
var shr64_hi_1 = shr64_hi;
|
|
|
|
function shr64_lo(ah, al, num) {
|
|
var r = (ah << (32 - num)) | (al >>> num);
|
|
return r >>> 0;
|
|
}
|
|
var shr64_lo_1 = shr64_lo;
|
|
|
|
var utils$5 = {
|
|
inherits: inherits_1,
|
|
toArray: toArray_1,
|
|
toHex: toHex_1,
|
|
htonl: htonl_1,
|
|
toHex32: toHex32_1,
|
|
zero2: zero2_1,
|
|
zero8: zero8_1,
|
|
join32: join32_1,
|
|
split32: split32_1,
|
|
rotr32: rotr32_1,
|
|
rotl32: rotl32_1,
|
|
sum32: sum32_1,
|
|
sum32_3: sum32_3_1,
|
|
sum32_4: sum32_4_1,
|
|
sum32_5: sum32_5_1,
|
|
sum64: sum64_1,
|
|
sum64_hi: sum64_hi_1,
|
|
sum64_lo: sum64_lo_1,
|
|
sum64_4_hi: sum64_4_hi_1,
|
|
sum64_4_lo: sum64_4_lo_1,
|
|
sum64_5_hi: sum64_5_hi_1,
|
|
sum64_5_lo: sum64_5_lo_1,
|
|
rotr64_hi: rotr64_hi_1,
|
|
rotr64_lo: rotr64_lo_1,
|
|
shr64_hi: shr64_hi_1,
|
|
shr64_lo: shr64_lo_1
|
|
};
|
|
|
|
function BlockHash() {
|
|
this.pending = null;
|
|
this.pendingTotal = 0;
|
|
this.blockSize = this.constructor.blockSize;
|
|
this.outSize = this.constructor.outSize;
|
|
this.hmacStrength = this.constructor.hmacStrength;
|
|
this.padLength = this.constructor.padLength / 8;
|
|
this.endian = 'big';
|
|
|
|
this._delta8 = this.blockSize / 8;
|
|
this._delta32 = this.blockSize / 32;
|
|
}
|
|
var BlockHash_1 = BlockHash;
|
|
|
|
BlockHash.prototype.update = function update(msg, enc) {
|
|
// Convert message to array, pad it, and join into 32bit blocks
|
|
msg = utils$5.toArray(msg, enc);
|
|
if (!this.pending)
|
|
this.pending = msg;
|
|
else
|
|
this.pending = this.pending.concat(msg);
|
|
this.pendingTotal += msg.length;
|
|
|
|
// Enough data, try updating
|
|
if (this.pending.length >= this._delta8) {
|
|
msg = this.pending;
|
|
|
|
// Process pending data in blocks
|
|
var r = msg.length % this._delta8;
|
|
this.pending = msg.slice(msg.length - r, msg.length);
|
|
if (this.pending.length === 0)
|
|
this.pending = null;
|
|
|
|
msg = utils$5.join32(msg, 0, msg.length - r, this.endian);
|
|
for (var i = 0; i < msg.length; i += this._delta32)
|
|
this._update(msg, i, i + this._delta32);
|
|
}
|
|
|
|
return this;
|
|
};
|
|
|
|
BlockHash.prototype.digest = function digest(enc) {
|
|
this.update(this._pad());
|
|
minimalisticAssert(this.pending === null);
|
|
|
|
return this._digest(enc);
|
|
};
|
|
|
|
BlockHash.prototype._pad = function pad() {
|
|
var len = this.pendingTotal;
|
|
var bytes = this._delta8;
|
|
var k = bytes - ((len + this.padLength) % bytes);
|
|
var res = new Array(k + this.padLength);
|
|
res[0] = 0x80;
|
|
for (var i = 1; i < k; i++)
|
|
res[i] = 0;
|
|
|
|
// Append length
|
|
len <<= 3;
|
|
if (this.endian === 'big') {
|
|
for (var t = 8; t < this.padLength; t++)
|
|
res[i++] = 0;
|
|
|
|
res[i++] = 0;
|
|
res[i++] = 0;
|
|
res[i++] = 0;
|
|
res[i++] = 0;
|
|
res[i++] = (len >>> 24) & 0xff;
|
|
res[i++] = (len >>> 16) & 0xff;
|
|
res[i++] = (len >>> 8) & 0xff;
|
|
res[i++] = len & 0xff;
|
|
} else {
|
|
res[i++] = len & 0xff;
|
|
res[i++] = (len >>> 8) & 0xff;
|
|
res[i++] = (len >>> 16) & 0xff;
|
|
res[i++] = (len >>> 24) & 0xff;
|
|
res[i++] = 0;
|
|
res[i++] = 0;
|
|
res[i++] = 0;
|
|
res[i++] = 0;
|
|
|
|
for (t = 8; t < this.padLength; t++)
|
|
res[i++] = 0;
|
|
}
|
|
|
|
return res;
|
|
};
|
|
|
|
var common = {
|
|
BlockHash: BlockHash_1
|
|
};
|
|
|
|
var rotr32$1 = utils$5.rotr32;
|
|
|
|
function ft_1(s, x, y, z) {
|
|
if (s === 0)
|
|
return ch32(x, y, z);
|
|
if (s === 1 || s === 3)
|
|
return p32(x, y, z);
|
|
if (s === 2)
|
|
return maj32(x, y, z);
|
|
}
|
|
var ft_1_1 = ft_1;
|
|
|
|
function ch32(x, y, z) {
|
|
return (x & y) ^ ((~x) & z);
|
|
}
|
|
var ch32_1 = ch32;
|
|
|
|
function maj32(x, y, z) {
|
|
return (x & y) ^ (x & z) ^ (y & z);
|
|
}
|
|
var maj32_1 = maj32;
|
|
|
|
function p32(x, y, z) {
|
|
return x ^ y ^ z;
|
|
}
|
|
var p32_1 = p32;
|
|
|
|
function s0_256(x) {
|
|
return rotr32$1(x, 2) ^ rotr32$1(x, 13) ^ rotr32$1(x, 22);
|
|
}
|
|
var s0_256_1 = s0_256;
|
|
|
|
function s1_256(x) {
|
|
return rotr32$1(x, 6) ^ rotr32$1(x, 11) ^ rotr32$1(x, 25);
|
|
}
|
|
var s1_256_1 = s1_256;
|
|
|
|
function g0_256(x) {
|
|
return rotr32$1(x, 7) ^ rotr32$1(x, 18) ^ (x >>> 3);
|
|
}
|
|
var g0_256_1 = g0_256;
|
|
|
|
function g1_256(x) {
|
|
return rotr32$1(x, 17) ^ rotr32$1(x, 19) ^ (x >>> 10);
|
|
}
|
|
var g1_256_1 = g1_256;
|
|
|
|
var common$1 = {
|
|
ft_1: ft_1_1,
|
|
ch32: ch32_1,
|
|
maj32: maj32_1,
|
|
p32: p32_1,
|
|
s0_256: s0_256_1,
|
|
s1_256: s1_256_1,
|
|
g0_256: g0_256_1,
|
|
g1_256: g1_256_1
|
|
};
|
|
|
|
var rotl32$1 = utils$5.rotl32;
|
|
var sum32$1 = utils$5.sum32;
|
|
var sum32_5$1 = utils$5.sum32_5;
|
|
var ft_1$1 = common$1.ft_1;
|
|
var BlockHash$1 = common.BlockHash;
|
|
|
|
var sha1_K = [
|
|
0x5A827999, 0x6ED9EBA1,
|
|
0x8F1BBCDC, 0xCA62C1D6
|
|
];
|
|
|
|
function SHA1() {
|
|
if (!(this instanceof SHA1))
|
|
return new SHA1();
|
|
|
|
BlockHash$1.call(this);
|
|
this.h = [
|
|
0x67452301, 0xefcdab89, 0x98badcfe,
|
|
0x10325476, 0xc3d2e1f0 ];
|
|
this.W = new Array(80);
|
|
}
|
|
|
|
utils$5.inherits(SHA1, BlockHash$1);
|
|
var _1 = SHA1;
|
|
|
|
SHA1.blockSize = 512;
|
|
SHA1.outSize = 160;
|
|
SHA1.hmacStrength = 80;
|
|
SHA1.padLength = 64;
|
|
|
|
SHA1.prototype._update = function _update(msg, start) {
|
|
var W = this.W;
|
|
|
|
for (var i = 0; i < 16; i++)
|
|
W[i] = msg[start + i];
|
|
|
|
for(; i < W.length; i++)
|
|
W[i] = rotl32$1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
|
|
|
|
var a = this.h[0];
|
|
var b = this.h[1];
|
|
var c = this.h[2];
|
|
var d = this.h[3];
|
|
var e = this.h[4];
|
|
|
|
for (i = 0; i < W.length; i++) {
|
|
var s = ~~(i / 20);
|
|
var t = sum32_5$1(rotl32$1(a, 5), ft_1$1(s, b, c, d), e, W[i], sha1_K[s]);
|
|
e = d;
|
|
d = c;
|
|
c = rotl32$1(b, 30);
|
|
b = a;
|
|
a = t;
|
|
}
|
|
|
|
this.h[0] = sum32$1(this.h[0], a);
|
|
this.h[1] = sum32$1(this.h[1], b);
|
|
this.h[2] = sum32$1(this.h[2], c);
|
|
this.h[3] = sum32$1(this.h[3], d);
|
|
this.h[4] = sum32$1(this.h[4], e);
|
|
};
|
|
|
|
SHA1.prototype._digest = function digest(enc) {
|
|
if (enc === 'hex')
|
|
return utils$5.toHex32(this.h, 'big');
|
|
else
|
|
return utils$5.split32(this.h, 'big');
|
|
};
|
|
|
|
var sum32$2 = utils$5.sum32;
|
|
var sum32_4$1 = utils$5.sum32_4;
|
|
var sum32_5$2 = utils$5.sum32_5;
|
|
var ch32$1 = common$1.ch32;
|
|
var maj32$1 = common$1.maj32;
|
|
var s0_256$1 = common$1.s0_256;
|
|
var s1_256$1 = common$1.s1_256;
|
|
var g0_256$1 = common$1.g0_256;
|
|
var g1_256$1 = common$1.g1_256;
|
|
|
|
var BlockHash$2 = common.BlockHash;
|
|
|
|
var sha256_K = [
|
|
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
|
|
0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
|
|
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
|
|
0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
|
|
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
|
|
0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
|
|
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
|
|
0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
|
|
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
|
|
0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
|
|
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
|
|
0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
|
|
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
|
|
0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
|
|
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
|
|
0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
|
|
];
|
|
|
|
function SHA256() {
|
|
if (!(this instanceof SHA256))
|
|
return new SHA256();
|
|
|
|
BlockHash$2.call(this);
|
|
this.h = [
|
|
0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
|
|
0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
|
|
];
|
|
this.k = sha256_K;
|
|
this.W = new Array(64);
|
|
}
|
|
utils$5.inherits(SHA256, BlockHash$2);
|
|
var _256 = SHA256;
|
|
|
|
SHA256.blockSize = 512;
|
|
SHA256.outSize = 256;
|
|
SHA256.hmacStrength = 192;
|
|
SHA256.padLength = 64;
|
|
|
|
SHA256.prototype._update = function _update(msg, start) {
|
|
var W = this.W;
|
|
|
|
for (var i = 0; i < 16; i++)
|
|
W[i] = msg[start + i];
|
|
for (; i < W.length; i++)
|
|
W[i] = sum32_4$1(g1_256$1(W[i - 2]), W[i - 7], g0_256$1(W[i - 15]), W[i - 16]);
|
|
|
|
var a = this.h[0];
|
|
var b = this.h[1];
|
|
var c = this.h[2];
|
|
var d = this.h[3];
|
|
var e = this.h[4];
|
|
var f = this.h[5];
|
|
var g = this.h[6];
|
|
var h = this.h[7];
|
|
|
|
minimalisticAssert(this.k.length === W.length);
|
|
for (i = 0; i < W.length; i++) {
|
|
var T1 = sum32_5$2(h, s1_256$1(e), ch32$1(e, f, g), this.k[i], W[i]);
|
|
var T2 = sum32$2(s0_256$1(a), maj32$1(a, b, c));
|
|
h = g;
|
|
g = f;
|
|
f = e;
|
|
e = sum32$2(d, T1);
|
|
d = c;
|
|
c = b;
|
|
b = a;
|
|
a = sum32$2(T1, T2);
|
|
}
|
|
|
|
this.h[0] = sum32$2(this.h[0], a);
|
|
this.h[1] = sum32$2(this.h[1], b);
|
|
this.h[2] = sum32$2(this.h[2], c);
|
|
this.h[3] = sum32$2(this.h[3], d);
|
|
this.h[4] = sum32$2(this.h[4], e);
|
|
this.h[5] = sum32$2(this.h[5], f);
|
|
this.h[6] = sum32$2(this.h[6], g);
|
|
this.h[7] = sum32$2(this.h[7], h);
|
|
};
|
|
|
|
SHA256.prototype._digest = function digest(enc) {
|
|
if (enc === 'hex')
|
|
return utils$5.toHex32(this.h, 'big');
|
|
else
|
|
return utils$5.split32(this.h, 'big');
|
|
};
|
|
|
|
function SHA224() {
|
|
if (!(this instanceof SHA224))
|
|
return new SHA224();
|
|
|
|
_256.call(this);
|
|
this.h = [
|
|
0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,
|
|
0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];
|
|
}
|
|
utils$5.inherits(SHA224, _256);
|
|
var _224 = SHA224;
|
|
|
|
SHA224.blockSize = 512;
|
|
SHA224.outSize = 224;
|
|
SHA224.hmacStrength = 192;
|
|
SHA224.padLength = 64;
|
|
|
|
SHA224.prototype._digest = function digest(enc) {
|
|
// Just truncate output
|
|
if (enc === 'hex')
|
|
return utils$5.toHex32(this.h.slice(0, 7), 'big');
|
|
else
|
|
return utils$5.split32(this.h.slice(0, 7), 'big');
|
|
};
|
|
|
|
var rotr64_hi$1 = utils$5.rotr64_hi;
|
|
var rotr64_lo$1 = utils$5.rotr64_lo;
|
|
var shr64_hi$1 = utils$5.shr64_hi;
|
|
var shr64_lo$1 = utils$5.shr64_lo;
|
|
var sum64$1 = utils$5.sum64;
|
|
var sum64_hi$1 = utils$5.sum64_hi;
|
|
var sum64_lo$1 = utils$5.sum64_lo;
|
|
var sum64_4_hi$1 = utils$5.sum64_4_hi;
|
|
var sum64_4_lo$1 = utils$5.sum64_4_lo;
|
|
var sum64_5_hi$1 = utils$5.sum64_5_hi;
|
|
var sum64_5_lo$1 = utils$5.sum64_5_lo;
|
|
|
|
var BlockHash$3 = common.BlockHash;
|
|
|
|
var sha512_K = [
|
|
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 SHA512() {
|
|
if (!(this instanceof SHA512))
|
|
return new SHA512();
|
|
|
|
BlockHash$3.call(this);
|
|
this.h = [
|
|
0x6a09e667, 0xf3bcc908,
|
|
0xbb67ae85, 0x84caa73b,
|
|
0x3c6ef372, 0xfe94f82b,
|
|
0xa54ff53a, 0x5f1d36f1,
|
|
0x510e527f, 0xade682d1,
|
|
0x9b05688c, 0x2b3e6c1f,
|
|
0x1f83d9ab, 0xfb41bd6b,
|
|
0x5be0cd19, 0x137e2179 ];
|
|
this.k = sha512_K;
|
|
this.W = new Array(160);
|
|
}
|
|
utils$5.inherits(SHA512, BlockHash$3);
|
|
var _512 = SHA512;
|
|
|
|
SHA512.blockSize = 1024;
|
|
SHA512.outSize = 512;
|
|
SHA512.hmacStrength = 192;
|
|
SHA512.padLength = 128;
|
|
|
|
SHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {
|
|
var W = this.W;
|
|
|
|
// 32 x 32bit words
|
|
for (var i = 0; i < 32; i++)
|
|
W[i] = msg[start + i];
|
|
for (; i < W.length; i += 2) {
|
|
var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2
|
|
var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);
|
|
var c1_hi = W[i - 14]; // i - 7
|
|
var c1_lo = W[i - 13];
|
|
var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15
|
|
var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);
|
|
var c3_hi = W[i - 32]; // i - 16
|
|
var c3_lo = W[i - 31];
|
|
|
|
W[i] = sum64_4_hi$1(
|
|
c0_hi, c0_lo,
|
|
c1_hi, c1_lo,
|
|
c2_hi, c2_lo,
|
|
c3_hi, c3_lo);
|
|
W[i + 1] = sum64_4_lo$1(
|
|
c0_hi, c0_lo,
|
|
c1_hi, c1_lo,
|
|
c2_hi, c2_lo,
|
|
c3_hi, c3_lo);
|
|
}
|
|
};
|
|
|
|
SHA512.prototype._update = function _update(msg, start) {
|
|
this._prepareBlock(msg, start);
|
|
|
|
var W = this.W;
|
|
|
|
var ah = this.h[0];
|
|
var al = this.h[1];
|
|
var bh = this.h[2];
|
|
var bl = this.h[3];
|
|
var ch = this.h[4];
|
|
var cl = this.h[5];
|
|
var dh = this.h[6];
|
|
var dl = this.h[7];
|
|
var eh = this.h[8];
|
|
var el = this.h[9];
|
|
var fh = this.h[10];
|
|
var fl = this.h[11];
|
|
var gh = this.h[12];
|
|
var gl = this.h[13];
|
|
var hh = this.h[14];
|
|
var hl = this.h[15];
|
|
|
|
minimalisticAssert(this.k.length === W.length);
|
|
for (var i = 0; i < W.length; i += 2) {
|
|
var c0_hi = hh;
|
|
var c0_lo = hl;
|
|
var c1_hi = s1_512_hi(eh, el);
|
|
var c1_lo = s1_512_lo(eh, el);
|
|
var c2_hi = ch64_hi(eh, el, fh, fl, gh);
|
|
var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);
|
|
var c3_hi = this.k[i];
|
|
var c3_lo = this.k[i + 1];
|
|
var c4_hi = W[i];
|
|
var c4_lo = W[i + 1];
|
|
|
|
var T1_hi = sum64_5_hi$1(
|
|
c0_hi, c0_lo,
|
|
c1_hi, c1_lo,
|
|
c2_hi, c2_lo,
|
|
c3_hi, c3_lo,
|
|
c4_hi, c4_lo);
|
|
var T1_lo = sum64_5_lo$1(
|
|
c0_hi, c0_lo,
|
|
c1_hi, c1_lo,
|
|
c2_hi, c2_lo,
|
|
c3_hi, c3_lo,
|
|
c4_hi, c4_lo);
|
|
|
|
c0_hi = s0_512_hi(ah, al);
|
|
c0_lo = s0_512_lo(ah, al);
|
|
c1_hi = maj64_hi(ah, al, bh, bl, ch);
|
|
c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);
|
|
|
|
var T2_hi = sum64_hi$1(c0_hi, c0_lo, c1_hi, c1_lo);
|
|
var T2_lo = sum64_lo$1(c0_hi, c0_lo, c1_hi, c1_lo);
|
|
|
|
hh = gh;
|
|
hl = gl;
|
|
|
|
gh = fh;
|
|
gl = fl;
|
|
|
|
fh = eh;
|
|
fl = el;
|
|
|
|
eh = sum64_hi$1(dh, dl, T1_hi, T1_lo);
|
|
el = sum64_lo$1(dl, dl, T1_hi, T1_lo);
|
|
|
|
dh = ch;
|
|
dl = cl;
|
|
|
|
ch = bh;
|
|
cl = bl;
|
|
|
|
bh = ah;
|
|
bl = al;
|
|
|
|
ah = sum64_hi$1(T1_hi, T1_lo, T2_hi, T2_lo);
|
|
al = sum64_lo$1(T1_hi, T1_lo, T2_hi, T2_lo);
|
|
}
|
|
|
|
sum64$1(this.h, 0, ah, al);
|
|
sum64$1(this.h, 2, bh, bl);
|
|
sum64$1(this.h, 4, ch, cl);
|
|
sum64$1(this.h, 6, dh, dl);
|
|
sum64$1(this.h, 8, eh, el);
|
|
sum64$1(this.h, 10, fh, fl);
|
|
sum64$1(this.h, 12, gh, gl);
|
|
sum64$1(this.h, 14, hh, hl);
|
|
};
|
|
|
|
SHA512.prototype._digest = function digest(enc) {
|
|
if (enc === 'hex')
|
|
return utils$5.toHex32(this.h, 'big');
|
|
else
|
|
return utils$5.split32(this.h, 'big');
|
|
};
|
|
|
|
function ch64_hi(xh, xl, yh, yl, zh) {
|
|
var r = (xh & yh) ^ ((~xh) & zh);
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function ch64_lo(xh, xl, yh, yl, zh, zl) {
|
|
var r = (xl & yl) ^ ((~xl) & zl);
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function maj64_hi(xh, xl, yh, yl, zh) {
|
|
var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function maj64_lo(xh, xl, yh, yl, zh, zl) {
|
|
var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function s0_512_hi(xh, xl) {
|
|
var c0_hi = rotr64_hi$1(xh, xl, 28);
|
|
var c1_hi = rotr64_hi$1(xl, xh, 2); // 34
|
|
var c2_hi = rotr64_hi$1(xl, xh, 7); // 39
|
|
|
|
var r = c0_hi ^ c1_hi ^ c2_hi;
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function s0_512_lo(xh, xl) {
|
|
var c0_lo = rotr64_lo$1(xh, xl, 28);
|
|
var c1_lo = rotr64_lo$1(xl, xh, 2); // 34
|
|
var c2_lo = rotr64_lo$1(xl, xh, 7); // 39
|
|
|
|
var r = c0_lo ^ c1_lo ^ c2_lo;
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function s1_512_hi(xh, xl) {
|
|
var c0_hi = rotr64_hi$1(xh, xl, 14);
|
|
var c1_hi = rotr64_hi$1(xh, xl, 18);
|
|
var c2_hi = rotr64_hi$1(xl, xh, 9); // 41
|
|
|
|
var r = c0_hi ^ c1_hi ^ c2_hi;
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function s1_512_lo(xh, xl) {
|
|
var c0_lo = rotr64_lo$1(xh, xl, 14);
|
|
var c1_lo = rotr64_lo$1(xh, xl, 18);
|
|
var c2_lo = rotr64_lo$1(xl, xh, 9); // 41
|
|
|
|
var r = c0_lo ^ c1_lo ^ c2_lo;
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function g0_512_hi(xh, xl) {
|
|
var c0_hi = rotr64_hi$1(xh, xl, 1);
|
|
var c1_hi = rotr64_hi$1(xh, xl, 8);
|
|
var c2_hi = shr64_hi$1(xh, xl, 7);
|
|
|
|
var r = c0_hi ^ c1_hi ^ c2_hi;
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function g0_512_lo(xh, xl) {
|
|
var c0_lo = rotr64_lo$1(xh, xl, 1);
|
|
var c1_lo = rotr64_lo$1(xh, xl, 8);
|
|
var c2_lo = shr64_lo$1(xh, xl, 7);
|
|
|
|
var r = c0_lo ^ c1_lo ^ c2_lo;
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function g1_512_hi(xh, xl) {
|
|
var c0_hi = rotr64_hi$1(xh, xl, 19);
|
|
var c1_hi = rotr64_hi$1(xl, xh, 29); // 61
|
|
var c2_hi = shr64_hi$1(xh, xl, 6);
|
|
|
|
var r = c0_hi ^ c1_hi ^ c2_hi;
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function g1_512_lo(xh, xl) {
|
|
var c0_lo = rotr64_lo$1(xh, xl, 19);
|
|
var c1_lo = rotr64_lo$1(xl, xh, 29); // 61
|
|
var c2_lo = shr64_lo$1(xh, xl, 6);
|
|
|
|
var r = c0_lo ^ c1_lo ^ c2_lo;
|
|
if (r < 0)
|
|
r += 0x100000000;
|
|
return r;
|
|
}
|
|
|
|
function SHA384() {
|
|
if (!(this instanceof SHA384))
|
|
return new SHA384();
|
|
|
|
_512.call(this);
|
|
this.h = [
|
|
0xcbbb9d5d, 0xc1059ed8,
|
|
0x629a292a, 0x367cd507,
|
|
0x9159015a, 0x3070dd17,
|
|
0x152fecd8, 0xf70e5939,
|
|
0x67332667, 0xffc00b31,
|
|
0x8eb44a87, 0x68581511,
|
|
0xdb0c2e0d, 0x64f98fa7,
|
|
0x47b5481d, 0xbefa4fa4 ];
|
|
}
|
|
utils$5.inherits(SHA384, _512);
|
|
var _384 = SHA384;
|
|
|
|
SHA384.blockSize = 1024;
|
|
SHA384.outSize = 384;
|
|
SHA384.hmacStrength = 192;
|
|
SHA384.padLength = 128;
|
|
|
|
SHA384.prototype._digest = function digest(enc) {
|
|
if (enc === 'hex')
|
|
return utils$5.toHex32(this.h.slice(0, 12), 'big');
|
|
else
|
|
return utils$5.split32(this.h.slice(0, 12), 'big');
|
|
};
|
|
|
|
var sha1$1 = _1;
|
|
var sha224$2 = _224;
|
|
var sha256$2 = _256;
|
|
var sha384$2 = _384;
|
|
var sha512$2 = _512;
|
|
|
|
var sha$1 = {
|
|
sha1: sha1$1,
|
|
sha224: sha224$2,
|
|
sha256: sha256$2,
|
|
sha384: sha384$2,
|
|
sha512: sha512$2
|
|
};
|
|
|
|
var rotl32$2 = utils$5.rotl32;
|
|
var sum32$3 = utils$5.sum32;
|
|
var sum32_3$1 = utils$5.sum32_3;
|
|
var sum32_4$2 = utils$5.sum32_4;
|
|
var BlockHash$4 = common.BlockHash;
|
|
|
|
function RIPEMD160$1() {
|
|
if (!(this instanceof RIPEMD160$1))
|
|
return new RIPEMD160$1();
|
|
|
|
BlockHash$4.call(this);
|
|
|
|
this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];
|
|
this.endian = 'little';
|
|
}
|
|
utils$5.inherits(RIPEMD160$1, BlockHash$4);
|
|
var ripemd160$1 = RIPEMD160$1;
|
|
|
|
RIPEMD160$1.blockSize = 512;
|
|
RIPEMD160$1.outSize = 160;
|
|
RIPEMD160$1.hmacStrength = 192;
|
|
RIPEMD160$1.padLength = 64;
|
|
|
|
RIPEMD160$1.prototype._update = function update(msg, start) {
|
|
var A = this.h[0];
|
|
var B = this.h[1];
|
|
var C = this.h[2];
|
|
var D = this.h[3];
|
|
var E = this.h[4];
|
|
var Ah = A;
|
|
var Bh = B;
|
|
var Ch = C;
|
|
var Dh = D;
|
|
var Eh = E;
|
|
for (var j = 0; j < 80; j++) {
|
|
var T = sum32$3(
|
|
rotl32$2(
|
|
sum32_4$2(A, f(j, B, C, D), msg[r$1[j] + start], K$4(j)),
|
|
s[j]),
|
|
E);
|
|
A = E;
|
|
E = D;
|
|
D = rotl32$2(C, 10);
|
|
C = B;
|
|
B = T;
|
|
T = sum32$3(
|
|
rotl32$2(
|
|
sum32_4$2(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),
|
|
sh[j]),
|
|
Eh);
|
|
Ah = Eh;
|
|
Eh = Dh;
|
|
Dh = rotl32$2(Ch, 10);
|
|
Ch = Bh;
|
|
Bh = T;
|
|
}
|
|
T = sum32_3$1(this.h[1], C, Dh);
|
|
this.h[1] = sum32_3$1(this.h[2], D, Eh);
|
|
this.h[2] = sum32_3$1(this.h[3], E, Ah);
|
|
this.h[3] = sum32_3$1(this.h[4], A, Bh);
|
|
this.h[4] = sum32_3$1(this.h[0], B, Ch);
|
|
this.h[0] = T;
|
|
};
|
|
|
|
RIPEMD160$1.prototype._digest = function digest(enc) {
|
|
if (enc === 'hex')
|
|
return utils$5.toHex32(this.h, 'little');
|
|
else
|
|
return utils$5.split32(this.h, 'little');
|
|
};
|
|
|
|
function f(j, x, y, z) {
|
|
if (j <= 15)
|
|
return x ^ y ^ z;
|
|
else if (j <= 31)
|
|
return (x & y) | ((~x) & z);
|
|
else if (j <= 47)
|
|
return (x | (~y)) ^ z;
|
|
else if (j <= 63)
|
|
return (x & z) | (y & (~z));
|
|
else
|
|
return x ^ (y | (~z));
|
|
}
|
|
|
|
function K$4(j) {
|
|
if (j <= 15)
|
|
return 0x00000000;
|
|
else if (j <= 31)
|
|
return 0x5a827999;
|
|
else if (j <= 47)
|
|
return 0x6ed9eba1;
|
|
else if (j <= 63)
|
|
return 0x8f1bbcdc;
|
|
else
|
|
return 0xa953fd4e;
|
|
}
|
|
|
|
function Kh(j) {
|
|
if (j <= 15)
|
|
return 0x50a28be6;
|
|
else if (j <= 31)
|
|
return 0x5c4dd124;
|
|
else if (j <= 47)
|
|
return 0x6d703ef3;
|
|
else if (j <= 63)
|
|
return 0x7a6d76e9;
|
|
else
|
|
return 0x00000000;
|
|
}
|
|
|
|
var r$1 = [
|
|
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
|
|
];
|
|
|
|
var rh = [
|
|
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
|
|
];
|
|
|
|
var s = [
|
|
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
|
|
];
|
|
|
|
var sh = [
|
|
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
|
|
];
|
|
|
|
var ripemd = {
|
|
ripemd160: ripemd160$1
|
|
};
|
|
|
|
function Hmac$3(hash, key, enc) {
|
|
if (!(this instanceof Hmac$3))
|
|
return new Hmac$3(hash, key, enc);
|
|
this.Hash = hash;
|
|
this.blockSize = hash.blockSize / 8;
|
|
this.outSize = hash.outSize / 8;
|
|
this.inner = null;
|
|
this.outer = null;
|
|
|
|
this._init(utils$5.toArray(key, enc));
|
|
}
|
|
var hmac = Hmac$3;
|
|
|
|
Hmac$3.prototype._init = function init(key) {
|
|
// Shorten key, if needed
|
|
if (key.length > this.blockSize)
|
|
key = new this.Hash().update(key).digest();
|
|
minimalisticAssert(key.length <= this.blockSize);
|
|
|
|
// Add padding to key
|
|
for (var i = key.length; i < this.blockSize; i++)
|
|
key.push(0);
|
|
|
|
for (i = 0; i < key.length; i++)
|
|
key[i] ^= 0x36;
|
|
this.inner = new this.Hash().update(key);
|
|
|
|
// 0x36 ^ 0x5c = 0x6a
|
|
for (i = 0; i < key.length; i++)
|
|
key[i] ^= 0x6a;
|
|
this.outer = new this.Hash().update(key);
|
|
};
|
|
|
|
Hmac$3.prototype.update = function update(msg, enc) {
|
|
this.inner.update(msg, enc);
|
|
return this;
|
|
};
|
|
|
|
Hmac$3.prototype.digest = function digest(enc) {
|
|
this.outer.update(this.inner.digest());
|
|
return this.outer.digest(enc);
|
|
};
|
|
|
|
var hash_1 = createCommonjsModule(function (module, exports) {
|
|
var hash = exports;
|
|
|
|
hash.utils = utils$5;
|
|
hash.common = common;
|
|
hash.sha = sha$1;
|
|
hash.ripemd = ripemd;
|
|
hash.hmac = hmac;
|
|
|
|
// Proxy hash functions to the main object
|
|
hash.sha1 = hash.sha.sha1;
|
|
hash.sha256 = hash.sha.sha256;
|
|
hash.sha224 = hash.sha.sha224;
|
|
hash.sha384 = hash.sha.sha384;
|
|
hash.sha512 = hash.sha.sha512;
|
|
hash.ripemd160 = hash.ripemd.ripemd160;
|
|
});
|
|
|
|
var secp256k1 = {
|
|
doubles: {
|
|
step: 4,
|
|
points: [
|
|
[
|
|
'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a',
|
|
'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821'
|
|
],
|
|
[
|
|
'8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508',
|
|
'11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf'
|
|
],
|
|
[
|
|
'175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739',
|
|
'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695'
|
|
],
|
|
[
|
|
'363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640',
|
|
'4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9'
|
|
],
|
|
[
|
|
'8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c',
|
|
'4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36'
|
|
],
|
|
[
|
|
'723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda',
|
|
'96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f'
|
|
],
|
|
[
|
|
'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa',
|
|
'5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999'
|
|
],
|
|
[
|
|
'100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0',
|
|
'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09'
|
|
],
|
|
[
|
|
'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d',
|
|
'9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d'
|
|
],
|
|
[
|
|
'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d',
|
|
'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088'
|
|
],
|
|
[
|
|
'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1',
|
|
'9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d'
|
|
],
|
|
[
|
|
'53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0',
|
|
'5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8'
|
|
],
|
|
[
|
|
'8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047',
|
|
'10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a'
|
|
],
|
|
[
|
|
'385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862',
|
|
'283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453'
|
|
],
|
|
[
|
|
'6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7',
|
|
'7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160'
|
|
],
|
|
[
|
|
'3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd',
|
|
'56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0'
|
|
],
|
|
[
|
|
'85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83',
|
|
'7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6'
|
|
],
|
|
[
|
|
'948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a',
|
|
'53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589'
|
|
],
|
|
[
|
|
'6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8',
|
|
'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17'
|
|
],
|
|
[
|
|
'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d',
|
|
'4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda'
|
|
],
|
|
[
|
|
'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725',
|
|
'7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd'
|
|
],
|
|
[
|
|
'213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754',
|
|
'4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2'
|
|
],
|
|
[
|
|
'4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c',
|
|
'17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6'
|
|
],
|
|
[
|
|
'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6',
|
|
'6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f'
|
|
],
|
|
[
|
|
'76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39',
|
|
'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01'
|
|
],
|
|
[
|
|
'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891',
|
|
'893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3'
|
|
],
|
|
[
|
|
'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b',
|
|
'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f'
|
|
],
|
|
[
|
|
'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03',
|
|
'2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7'
|
|
],
|
|
[
|
|
'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d',
|
|
'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78'
|
|
],
|
|
[
|
|
'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070',
|
|
'7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1'
|
|
],
|
|
[
|
|
'90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4',
|
|
'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150'
|
|
],
|
|
[
|
|
'8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da',
|
|
'662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82'
|
|
],
|
|
[
|
|
'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11',
|
|
'1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc'
|
|
],
|
|
[
|
|
'8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e',
|
|
'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b'
|
|
],
|
|
[
|
|
'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41',
|
|
'2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51'
|
|
],
|
|
[
|
|
'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef',
|
|
'67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45'
|
|
],
|
|
[
|
|
'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8',
|
|
'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120'
|
|
],
|
|
[
|
|
'324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d',
|
|
'648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84'
|
|
],
|
|
[
|
|
'4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96',
|
|
'35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d'
|
|
],
|
|
[
|
|
'9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd',
|
|
'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d'
|
|
],
|
|
[
|
|
'6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5',
|
|
'9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8'
|
|
],
|
|
[
|
|
'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266',
|
|
'40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8'
|
|
],
|
|
[
|
|
'7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71',
|
|
'34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac'
|
|
],
|
|
[
|
|
'928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac',
|
|
'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f'
|
|
],
|
|
[
|
|
'85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751',
|
|
'1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962'
|
|
],
|
|
[
|
|
'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e',
|
|
'493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907'
|
|
],
|
|
[
|
|
'827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241',
|
|
'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec'
|
|
],
|
|
[
|
|
'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3',
|
|
'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d'
|
|
],
|
|
[
|
|
'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f',
|
|
'4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414'
|
|
],
|
|
[
|
|
'1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19',
|
|
'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd'
|
|
],
|
|
[
|
|
'146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be',
|
|
'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0'
|
|
],
|
|
[
|
|
'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9',
|
|
'6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811'
|
|
],
|
|
[
|
|
'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2',
|
|
'8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1'
|
|
],
|
|
[
|
|
'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13',
|
|
'7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c'
|
|
],
|
|
[
|
|
'174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c',
|
|
'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73'
|
|
],
|
|
[
|
|
'959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba',
|
|
'2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd'
|
|
],
|
|
[
|
|
'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151',
|
|
'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405'
|
|
],
|
|
[
|
|
'64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073',
|
|
'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589'
|
|
],
|
|
[
|
|
'8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458',
|
|
'38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e'
|
|
],
|
|
[
|
|
'13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b',
|
|
'69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27'
|
|
],
|
|
[
|
|
'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366',
|
|
'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1'
|
|
],
|
|
[
|
|
'8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa',
|
|
'40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482'
|
|
],
|
|
[
|
|
'8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0',
|
|
'620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945'
|
|
],
|
|
[
|
|
'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787',
|
|
'7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573'
|
|
],
|
|
[
|
|
'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e',
|
|
'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82'
|
|
]
|
|
]
|
|
},
|
|
naf: {
|
|
wnd: 7,
|
|
points: [
|
|
[
|
|
'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9',
|
|
'388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672'
|
|
],
|
|
[
|
|
'2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4',
|
|
'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6'
|
|
],
|
|
[
|
|
'5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc',
|
|
'6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da'
|
|
],
|
|
[
|
|
'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe',
|
|
'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37'
|
|
],
|
|
[
|
|
'774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb',
|
|
'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b'
|
|
],
|
|
[
|
|
'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8',
|
|
'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81'
|
|
],
|
|
[
|
|
'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e',
|
|
'581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58'
|
|
],
|
|
[
|
|
'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34',
|
|
'4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77'
|
|
],
|
|
[
|
|
'2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c',
|
|
'85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a'
|
|
],
|
|
[
|
|
'352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5',
|
|
'321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c'
|
|
],
|
|
[
|
|
'2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f',
|
|
'2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67'
|
|
],
|
|
[
|
|
'9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714',
|
|
'73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402'
|
|
],
|
|
[
|
|
'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729',
|
|
'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55'
|
|
],
|
|
[
|
|
'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db',
|
|
'2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482'
|
|
],
|
|
[
|
|
'6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4',
|
|
'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82'
|
|
],
|
|
[
|
|
'1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5',
|
|
'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396'
|
|
],
|
|
[
|
|
'605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479',
|
|
'2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49'
|
|
],
|
|
[
|
|
'62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d',
|
|
'80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf'
|
|
],
|
|
[
|
|
'80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f',
|
|
'1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a'
|
|
],
|
|
[
|
|
'7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb',
|
|
'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7'
|
|
],
|
|
[
|
|
'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9',
|
|
'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933'
|
|
],
|
|
[
|
|
'49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963',
|
|
'758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a'
|
|
],
|
|
[
|
|
'77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74',
|
|
'958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6'
|
|
],
|
|
[
|
|
'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530',
|
|
'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37'
|
|
],
|
|
[
|
|
'463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b',
|
|
'5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e'
|
|
],
|
|
[
|
|
'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247',
|
|
'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6'
|
|
],
|
|
[
|
|
'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1',
|
|
'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476'
|
|
],
|
|
[
|
|
'2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120',
|
|
'4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40'
|
|
],
|
|
[
|
|
'7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435',
|
|
'91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61'
|
|
],
|
|
[
|
|
'754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18',
|
|
'673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683'
|
|
],
|
|
[
|
|
'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8',
|
|
'59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5'
|
|
],
|
|
[
|
|
'186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb',
|
|
'3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b'
|
|
],
|
|
[
|
|
'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f',
|
|
'55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417'
|
|
],
|
|
[
|
|
'5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143',
|
|
'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868'
|
|
],
|
|
[
|
|
'290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba',
|
|
'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a'
|
|
],
|
|
[
|
|
'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45',
|
|
'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6'
|
|
],
|
|
[
|
|
'766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a',
|
|
'744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996'
|
|
],
|
|
[
|
|
'59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e',
|
|
'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e'
|
|
],
|
|
[
|
|
'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8',
|
|
'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d'
|
|
],
|
|
[
|
|
'7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c',
|
|
'30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2'
|
|
],
|
|
[
|
|
'948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519',
|
|
'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e'
|
|
],
|
|
[
|
|
'7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab',
|
|
'100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437'
|
|
],
|
|
[
|
|
'3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca',
|
|
'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311'
|
|
],
|
|
[
|
|
'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf',
|
|
'8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4'
|
|
],
|
|
[
|
|
'1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610',
|
|
'68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575'
|
|
],
|
|
[
|
|
'733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4',
|
|
'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d'
|
|
],
|
|
[
|
|
'15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c',
|
|
'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d'
|
|
],
|
|
[
|
|
'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940',
|
|
'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629'
|
|
],
|
|
[
|
|
'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980',
|
|
'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06'
|
|
],
|
|
[
|
|
'311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3',
|
|
'66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374'
|
|
],
|
|
[
|
|
'34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf',
|
|
'9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee'
|
|
],
|
|
[
|
|
'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63',
|
|
'4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1'
|
|
],
|
|
[
|
|
'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448',
|
|
'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b'
|
|
],
|
|
[
|
|
'32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf',
|
|
'5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661'
|
|
],
|
|
[
|
|
'7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5',
|
|
'8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6'
|
|
],
|
|
[
|
|
'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6',
|
|
'8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e'
|
|
],
|
|
[
|
|
'16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5',
|
|
'5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d'
|
|
],
|
|
[
|
|
'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99',
|
|
'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc'
|
|
],
|
|
[
|
|
'78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51',
|
|
'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4'
|
|
],
|
|
[
|
|
'494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5',
|
|
'42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c'
|
|
],
|
|
[
|
|
'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5',
|
|
'204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b'
|
|
],
|
|
[
|
|
'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997',
|
|
'4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913'
|
|
],
|
|
[
|
|
'841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881',
|
|
'73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154'
|
|
],
|
|
[
|
|
'5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5',
|
|
'39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865'
|
|
],
|
|
[
|
|
'36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66',
|
|
'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc'
|
|
],
|
|
[
|
|
'336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726',
|
|
'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224'
|
|
],
|
|
[
|
|
'8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede',
|
|
'6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e'
|
|
],
|
|
[
|
|
'1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94',
|
|
'60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6'
|
|
],
|
|
[
|
|
'85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31',
|
|
'3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511'
|
|
],
|
|
[
|
|
'29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51',
|
|
'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b'
|
|
],
|
|
[
|
|
'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252',
|
|
'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2'
|
|
],
|
|
[
|
|
'4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5',
|
|
'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c'
|
|
],
|
|
[
|
|
'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b',
|
|
'6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3'
|
|
],
|
|
[
|
|
'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4',
|
|
'322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d'
|
|
],
|
|
[
|
|
'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f',
|
|
'6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700'
|
|
],
|
|
[
|
|
'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889',
|
|
'2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4'
|
|
],
|
|
[
|
|
'591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246',
|
|
'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196'
|
|
],
|
|
[
|
|
'11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984',
|
|
'998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4'
|
|
],
|
|
[
|
|
'3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a',
|
|
'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257'
|
|
],
|
|
[
|
|
'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030',
|
|
'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13'
|
|
],
|
|
[
|
|
'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197',
|
|
'6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096'
|
|
],
|
|
[
|
|
'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593',
|
|
'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38'
|
|
],
|
|
[
|
|
'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef',
|
|
'21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f'
|
|
],
|
|
[
|
|
'347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38',
|
|
'60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448'
|
|
],
|
|
[
|
|
'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a',
|
|
'49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a'
|
|
],
|
|
[
|
|
'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111',
|
|
'5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4'
|
|
],
|
|
[
|
|
'4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502',
|
|
'7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437'
|
|
],
|
|
[
|
|
'3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea',
|
|
'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7'
|
|
],
|
|
[
|
|
'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26',
|
|
'8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d'
|
|
],
|
|
[
|
|
'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986',
|
|
'39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a'
|
|
],
|
|
[
|
|
'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e',
|
|
'62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54'
|
|
],
|
|
[
|
|
'48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4',
|
|
'25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77'
|
|
],
|
|
[
|
|
'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda',
|
|
'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517'
|
|
],
|
|
[
|
|
'6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859',
|
|
'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10'
|
|
],
|
|
[
|
|
'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f',
|
|
'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125'
|
|
],
|
|
[
|
|
'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c',
|
|
'6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e'
|
|
],
|
|
[
|
|
'13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942',
|
|
'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1'
|
|
],
|
|
[
|
|
'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a',
|
|
'1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2'
|
|
],
|
|
[
|
|
'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80',
|
|
'5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423'
|
|
],
|
|
[
|
|
'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d',
|
|
'438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8'
|
|
],
|
|
[
|
|
'8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1',
|
|
'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758'
|
|
],
|
|
[
|
|
'52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63',
|
|
'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375'
|
|
],
|
|
[
|
|
'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352',
|
|
'6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d'
|
|
],
|
|
[
|
|
'7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193',
|
|
'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec'
|
|
],
|
|
[
|
|
'5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00',
|
|
'9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0'
|
|
],
|
|
[
|
|
'32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58',
|
|
'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c'
|
|
],
|
|
[
|
|
'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7',
|
|
'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4'
|
|
],
|
|
[
|
|
'8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8',
|
|
'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f'
|
|
],
|
|
[
|
|
'4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e',
|
|
'67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649'
|
|
],
|
|
[
|
|
'3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d',
|
|
'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826'
|
|
],
|
|
[
|
|
'674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b',
|
|
'299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5'
|
|
],
|
|
[
|
|
'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f',
|
|
'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87'
|
|
],
|
|
[
|
|
'30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6',
|
|
'462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b'
|
|
],
|
|
[
|
|
'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297',
|
|
'62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc'
|
|
],
|
|
[
|
|
'93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a',
|
|
'7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c'
|
|
],
|
|
[
|
|
'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c',
|
|
'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f'
|
|
],
|
|
[
|
|
'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52',
|
|
'4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a'
|
|
],
|
|
[
|
|
'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb',
|
|
'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46'
|
|
],
|
|
[
|
|
'463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065',
|
|
'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f'
|
|
],
|
|
[
|
|
'7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917',
|
|
'603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03'
|
|
],
|
|
[
|
|
'74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9',
|
|
'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08'
|
|
],
|
|
[
|
|
'30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3',
|
|
'553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8'
|
|
],
|
|
[
|
|
'9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57',
|
|
'712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373'
|
|
],
|
|
[
|
|
'176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66',
|
|
'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3'
|
|
],
|
|
[
|
|
'75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8',
|
|
'9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8'
|
|
],
|
|
[
|
|
'809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721',
|
|
'9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1'
|
|
],
|
|
[
|
|
'1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180',
|
|
'4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9'
|
|
]
|
|
]
|
|
}
|
|
};
|
|
|
|
var curves_1 = createCommonjsModule(function (module, exports) {
|
|
|
|
var curves = exports;
|
|
|
|
|
|
|
|
|
|
var assert = elliptic_1.utils.assert;
|
|
|
|
function PresetCurve(options) {
|
|
if (options.type === 'short')
|
|
this.curve = new elliptic_1.curve.short(options);
|
|
else if (options.type === 'edwards')
|
|
this.curve = new elliptic_1.curve.edwards(options);
|
|
else
|
|
this.curve = new elliptic_1.curve.mont(options);
|
|
this.g = this.curve.g;
|
|
this.n = this.curve.n;
|
|
this.hash = options.hash;
|
|
|
|
assert(this.g.validate(), 'Invalid curve');
|
|
assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');
|
|
}
|
|
curves.PresetCurve = PresetCurve;
|
|
|
|
function defineCurve(name, options) {
|
|
Object.defineProperty(curves, name, {
|
|
configurable: true,
|
|
enumerable: true,
|
|
get: function() {
|
|
var curve = new PresetCurve(options);
|
|
Object.defineProperty(curves, name, {
|
|
configurable: true,
|
|
enumerable: true,
|
|
value: curve
|
|
});
|
|
return curve;
|
|
}
|
|
});
|
|
}
|
|
|
|
defineCurve('p192', {
|
|
type: 'short',
|
|
prime: 'p192',
|
|
p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff',
|
|
a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc',
|
|
b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1',
|
|
n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',
|
|
hash: hash_1.sha256,
|
|
gRed: false,
|
|
g: [
|
|
'188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',
|
|
'07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811'
|
|
]
|
|
});
|
|
|
|
defineCurve('p224', {
|
|
type: 'short',
|
|
prime: 'p224',
|
|
p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001',
|
|
a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe',
|
|
b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4',
|
|
n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',
|
|
hash: hash_1.sha256,
|
|
gRed: false,
|
|
g: [
|
|
'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',
|
|
'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34'
|
|
]
|
|
});
|
|
|
|
defineCurve('p256', {
|
|
type: 'short',
|
|
prime: null,
|
|
p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff',
|
|
a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc',
|
|
b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b',
|
|
n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',
|
|
hash: hash_1.sha256,
|
|
gRed: false,
|
|
g: [
|
|
'6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',
|
|
'4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5'
|
|
]
|
|
});
|
|
|
|
defineCurve('p384', {
|
|
type: 'short',
|
|
prime: null,
|
|
p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
|
|
'fffffffe ffffffff 00000000 00000000 ffffffff',
|
|
a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
|
|
'fffffffe ffffffff 00000000 00000000 fffffffc',
|
|
b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +
|
|
'5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',
|
|
n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +
|
|
'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',
|
|
hash: hash_1.sha384,
|
|
gRed: false,
|
|
g: [
|
|
'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +
|
|
'5502f25d bf55296c 3a545e38 72760ab7',
|
|
'3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +
|
|
'0a60b1ce 1d7e819d 7a431d7c 90ea0e5f'
|
|
]
|
|
});
|
|
|
|
defineCurve('p521', {
|
|
type: 'short',
|
|
prime: null,
|
|
p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
|
|
'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
|
|
'ffffffff ffffffff ffffffff ffffffff ffffffff',
|
|
a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
|
|
'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
|
|
'ffffffff ffffffff ffffffff ffffffff fffffffc',
|
|
b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +
|
|
'99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +
|
|
'3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',
|
|
n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
|
|
'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +
|
|
'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',
|
|
hash: hash_1.sha512,
|
|
gRed: false,
|
|
g: [
|
|
'000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +
|
|
'053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +
|
|
'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',
|
|
'00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +
|
|
'579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +
|
|
'3fad0761 353c7086 a272c240 88be9476 9fd16650'
|
|
]
|
|
});
|
|
|
|
defineCurve('curve25519', {
|
|
type: 'mont',
|
|
prime: 'p25519',
|
|
p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',
|
|
a: '76d06',
|
|
b: '1',
|
|
n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',
|
|
hash: hash_1.sha256,
|
|
gRed: false,
|
|
g: [
|
|
'9'
|
|
]
|
|
});
|
|
|
|
defineCurve('ed25519', {
|
|
type: 'edwards',
|
|
prime: 'p25519',
|
|
p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',
|
|
a: '-1',
|
|
c: '1',
|
|
// -121665 * (121666^(-1)) (mod P)
|
|
d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3',
|
|
n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',
|
|
hash: hash_1.sha256,
|
|
gRed: false,
|
|
g: [
|
|
'216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',
|
|
|
|
// 4/5
|
|
'6666666666666666666666666666666666666666666666666666666666666658'
|
|
]
|
|
});
|
|
|
|
var pre;
|
|
try {
|
|
pre = secp256k1;
|
|
} catch (e) {
|
|
pre = undefined;
|
|
}
|
|
|
|
defineCurve('secp256k1', {
|
|
type: 'short',
|
|
prime: 'k256',
|
|
p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f',
|
|
a: '0',
|
|
b: '7',
|
|
n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',
|
|
h: '1',
|
|
hash: hash_1.sha256,
|
|
|
|
// Precomputed endomorphism
|
|
beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',
|
|
lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',
|
|
basis: [
|
|
{
|
|
a: '3086d221a7d46bcde86c90e49284eb15',
|
|
b: '-e4437ed6010e88286f547fa90abfe4c3'
|
|
},
|
|
{
|
|
a: '114ca50f7a8e2f3f657c1108d9d44cfd8',
|
|
b: '3086d221a7d46bcde86c90e49284eb15'
|
|
}
|
|
],
|
|
|
|
gRed: false,
|
|
g: [
|
|
'79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',
|
|
'483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',
|
|
pre
|
|
]
|
|
});
|
|
});
|
|
|
|
function HmacDRBG(options) {
|
|
if (!(this instanceof HmacDRBG))
|
|
return new HmacDRBG(options);
|
|
this.hash = options.hash;
|
|
this.predResist = !!options.predResist;
|
|
|
|
this.outLen = this.hash.outSize;
|
|
this.minEntropy = options.minEntropy || this.hash.hmacStrength;
|
|
|
|
this._reseed = null;
|
|
this.reseedInterval = null;
|
|
this.K = null;
|
|
this.V = null;
|
|
|
|
var entropy = utils_1.toArray(options.entropy, options.entropyEnc || 'hex');
|
|
var nonce = utils_1.toArray(options.nonce, options.nonceEnc || 'hex');
|
|
var pers = utils_1.toArray(options.pers, options.persEnc || 'hex');
|
|
minimalisticAssert(entropy.length >= (this.minEntropy / 8),
|
|
'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');
|
|
this._init(entropy, nonce, pers);
|
|
}
|
|
var hmacDrbg = HmacDRBG;
|
|
|
|
HmacDRBG.prototype._init = function init(entropy, nonce, pers) {
|
|
var seed = entropy.concat(nonce).concat(pers);
|
|
|
|
this.K = new Array(this.outLen / 8);
|
|
this.V = new Array(this.outLen / 8);
|
|
for (var i = 0; i < this.V.length; i++) {
|
|
this.K[i] = 0x00;
|
|
this.V[i] = 0x01;
|
|
}
|
|
|
|
this._update(seed);
|
|
this._reseed = 1;
|
|
this.reseedInterval = 0x1000000000000; // 2^48
|
|
};
|
|
|
|
HmacDRBG.prototype._hmac = function hmac() {
|
|
return new hash_1.hmac(this.hash, this.K);
|
|
};
|
|
|
|
HmacDRBG.prototype._update = function update(seed) {
|
|
var kmac = this._hmac()
|
|
.update(this.V)
|
|
.update([ 0x00 ]);
|
|
if (seed)
|
|
kmac = kmac.update(seed);
|
|
this.K = kmac.digest();
|
|
this.V = this._hmac().update(this.V).digest();
|
|
if (!seed)
|
|
return;
|
|
|
|
this.K = this._hmac()
|
|
.update(this.V)
|
|
.update([ 0x01 ])
|
|
.update(seed)
|
|
.digest();
|
|
this.V = this._hmac().update(this.V).digest();
|
|
};
|
|
|
|
HmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {
|
|
// Optional entropy enc
|
|
if (typeof entropyEnc !== 'string') {
|
|
addEnc = add;
|
|
add = entropyEnc;
|
|
entropyEnc = null;
|
|
}
|
|
|
|
entropy = utils_1.toArray(entropy, entropyEnc);
|
|
add = utils_1.toArray(add, addEnc);
|
|
|
|
minimalisticAssert(entropy.length >= (this.minEntropy / 8),
|
|
'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');
|
|
|
|
this._update(entropy.concat(add || []));
|
|
this._reseed = 1;
|
|
};
|
|
|
|
HmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {
|
|
if (this._reseed > this.reseedInterval)
|
|
throw new Error('Reseed is required');
|
|
|
|
// Optional encoding
|
|
if (typeof enc !== 'string') {
|
|
addEnc = add;
|
|
add = enc;
|
|
enc = null;
|
|
}
|
|
|
|
// Optional additional data
|
|
if (add) {
|
|
add = utils_1.toArray(add, addEnc || 'hex');
|
|
this._update(add);
|
|
}
|
|
|
|
var temp = [];
|
|
while (temp.length < len) {
|
|
this.V = this._hmac().update(this.V).digest();
|
|
temp = temp.concat(this.V);
|
|
}
|
|
|
|
var res = temp.slice(0, len);
|
|
this._update(add);
|
|
this._reseed++;
|
|
return utils_1.encode(res, enc);
|
|
};
|
|
|
|
var utils$6 = elliptic_1.utils;
|
|
var assert$4 = utils$6.assert;
|
|
|
|
function KeyPair(ec, options) {
|
|
this.ec = ec;
|
|
this.priv = null;
|
|
this.pub = null;
|
|
|
|
// KeyPair(ec, { priv: ..., pub: ... })
|
|
if (options.priv)
|
|
this._importPrivate(options.priv, options.privEnc);
|
|
if (options.pub)
|
|
this._importPublic(options.pub, options.pubEnc);
|
|
}
|
|
var key$1 = KeyPair;
|
|
|
|
KeyPair.fromPublic = function fromPublic(ec, pub, enc) {
|
|
if (pub instanceof KeyPair)
|
|
return pub;
|
|
|
|
return new KeyPair(ec, {
|
|
pub: pub,
|
|
pubEnc: enc
|
|
});
|
|
};
|
|
|
|
KeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {
|
|
if (priv instanceof KeyPair)
|
|
return priv;
|
|
|
|
return new KeyPair(ec, {
|
|
priv: priv,
|
|
privEnc: enc
|
|
});
|
|
};
|
|
|
|
KeyPair.prototype.validate = function validate() {
|
|
var pub = this.getPublic();
|
|
|
|
if (pub.isInfinity())
|
|
return { result: false, reason: 'Invalid public key' };
|
|
if (!pub.validate())
|
|
return { result: false, reason: 'Public key is not a point' };
|
|
if (!pub.mul(this.ec.curve.n).isInfinity())
|
|
return { result: false, reason: 'Public key * N != O' };
|
|
|
|
return { result: true, reason: null };
|
|
};
|
|
|
|
KeyPair.prototype.getPublic = function getPublic(compact, enc) {
|
|
// compact is optional argument
|
|
if (typeof compact === 'string') {
|
|
enc = compact;
|
|
compact = null;
|
|
}
|
|
|
|
if (!this.pub)
|
|
this.pub = this.ec.g.mul(this.priv);
|
|
|
|
if (!enc)
|
|
return this.pub;
|
|
|
|
return this.pub.encode(enc, compact);
|
|
};
|
|
|
|
KeyPair.prototype.getPrivate = function getPrivate(enc) {
|
|
if (enc === 'hex')
|
|
return this.priv.toString(16, 2);
|
|
else
|
|
return this.priv;
|
|
};
|
|
|
|
KeyPair.prototype._importPrivate = function _importPrivate(key, enc) {
|
|
this.priv = new bn(key, enc || 16);
|
|
|
|
// Ensure that the priv won't be bigger than n, otherwise we may fail
|
|
// in fixed multiplication method
|
|
this.priv = this.priv.umod(this.ec.curve.n);
|
|
};
|
|
|
|
KeyPair.prototype._importPublic = function _importPublic(key, enc) {
|
|
if (key.x || key.y) {
|
|
// Montgomery points only have an `x` coordinate.
|
|
// Weierstrass/Edwards points on the other hand have both `x` and
|
|
// `y` coordinates.
|
|
if (this.ec.curve.type === 'mont') {
|
|
assert$4(key.x, 'Need x coordinate');
|
|
} else if (this.ec.curve.type === 'short' ||
|
|
this.ec.curve.type === 'edwards') {
|
|
assert$4(key.x && key.y, 'Need both x and y coordinate');
|
|
}
|
|
this.pub = this.ec.curve.point(key.x, key.y);
|
|
return;
|
|
}
|
|
this.pub = this.ec.curve.decodePoint(key, enc);
|
|
};
|
|
|
|
// ECDH
|
|
KeyPair.prototype.derive = function derive(pub) {
|
|
return pub.mul(this.priv).getX();
|
|
};
|
|
|
|
// ECDSA
|
|
KeyPair.prototype.sign = function sign(msg, enc, options) {
|
|
return this.ec.sign(msg, this, enc, options);
|
|
};
|
|
|
|
KeyPair.prototype.verify = function verify(msg, signature) {
|
|
return this.ec.verify(msg, signature, this);
|
|
};
|
|
|
|
KeyPair.prototype.inspect = function inspect() {
|
|
return '<Key priv: ' + (this.priv && this.priv.toString(16, 2)) +
|
|
' pub: ' + (this.pub && this.pub.inspect()) + ' >';
|
|
};
|
|
|
|
var utils$7 = elliptic_1.utils;
|
|
var assert$5 = utils$7.assert;
|
|
|
|
function Signature(options, enc) {
|
|
if (options instanceof Signature)
|
|
return options;
|
|
|
|
if (this._importDER(options, enc))
|
|
return;
|
|
|
|
assert$5(options.r && options.s, 'Signature without r or s');
|
|
this.r = new bn(options.r, 16);
|
|
this.s = new bn(options.s, 16);
|
|
if (options.recoveryParam === undefined)
|
|
this.recoveryParam = null;
|
|
else
|
|
this.recoveryParam = options.recoveryParam;
|
|
}
|
|
var signature = Signature;
|
|
|
|
function Position() {
|
|
this.place = 0;
|
|
}
|
|
|
|
function getLength(buf, p) {
|
|
var initial = buf[p.place++];
|
|
if (!(initial & 0x80)) {
|
|
return initial;
|
|
}
|
|
var octetLen = initial & 0xf;
|
|
var val = 0;
|
|
for (var i = 0, off = p.place; i < octetLen; i++, off++) {
|
|
val <<= 8;
|
|
val |= buf[off];
|
|
}
|
|
p.place = off;
|
|
return val;
|
|
}
|
|
|
|
function rmPadding(buf) {
|
|
var i = 0;
|
|
var len = buf.length - 1;
|
|
while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {
|
|
i++;
|
|
}
|
|
if (i === 0) {
|
|
return buf;
|
|
}
|
|
return buf.slice(i);
|
|
}
|
|
|
|
Signature.prototype._importDER = function _importDER(data, enc) {
|
|
data = utils$7.toArray(data, enc);
|
|
var p = new Position();
|
|
if (data[p.place++] !== 0x30) {
|
|
return false;
|
|
}
|
|
var len = getLength(data, p);
|
|
if ((len + p.place) !== data.length) {
|
|
return false;
|
|
}
|
|
if (data[p.place++] !== 0x02) {
|
|
return false;
|
|
}
|
|
var rlen = getLength(data, p);
|
|
var r = data.slice(p.place, rlen + p.place);
|
|
p.place += rlen;
|
|
if (data[p.place++] !== 0x02) {
|
|
return false;
|
|
}
|
|
var slen = getLength(data, p);
|
|
if (data.length !== slen + p.place) {
|
|
return false;
|
|
}
|
|
var s = data.slice(p.place, slen + p.place);
|
|
if (r[0] === 0 && (r[1] & 0x80)) {
|
|
r = r.slice(1);
|
|
}
|
|
if (s[0] === 0 && (s[1] & 0x80)) {
|
|
s = s.slice(1);
|
|
}
|
|
|
|
this.r = new bn(r);
|
|
this.s = new bn(s);
|
|
this.recoveryParam = null;
|
|
|
|
return true;
|
|
};
|
|
|
|
function constructLength(arr, len) {
|
|
if (len < 0x80) {
|
|
arr.push(len);
|
|
return;
|
|
}
|
|
var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);
|
|
arr.push(octets | 0x80);
|
|
while (--octets) {
|
|
arr.push((len >>> (octets << 3)) & 0xff);
|
|
}
|
|
arr.push(len);
|
|
}
|
|
|
|
Signature.prototype.toDER = function toDER(enc) {
|
|
var r = this.r.toArray();
|
|
var s = this.s.toArray();
|
|
|
|
// Pad values
|
|
if (r[0] & 0x80)
|
|
r = [ 0 ].concat(r);
|
|
// Pad values
|
|
if (s[0] & 0x80)
|
|
s = [ 0 ].concat(s);
|
|
|
|
r = rmPadding(r);
|
|
s = rmPadding(s);
|
|
|
|
while (!s[0] && !(s[1] & 0x80)) {
|
|
s = s.slice(1);
|
|
}
|
|
var arr = [ 0x02 ];
|
|
constructLength(arr, r.length);
|
|
arr = arr.concat(r);
|
|
arr.push(0x02);
|
|
constructLength(arr, s.length);
|
|
var backHalf = arr.concat(s);
|
|
var res = [ 0x30 ];
|
|
constructLength(res, backHalf.length);
|
|
res = res.concat(backHalf);
|
|
return utils$7.encode(res, enc);
|
|
};
|
|
|
|
var utils$8 = elliptic_1.utils;
|
|
var assert$6 = utils$8.assert;
|
|
|
|
|
|
|
|
|
|
function EC(options) {
|
|
if (!(this instanceof EC))
|
|
return new EC(options);
|
|
|
|
// Shortcut `elliptic.ec(curve-name)`
|
|
if (typeof options === 'string') {
|
|
assert$6(elliptic_1.curves.hasOwnProperty(options), 'Unknown curve ' + options);
|
|
|
|
options = elliptic_1.curves[options];
|
|
}
|
|
|
|
// Shortcut for `elliptic.ec(elliptic.curves.curveName)`
|
|
if (options instanceof elliptic_1.curves.PresetCurve)
|
|
options = { curve: options };
|
|
|
|
this.curve = options.curve.curve;
|
|
this.n = this.curve.n;
|
|
this.nh = this.n.ushrn(1);
|
|
this.g = this.curve.g;
|
|
|
|
// Point on curve
|
|
this.g = options.curve.g;
|
|
this.g.precompute(options.curve.n.bitLength() + 1);
|
|
|
|
// Hash for function for DRBG
|
|
this.hash = options.hash || options.curve.hash;
|
|
}
|
|
var ec = EC;
|
|
|
|
EC.prototype.keyPair = function keyPair(options) {
|
|
return new key$1(this, options);
|
|
};
|
|
|
|
EC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {
|
|
return key$1.fromPrivate(this, priv, enc);
|
|
};
|
|
|
|
EC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {
|
|
return key$1.fromPublic(this, pub, enc);
|
|
};
|
|
|
|
EC.prototype.genKeyPair = function genKeyPair(options) {
|
|
if (!options)
|
|
options = {};
|
|
|
|
// Instantiate Hmac_DRBG
|
|
var drbg = new hmacDrbg({
|
|
hash: this.hash,
|
|
pers: options.pers,
|
|
persEnc: options.persEnc || 'utf8',
|
|
entropy: options.entropy || elliptic_1.rand(this.hash.hmacStrength),
|
|
entropyEnc: options.entropy && options.entropyEnc || 'utf8',
|
|
nonce: this.n.toArray()
|
|
});
|
|
|
|
var bytes = this.n.byteLength();
|
|
var ns2 = this.n.sub(new bn(2));
|
|
do {
|
|
var priv = new bn(drbg.generate(bytes));
|
|
if (priv.cmp(ns2) > 0)
|
|
continue;
|
|
|
|
priv.iaddn(1);
|
|
return this.keyFromPrivate(priv);
|
|
} while (true);
|
|
};
|
|
|
|
EC.prototype._truncateToN = function truncateToN(msg, truncOnly) {
|
|
var delta = msg.byteLength() * 8 - this.n.bitLength();
|
|
if (delta > 0)
|
|
msg = msg.ushrn(delta);
|
|
if (!truncOnly && msg.cmp(this.n) >= 0)
|
|
return msg.sub(this.n);
|
|
else
|
|
return msg;
|
|
};
|
|
|
|
EC.prototype.sign = function sign(msg, key, enc, options) {
|
|
if (typeof enc === 'object') {
|
|
options = enc;
|
|
enc = null;
|
|
}
|
|
if (!options)
|
|
options = {};
|
|
|
|
key = this.keyFromPrivate(key, enc);
|
|
msg = this._truncateToN(new bn(msg, 16));
|
|
|
|
// Zero-extend key to provide enough entropy
|
|
var bytes = this.n.byteLength();
|
|
var bkey = key.getPrivate().toArray('be', bytes);
|
|
|
|
// Zero-extend nonce to have the same byte size as N
|
|
var nonce = msg.toArray('be', bytes);
|
|
|
|
// Instantiate Hmac_DRBG
|
|
var drbg = new hmacDrbg({
|
|
hash: this.hash,
|
|
entropy: bkey,
|
|
nonce: nonce,
|
|
pers: options.pers,
|
|
persEnc: options.persEnc || 'utf8'
|
|
});
|
|
|
|
// Number of bytes to generate
|
|
var ns1 = this.n.sub(new bn(1));
|
|
|
|
for (var iter = 0; true; iter++) {
|
|
var k = options.k ?
|
|
options.k(iter) :
|
|
new bn(drbg.generate(this.n.byteLength()));
|
|
k = this._truncateToN(k, true);
|
|
if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)
|
|
continue;
|
|
|
|
var kp = this.g.mul(k);
|
|
if (kp.isInfinity())
|
|
continue;
|
|
|
|
var kpX = kp.getX();
|
|
var r = kpX.umod(this.n);
|
|
if (r.cmpn(0) === 0)
|
|
continue;
|
|
|
|
var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));
|
|
s = s.umod(this.n);
|
|
if (s.cmpn(0) === 0)
|
|
continue;
|
|
|
|
var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |
|
|
(kpX.cmp(r) !== 0 ? 2 : 0);
|
|
|
|
// Use complement of `s`, if it is > `n / 2`
|
|
if (options.canonical && s.cmp(this.nh) > 0) {
|
|
s = this.n.sub(s);
|
|
recoveryParam ^= 1;
|
|
}
|
|
|
|
return new signature({ r: r, s: s, recoveryParam: recoveryParam });
|
|
}
|
|
};
|
|
|
|
EC.prototype.verify = function verify(msg, signature$1, key, enc) {
|
|
msg = this._truncateToN(new bn(msg, 16));
|
|
key = this.keyFromPublic(key, enc);
|
|
signature$1 = new signature(signature$1, 'hex');
|
|
|
|
// Perform primitive values validation
|
|
var r = signature$1.r;
|
|
var s = signature$1.s;
|
|
if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)
|
|
return false;
|
|
if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)
|
|
return false;
|
|
|
|
// Validate signature
|
|
var sinv = s.invm(this.n);
|
|
var u1 = sinv.mul(msg).umod(this.n);
|
|
var u2 = sinv.mul(r).umod(this.n);
|
|
|
|
if (!this.curve._maxwellTrick) {
|
|
var p = this.g.mulAdd(u1, key.getPublic(), u2);
|
|
if (p.isInfinity())
|
|
return false;
|
|
|
|
return p.getX().umod(this.n).cmp(r) === 0;
|
|
}
|
|
|
|
// NOTE: Greg Maxwell's trick, inspired by:
|
|
// https://git.io/vad3K
|
|
|
|
var p = this.g.jmulAdd(u1, key.getPublic(), u2);
|
|
if (p.isInfinity())
|
|
return false;
|
|
|
|
// Compare `p.x` of Jacobian point with `r`,
|
|
// this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the
|
|
// inverse of `p.z^2`
|
|
return p.eqXToP(r);
|
|
};
|
|
|
|
EC.prototype.recoverPubKey = function(msg, signature$1, j, enc) {
|
|
assert$6((3 & j) === j, 'The recovery param is more than two bits');
|
|
signature$1 = new signature(signature$1, enc);
|
|
|
|
var n = this.n;
|
|
var e = new bn(msg);
|
|
var r = signature$1.r;
|
|
var s = signature$1.s;
|
|
|
|
// A set LSB signifies that the y-coordinate is odd
|
|
var isYOdd = j & 1;
|
|
var isSecondKey = j >> 1;
|
|
if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)
|
|
throw new Error('Unable to find sencond key candinate');
|
|
|
|
// 1.1. Let x = r + jn.
|
|
if (isSecondKey)
|
|
r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);
|
|
else
|
|
r = this.curve.pointFromX(r, isYOdd);
|
|
|
|
var rInv = signature$1.r.invm(n);
|
|
var s1 = n.sub(e).mul(rInv).umod(n);
|
|
var s2 = s.mul(rInv).umod(n);
|
|
|
|
// 1.6.1 Compute Q = r^-1 (sR - eG)
|
|
// Q = r^-1 (sR + -eG)
|
|
return this.g.mulAdd(s1, r, s2);
|
|
};
|
|
|
|
EC.prototype.getKeyRecoveryParam = function(e, signature$1, Q, enc) {
|
|
signature$1 = new signature(signature$1, enc);
|
|
if (signature$1.recoveryParam !== null)
|
|
return signature$1.recoveryParam;
|
|
|
|
for (var i = 0; i < 4; i++) {
|
|
var Qprime;
|
|
try {
|
|
Qprime = this.recoverPubKey(e, signature$1, i);
|
|
} catch (e) {
|
|
continue;
|
|
}
|
|
|
|
if (Qprime.eq(Q))
|
|
return i;
|
|
}
|
|
throw new Error('Unable to find valid recovery factor');
|
|
};
|
|
|
|
var utils$9 = elliptic_1.utils;
|
|
var assert$7 = utils$9.assert;
|
|
var parseBytes = utils$9.parseBytes;
|
|
var cachedProperty = utils$9.cachedProperty;
|
|
|
|
/**
|
|
* @param {EDDSA} eddsa - instance
|
|
* @param {Object} params - public/private key parameters
|
|
*
|
|
* @param {Array<Byte>} [params.secret] - secret seed bytes
|
|
* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)
|
|
* @param {Array<Byte>} [params.pub] - public key point encoded as bytes
|
|
*
|
|
*/
|
|
function KeyPair$1(eddsa, params) {
|
|
this.eddsa = eddsa;
|
|
this._secret = parseBytes(params.secret);
|
|
if (eddsa.isPoint(params.pub))
|
|
this._pub = params.pub;
|
|
else
|
|
this._pubBytes = parseBytes(params.pub);
|
|
}
|
|
|
|
KeyPair$1.fromPublic = function fromPublic(eddsa, pub) {
|
|
if (pub instanceof KeyPair$1)
|
|
return pub;
|
|
return new KeyPair$1(eddsa, { pub: pub });
|
|
};
|
|
|
|
KeyPair$1.fromSecret = function fromSecret(eddsa, secret) {
|
|
if (secret instanceof KeyPair$1)
|
|
return secret;
|
|
return new KeyPair$1(eddsa, { secret: secret });
|
|
};
|
|
|
|
KeyPair$1.prototype.secret = function secret() {
|
|
return this._secret;
|
|
};
|
|
|
|
cachedProperty(KeyPair$1, 'pubBytes', function pubBytes() {
|
|
return this.eddsa.encodePoint(this.pub());
|
|
});
|
|
|
|
cachedProperty(KeyPair$1, 'pub', function pub() {
|
|
if (this._pubBytes)
|
|
return this.eddsa.decodePoint(this._pubBytes);
|
|
return this.eddsa.g.mul(this.priv());
|
|
});
|
|
|
|
cachedProperty(KeyPair$1, 'privBytes', function privBytes() {
|
|
var eddsa = this.eddsa;
|
|
var hash = this.hash();
|
|
var lastIx = eddsa.encodingLength - 1;
|
|
|
|
var a = hash.slice(0, eddsa.encodingLength);
|
|
a[0] &= 248;
|
|
a[lastIx] &= 127;
|
|
a[lastIx] |= 64;
|
|
|
|
return a;
|
|
});
|
|
|
|
cachedProperty(KeyPair$1, 'priv', function priv() {
|
|
return this.eddsa.decodeInt(this.privBytes());
|
|
});
|
|
|
|
cachedProperty(KeyPair$1, 'hash', function hash() {
|
|
return this.eddsa.hash().update(this.secret()).digest();
|
|
});
|
|
|
|
cachedProperty(KeyPair$1, 'messagePrefix', function messagePrefix() {
|
|
return this.hash().slice(this.eddsa.encodingLength);
|
|
});
|
|
|
|
KeyPair$1.prototype.sign = function sign(message) {
|
|
assert$7(this._secret, 'KeyPair can only verify');
|
|
return this.eddsa.sign(message, this);
|
|
};
|
|
|
|
KeyPair$1.prototype.verify = function verify(message, sig) {
|
|
return this.eddsa.verify(message, sig, this);
|
|
};
|
|
|
|
KeyPair$1.prototype.getSecret = function getSecret(enc) {
|
|
assert$7(this._secret, 'KeyPair is public only');
|
|
return utils$9.encode(this.secret(), enc);
|
|
};
|
|
|
|
KeyPair$1.prototype.getPublic = function getPublic(enc) {
|
|
return utils$9.encode(this.pubBytes(), enc);
|
|
};
|
|
|
|
var key$2 = KeyPair$1;
|
|
|
|
var utils$a = elliptic_1.utils;
|
|
var assert$8 = utils$a.assert;
|
|
var cachedProperty$1 = utils$a.cachedProperty;
|
|
var parseBytes$1 = utils$a.parseBytes;
|
|
|
|
/**
|
|
* @param {EDDSA} eddsa - eddsa instance
|
|
* @param {Array<Bytes>|Object} sig -
|
|
* @param {Array<Bytes>|Point} [sig.R] - R point as Point or bytes
|
|
* @param {Array<Bytes>|bn} [sig.S] - S scalar as bn or bytes
|
|
* @param {Array<Bytes>} [sig.Rencoded] - R point encoded
|
|
* @param {Array<Bytes>} [sig.Sencoded] - S scalar encoded
|
|
*/
|
|
function Signature$1(eddsa, sig) {
|
|
this.eddsa = eddsa;
|
|
|
|
if (typeof sig !== 'object')
|
|
sig = parseBytes$1(sig);
|
|
|
|
if (Array.isArray(sig)) {
|
|
sig = {
|
|
R: sig.slice(0, eddsa.encodingLength),
|
|
S: sig.slice(eddsa.encodingLength)
|
|
};
|
|
}
|
|
|
|
assert$8(sig.R && sig.S, 'Signature without R or S');
|
|
|
|
if (eddsa.isPoint(sig.R))
|
|
this._R = sig.R;
|
|
if (sig.S instanceof bn)
|
|
this._S = sig.S;
|
|
|
|
this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;
|
|
this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;
|
|
}
|
|
|
|
cachedProperty$1(Signature$1, 'S', function S() {
|
|
return this.eddsa.decodeInt(this.Sencoded());
|
|
});
|
|
|
|
cachedProperty$1(Signature$1, 'R', function R() {
|
|
return this.eddsa.decodePoint(this.Rencoded());
|
|
});
|
|
|
|
cachedProperty$1(Signature$1, 'Rencoded', function Rencoded() {
|
|
return this.eddsa.encodePoint(this.R());
|
|
});
|
|
|
|
cachedProperty$1(Signature$1, 'Sencoded', function Sencoded() {
|
|
return this.eddsa.encodeInt(this.S());
|
|
});
|
|
|
|
Signature$1.prototype.toBytes = function toBytes() {
|
|
return this.Rencoded().concat(this.Sencoded());
|
|
};
|
|
|
|
Signature$1.prototype.toHex = function toHex() {
|
|
return utils$a.encode(this.toBytes(), 'hex').toUpperCase();
|
|
};
|
|
|
|
var signature$1 = Signature$1;
|
|
|
|
var utils$b = elliptic_1.utils;
|
|
var assert$9 = utils$b.assert;
|
|
var parseBytes$2 = utils$b.parseBytes;
|
|
|
|
|
|
|
|
function EDDSA(curve) {
|
|
assert$9(curve === 'ed25519', 'only tested with ed25519 so far');
|
|
|
|
if (!(this instanceof EDDSA))
|
|
return new EDDSA(curve);
|
|
|
|
var curve = elliptic_1.curves[curve].curve;
|
|
this.curve = curve;
|
|
this.g = curve.g;
|
|
this.g.precompute(curve.n.bitLength() + 1);
|
|
|
|
this.pointClass = curve.point().constructor;
|
|
this.encodingLength = Math.ceil(curve.n.bitLength() / 8);
|
|
this.hash = hash_1.sha512;
|
|
}
|
|
|
|
var eddsa = EDDSA;
|
|
|
|
/**
|
|
* @param {Array|String} message - message bytes
|
|
* @param {Array|String|KeyPair} secret - secret bytes or a keypair
|
|
* @returns {Signature} - signature
|
|
*/
|
|
EDDSA.prototype.sign = function sign(message, secret) {
|
|
message = parseBytes$2(message);
|
|
var key = this.keyFromSecret(secret);
|
|
var r = this.hashInt(key.messagePrefix(), message);
|
|
var R = this.g.mul(r);
|
|
var Rencoded = this.encodePoint(R);
|
|
var s_ = this.hashInt(Rencoded, key.pubBytes(), message)
|
|
.mul(key.priv());
|
|
var S = r.add(s_).umod(this.curve.n);
|
|
return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });
|
|
};
|
|
|
|
/**
|
|
* @param {Array} message - message bytes
|
|
* @param {Array|String|Signature} sig - sig bytes
|
|
* @param {Array|String|Point|KeyPair} pub - public key
|
|
* @returns {Boolean} - true if public key matches sig of message
|
|
*/
|
|
EDDSA.prototype.verify = function verify(message, sig, pub) {
|
|
message = parseBytes$2(message);
|
|
sig = this.makeSignature(sig);
|
|
var key = this.keyFromPublic(pub);
|
|
var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);
|
|
var SG = this.g.mul(sig.S());
|
|
var RplusAh = sig.R().add(key.pub().mul(h));
|
|
return RplusAh.eq(SG);
|
|
};
|
|
|
|
EDDSA.prototype.hashInt = function hashInt() {
|
|
var hash = this.hash();
|
|
for (var i = 0; i < arguments.length; i++)
|
|
hash.update(arguments[i]);
|
|
return utils$b.intFromLE(hash.digest()).umod(this.curve.n);
|
|
};
|
|
|
|
EDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {
|
|
return key$2.fromPublic(this, pub);
|
|
};
|
|
|
|
EDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {
|
|
return key$2.fromSecret(this, secret);
|
|
};
|
|
|
|
EDDSA.prototype.makeSignature = function makeSignature(sig) {
|
|
if (sig instanceof signature$1)
|
|
return sig;
|
|
return new signature$1(this, sig);
|
|
};
|
|
|
|
/**
|
|
* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2
|
|
*
|
|
* EDDSA defines methods for encoding and decoding points and integers. These are
|
|
* helper convenience methods, that pass along to utility functions implied
|
|
* parameters.
|
|
*
|
|
*/
|
|
EDDSA.prototype.encodePoint = function encodePoint(point) {
|
|
var enc = point.getY().toArray('le', this.encodingLength);
|
|
enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;
|
|
return enc;
|
|
};
|
|
|
|
EDDSA.prototype.decodePoint = function decodePoint(bytes) {
|
|
bytes = utils$b.parseBytes(bytes);
|
|
|
|
var lastIx = bytes.length - 1;
|
|
var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);
|
|
var xIsOdd = (bytes[lastIx] & 0x80) !== 0;
|
|
|
|
var y = utils$b.intFromLE(normed);
|
|
return this.curve.pointFromY(y, xIsOdd);
|
|
};
|
|
|
|
EDDSA.prototype.encodeInt = function encodeInt(num) {
|
|
return num.toArray('le', this.encodingLength);
|
|
};
|
|
|
|
EDDSA.prototype.decodeInt = function decodeInt(bytes) {
|
|
return utils$b.intFromLE(bytes);
|
|
};
|
|
|
|
EDDSA.prototype.isPoint = function isPoint(val) {
|
|
return val instanceof this.pointClass;
|
|
};
|
|
|
|
var require$$0 = getCjsExportFromNamespace(_package$1);
|
|
|
|
var elliptic_1 = createCommonjsModule(function (module, exports) {
|
|
|
|
var elliptic = exports;
|
|
|
|
elliptic.version = require$$0.version;
|
|
elliptic.utils = utils_1$1;
|
|
elliptic.rand = brorand;
|
|
elliptic.curve = curve_1;
|
|
elliptic.curves = curves_1;
|
|
|
|
// Protocols
|
|
elliptic.ec = ec;
|
|
elliptic.eddsa = eddsa;
|
|
});
|
|
|
|
var api_1 = createCommonjsModule(function (module, exports) {
|
|
var api = exports;
|
|
|
|
api.define = function define(name, body) {
|
|
return new Entity(name, body);
|
|
};
|
|
|
|
function Entity(name, body) {
|
|
this.name = name;
|
|
this.body = body;
|
|
|
|
this.decoders = {};
|
|
this.encoders = {};
|
|
}
|
|
Entity.prototype._createNamed = function createNamed(base) {
|
|
var named;
|
|
try {
|
|
named = vm.runInThisContext(
|
|
'(function ' + this.name + '(entity) {\n' +
|
|
' this._initNamed(entity);\n' +
|
|
'})'
|
|
);
|
|
} catch (e) {
|
|
named = function (entity) {
|
|
this._initNamed(entity);
|
|
};
|
|
}
|
|
inherits_browser(named, base);
|
|
named.prototype._initNamed = function initnamed(entity) {
|
|
base.call(this, entity);
|
|
};
|
|
|
|
return new named(this);
|
|
};
|
|
|
|
Entity.prototype._getDecoder = function _getDecoder(enc) {
|
|
enc = enc || 'der';
|
|
// Lazily create decoder
|
|
if (!this.decoders.hasOwnProperty(enc))
|
|
this.decoders[enc] = this._createNamed(asn1_1.decoders[enc]);
|
|
return this.decoders[enc];
|
|
};
|
|
|
|
Entity.prototype.decode = function decode(data, enc, options) {
|
|
return this._getDecoder(enc).decode(data, options);
|
|
};
|
|
|
|
Entity.prototype._getEncoder = function _getEncoder(enc) {
|
|
enc = enc || 'der';
|
|
// Lazily create encoder
|
|
if (!this.encoders.hasOwnProperty(enc))
|
|
this.encoders[enc] = this._createNamed(asn1_1.encoders[enc]);
|
|
return this.encoders[enc];
|
|
};
|
|
|
|
Entity.prototype.encode = function encode(data, enc, /* internal */ reporter) {
|
|
return this._getEncoder(enc).encode(data, reporter);
|
|
};
|
|
});
|
|
|
|
function Reporter(options) {
|
|
this._reporterState = {
|
|
obj: null,
|
|
path: [],
|
|
options: options || {},
|
|
errors: []
|
|
};
|
|
}
|
|
var Reporter_1 = Reporter;
|
|
|
|
Reporter.prototype.isError = function isError(obj) {
|
|
return obj instanceof ReporterError;
|
|
};
|
|
|
|
Reporter.prototype.save = function save() {
|
|
var state = this._reporterState;
|
|
|
|
return { obj: state.obj, pathLen: state.path.length };
|
|
};
|
|
|
|
Reporter.prototype.restore = function restore(data) {
|
|
var state = this._reporterState;
|
|
|
|
state.obj = data.obj;
|
|
state.path = state.path.slice(0, data.pathLen);
|
|
};
|
|
|
|
Reporter.prototype.enterKey = function enterKey(key) {
|
|
return this._reporterState.path.push(key);
|
|
};
|
|
|
|
Reporter.prototype.exitKey = function exitKey(index) {
|
|
var state = this._reporterState;
|
|
|
|
state.path = state.path.slice(0, index - 1);
|
|
};
|
|
|
|
Reporter.prototype.leaveKey = function leaveKey(index, key, value) {
|
|
var state = this._reporterState;
|
|
|
|
this.exitKey(index);
|
|
if (state.obj !== null)
|
|
state.obj[key] = value;
|
|
};
|
|
|
|
Reporter.prototype.path = function path() {
|
|
return this._reporterState.path.join('/');
|
|
};
|
|
|
|
Reporter.prototype.enterObject = function enterObject() {
|
|
var state = this._reporterState;
|
|
|
|
var prev = state.obj;
|
|
state.obj = {};
|
|
return prev;
|
|
};
|
|
|
|
Reporter.prototype.leaveObject = function leaveObject(prev) {
|
|
var state = this._reporterState;
|
|
|
|
var now = state.obj;
|
|
state.obj = prev;
|
|
return now;
|
|
};
|
|
|
|
Reporter.prototype.error = function error(msg) {
|
|
var err;
|
|
var state = this._reporterState;
|
|
|
|
var inherited = msg instanceof ReporterError;
|
|
if (inherited) {
|
|
err = msg;
|
|
} else {
|
|
err = new ReporterError(state.path.map(function(elem) {
|
|
return '[' + JSON.stringify(elem) + ']';
|
|
}).join(''), msg.message || msg, msg.stack);
|
|
}
|
|
|
|
if (!state.options.partial)
|
|
throw err;
|
|
|
|
if (!inherited)
|
|
state.errors.push(err);
|
|
|
|
return err;
|
|
};
|
|
|
|
Reporter.prototype.wrapResult = function wrapResult(result) {
|
|
var state = this._reporterState;
|
|
if (!state.options.partial)
|
|
return result;
|
|
|
|
return {
|
|
result: this.isError(result) ? null : result,
|
|
errors: state.errors
|
|
};
|
|
};
|
|
|
|
function ReporterError(path, msg) {
|
|
this.path = path;
|
|
this.rethrow(msg);
|
|
}inherits_browser(ReporterError, Error);
|
|
|
|
ReporterError.prototype.rethrow = function rethrow(msg) {
|
|
this.message = msg + ' at: ' + (this.path || '(shallow)');
|
|
if (Error.captureStackTrace)
|
|
Error.captureStackTrace(this, ReporterError);
|
|
|
|
if (!this.stack) {
|
|
try {
|
|
// IE only adds stack when thrown
|
|
throw new Error(this.message);
|
|
} catch (e) {
|
|
this.stack = e.stack;
|
|
}
|
|
}
|
|
return this;
|
|
};
|
|
|
|
var reporter = {
|
|
Reporter: Reporter_1
|
|
};
|
|
|
|
var Reporter$1 = base_1.Reporter;
|
|
var Buffer$s = buffer$1.Buffer;
|
|
|
|
function DecoderBuffer(base, options) {
|
|
Reporter$1.call(this, options);
|
|
if (!Buffer$s.isBuffer(base)) {
|
|
this.error('Input not Buffer');
|
|
return;
|
|
}
|
|
|
|
this.base = base;
|
|
this.offset = 0;
|
|
this.length = base.length;
|
|
}
|
|
inherits_browser(DecoderBuffer, Reporter$1);
|
|
var DecoderBuffer_1 = DecoderBuffer;
|
|
|
|
DecoderBuffer.prototype.save = function save() {
|
|
return { offset: this.offset, reporter: Reporter$1.prototype.save.call(this) };
|
|
};
|
|
|
|
DecoderBuffer.prototype.restore = function restore(save) {
|
|
// Return skipped data
|
|
var res = new DecoderBuffer(this.base);
|
|
res.offset = save.offset;
|
|
res.length = this.offset;
|
|
|
|
this.offset = save.offset;
|
|
Reporter$1.prototype.restore.call(this, save.reporter);
|
|
|
|
return res;
|
|
};
|
|
|
|
DecoderBuffer.prototype.isEmpty = function isEmpty() {
|
|
return this.offset === this.length;
|
|
};
|
|
|
|
DecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {
|
|
if (this.offset + 1 <= this.length)
|
|
return this.base.readUInt8(this.offset++, true);
|
|
else
|
|
return this.error(fail || 'DecoderBuffer overrun');
|
|
};
|
|
|
|
DecoderBuffer.prototype.skip = function skip(bytes, fail) {
|
|
if (!(this.offset + bytes <= this.length))
|
|
return this.error(fail || 'DecoderBuffer overrun');
|
|
|
|
var res = new DecoderBuffer(this.base);
|
|
|
|
// Share reporter state
|
|
res._reporterState = this._reporterState;
|
|
|
|
res.offset = this.offset;
|
|
res.length = this.offset + bytes;
|
|
this.offset += bytes;
|
|
return res;
|
|
};
|
|
|
|
DecoderBuffer.prototype.raw = function raw(save) {
|
|
return this.base.slice(save ? save.offset : this.offset, this.length);
|
|
};
|
|
|
|
function EncoderBuffer(value, reporter) {
|
|
if (Array.isArray(value)) {
|
|
this.length = 0;
|
|
this.value = value.map(function(item) {
|
|
if (!(item instanceof EncoderBuffer))
|
|
item = new EncoderBuffer(item, reporter);
|
|
this.length += item.length;
|
|
return item;
|
|
}, this);
|
|
} else if (typeof value === 'number') {
|
|
if (!(0 <= value && value <= 0xff))
|
|
return reporter.error('non-byte EncoderBuffer value');
|
|
this.value = value;
|
|
this.length = 1;
|
|
} else if (typeof value === 'string') {
|
|
this.value = value;
|
|
this.length = Buffer$s.byteLength(value);
|
|
} else if (Buffer$s.isBuffer(value)) {
|
|
this.value = value;
|
|
this.length = value.length;
|
|
} else {
|
|
return reporter.error('Unsupported type: ' + typeof value);
|
|
}
|
|
}
|
|
var EncoderBuffer_1 = EncoderBuffer;
|
|
|
|
EncoderBuffer.prototype.join = function join(out, offset) {
|
|
if (!out)
|
|
out = new Buffer$s(this.length);
|
|
if (!offset)
|
|
offset = 0;
|
|
|
|
if (this.length === 0)
|
|
return out;
|
|
|
|
if (Array.isArray(this.value)) {
|
|
this.value.forEach(function(item) {
|
|
item.join(out, offset);
|
|
offset += item.length;
|
|
});
|
|
} else {
|
|
if (typeof this.value === 'number')
|
|
out[offset] = this.value;
|
|
else if (typeof this.value === 'string')
|
|
out.write(this.value, offset);
|
|
else if (Buffer$s.isBuffer(this.value))
|
|
this.value.copy(out, offset);
|
|
offset += this.length;
|
|
}
|
|
|
|
return out;
|
|
};
|
|
|
|
var buffer = {
|
|
DecoderBuffer: DecoderBuffer_1,
|
|
EncoderBuffer: EncoderBuffer_1
|
|
};
|
|
|
|
var Reporter$2 = base_1.Reporter;
|
|
var EncoderBuffer$1 = base_1.EncoderBuffer;
|
|
var DecoderBuffer$1 = base_1.DecoderBuffer;
|
|
|
|
|
|
// Supported tags
|
|
var tags = [
|
|
'seq', 'seqof', 'set', 'setof', 'objid', 'bool',
|
|
'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',
|
|
'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',
|
|
'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'
|
|
];
|
|
|
|
// Public methods list
|
|
var methods = [
|
|
'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',
|
|
'any', 'contains'
|
|
].concat(tags);
|
|
|
|
// Overrided methods list
|
|
var overrided = [
|
|
'_peekTag', '_decodeTag', '_use',
|
|
'_decodeStr', '_decodeObjid', '_decodeTime',
|
|
'_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',
|
|
|
|
'_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',
|
|
'_encodeNull', '_encodeInt', '_encodeBool'
|
|
];
|
|
|
|
function Node(enc, parent) {
|
|
var state = {};
|
|
this._baseState = state;
|
|
|
|
state.enc = enc;
|
|
|
|
state.parent = parent || null;
|
|
state.children = null;
|
|
|
|
// State
|
|
state.tag = null;
|
|
state.args = null;
|
|
state.reverseArgs = null;
|
|
state.choice = null;
|
|
state.optional = false;
|
|
state.any = false;
|
|
state.obj = false;
|
|
state.use = null;
|
|
state.useDecoder = null;
|
|
state.key = null;
|
|
state['default'] = null;
|
|
state.explicit = null;
|
|
state.implicit = null;
|
|
state.contains = null;
|
|
|
|
// Should create new instance on each method
|
|
if (!state.parent) {
|
|
state.children = [];
|
|
this._wrap();
|
|
}
|
|
}
|
|
var node = Node;
|
|
|
|
var stateProps = [
|
|
'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',
|
|
'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',
|
|
'implicit', 'contains'
|
|
];
|
|
|
|
Node.prototype.clone = function clone() {
|
|
var state = this._baseState;
|
|
var cstate = {};
|
|
stateProps.forEach(function(prop) {
|
|
cstate[prop] = state[prop];
|
|
});
|
|
var res = new this.constructor(cstate.parent);
|
|
res._baseState = cstate;
|
|
return res;
|
|
};
|
|
|
|
Node.prototype._wrap = function wrap() {
|
|
var state = this._baseState;
|
|
methods.forEach(function(method) {
|
|
this[method] = function _wrappedMethod() {
|
|
var clone = new this.constructor(this);
|
|
state.children.push(clone);
|
|
return clone[method].apply(clone, arguments);
|
|
};
|
|
}, this);
|
|
};
|
|
|
|
Node.prototype._init = function init(body) {
|
|
var state = this._baseState;
|
|
|
|
minimalisticAssert(state.parent === null);
|
|
body.call(this);
|
|
|
|
// Filter children
|
|
state.children = state.children.filter(function(child) {
|
|
return child._baseState.parent === this;
|
|
}, this);
|
|
minimalisticAssert.equal(state.children.length, 1, 'Root node can have only one child');
|
|
};
|
|
|
|
Node.prototype._useArgs = function useArgs(args) {
|
|
var state = this._baseState;
|
|
|
|
// Filter children and args
|
|
var children = args.filter(function(arg) {
|
|
return arg instanceof this.constructor;
|
|
}, this);
|
|
args = args.filter(function(arg) {
|
|
return !(arg instanceof this.constructor);
|
|
}, this);
|
|
|
|
if (children.length !== 0) {
|
|
minimalisticAssert(state.children === null);
|
|
state.children = children;
|
|
|
|
// Replace parent to maintain backward link
|
|
children.forEach(function(child) {
|
|
child._baseState.parent = this;
|
|
}, this);
|
|
}
|
|
if (args.length !== 0) {
|
|
minimalisticAssert(state.args === null);
|
|
state.args = args;
|
|
state.reverseArgs = args.map(function(arg) {
|
|
if (typeof arg !== 'object' || arg.constructor !== Object)
|
|
return arg;
|
|
|
|
var res = {};
|
|
Object.keys(arg).forEach(function(key) {
|
|
if (key == (key | 0))
|
|
key |= 0;
|
|
var value = arg[key];
|
|
res[value] = key;
|
|
});
|
|
return res;
|
|
});
|
|
}
|
|
};
|
|
|
|
//
|
|
// Overrided methods
|
|
//
|
|
|
|
overrided.forEach(function(method) {
|
|
Node.prototype[method] = function _overrided() {
|
|
var state = this._baseState;
|
|
throw new Error(method + ' not implemented for encoding: ' + state.enc);
|
|
};
|
|
});
|
|
|
|
//
|
|
// Public methods
|
|
//
|
|
|
|
tags.forEach(function(tag) {
|
|
Node.prototype[tag] = function _tagMethod() {
|
|
var state = this._baseState;
|
|
var args = Array.prototype.slice.call(arguments);
|
|
|
|
minimalisticAssert(state.tag === null);
|
|
state.tag = tag;
|
|
|
|
this._useArgs(args);
|
|
|
|
return this;
|
|
};
|
|
});
|
|
|
|
Node.prototype.use = function use(item) {
|
|
minimalisticAssert(item);
|
|
var state = this._baseState;
|
|
|
|
minimalisticAssert(state.use === null);
|
|
state.use = item;
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.optional = function optional() {
|
|
var state = this._baseState;
|
|
|
|
state.optional = true;
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.def = function def(val) {
|
|
var state = this._baseState;
|
|
|
|
minimalisticAssert(state['default'] === null);
|
|
state['default'] = val;
|
|
state.optional = true;
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.explicit = function explicit(num) {
|
|
var state = this._baseState;
|
|
|
|
minimalisticAssert(state.explicit === null && state.implicit === null);
|
|
state.explicit = num;
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.implicit = function implicit(num) {
|
|
var state = this._baseState;
|
|
|
|
minimalisticAssert(state.explicit === null && state.implicit === null);
|
|
state.implicit = num;
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.obj = function obj() {
|
|
var state = this._baseState;
|
|
var args = Array.prototype.slice.call(arguments);
|
|
|
|
state.obj = true;
|
|
|
|
if (args.length !== 0)
|
|
this._useArgs(args);
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.key = function key(newKey) {
|
|
var state = this._baseState;
|
|
|
|
minimalisticAssert(state.key === null);
|
|
state.key = newKey;
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.any = function any() {
|
|
var state = this._baseState;
|
|
|
|
state.any = true;
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.choice = function choice(obj) {
|
|
var state = this._baseState;
|
|
|
|
minimalisticAssert(state.choice === null);
|
|
state.choice = obj;
|
|
this._useArgs(Object.keys(obj).map(function(key) {
|
|
return obj[key];
|
|
}));
|
|
|
|
return this;
|
|
};
|
|
|
|
Node.prototype.contains = function contains(item) {
|
|
var state = this._baseState;
|
|
|
|
minimalisticAssert(state.use === null);
|
|
state.contains = item;
|
|
|
|
return this;
|
|
};
|
|
|
|
//
|
|
// Decoding
|
|
//
|
|
|
|
Node.prototype._decode = function decode(input, options) {
|
|
var state = this._baseState;
|
|
|
|
// Decode root node
|
|
if (state.parent === null)
|
|
return input.wrapResult(state.children[0]._decode(input, options));
|
|
|
|
var result = state['default'];
|
|
var present = true;
|
|
|
|
var prevKey = null;
|
|
if (state.key !== null)
|
|
prevKey = input.enterKey(state.key);
|
|
|
|
// Check if tag is there
|
|
if (state.optional) {
|
|
var tag = null;
|
|
if (state.explicit !== null)
|
|
tag = state.explicit;
|
|
else if (state.implicit !== null)
|
|
tag = state.implicit;
|
|
else if (state.tag !== null)
|
|
tag = state.tag;
|
|
|
|
if (tag === null && !state.any) {
|
|
// Trial and Error
|
|
var save = input.save();
|
|
try {
|
|
if (state.choice === null)
|
|
this._decodeGeneric(state.tag, input, options);
|
|
else
|
|
this._decodeChoice(input, options);
|
|
present = true;
|
|
} catch (e) {
|
|
present = false;
|
|
}
|
|
input.restore(save);
|
|
} else {
|
|
present = this._peekTag(input, tag, state.any);
|
|
|
|
if (input.isError(present))
|
|
return present;
|
|
}
|
|
}
|
|
|
|
// Push object on stack
|
|
var prevObj;
|
|
if (state.obj && present)
|
|
prevObj = input.enterObject();
|
|
|
|
if (present) {
|
|
// Unwrap explicit values
|
|
if (state.explicit !== null) {
|
|
var explicit = this._decodeTag(input, state.explicit);
|
|
if (input.isError(explicit))
|
|
return explicit;
|
|
input = explicit;
|
|
}
|
|
|
|
var start = input.offset;
|
|
|
|
// Unwrap implicit and normal values
|
|
if (state.use === null && state.choice === null) {
|
|
if (state.any)
|
|
var save = input.save();
|
|
var body = this._decodeTag(
|
|
input,
|
|
state.implicit !== null ? state.implicit : state.tag,
|
|
state.any
|
|
);
|
|
if (input.isError(body))
|
|
return body;
|
|
|
|
if (state.any)
|
|
result = input.raw(save);
|
|
else
|
|
input = body;
|
|
}
|
|
|
|
if (options && options.track && state.tag !== null)
|
|
options.track(input.path(), start, input.length, 'tagged');
|
|
|
|
if (options && options.track && state.tag !== null)
|
|
options.track(input.path(), input.offset, input.length, 'content');
|
|
|
|
// Select proper method for tag
|
|
if (state.any)
|
|
result = result;
|
|
else if (state.choice === null)
|
|
result = this._decodeGeneric(state.tag, input, options);
|
|
else
|
|
result = this._decodeChoice(input, options);
|
|
|
|
if (input.isError(result))
|
|
return result;
|
|
|
|
// Decode children
|
|
if (!state.any && state.choice === null && state.children !== null) {
|
|
state.children.forEach(function decodeChildren(child) {
|
|
// NOTE: We are ignoring errors here, to let parser continue with other
|
|
// parts of encoded data
|
|
child._decode(input, options);
|
|
});
|
|
}
|
|
|
|
// Decode contained/encoded by schema, only in bit or octet strings
|
|
if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {
|
|
var data = new DecoderBuffer$1(result);
|
|
result = this._getUse(state.contains, input._reporterState.obj)
|
|
._decode(data, options);
|
|
}
|
|
}
|
|
|
|
// Pop object
|
|
if (state.obj && present)
|
|
result = input.leaveObject(prevObj);
|
|
|
|
// Set key
|
|
if (state.key !== null && (result !== null || present === true))
|
|
input.leaveKey(prevKey, state.key, result);
|
|
else if (prevKey !== null)
|
|
input.exitKey(prevKey);
|
|
|
|
return result;
|
|
};
|
|
|
|
Node.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {
|
|
var state = this._baseState;
|
|
|
|
if (tag === 'seq' || tag === 'set')
|
|
return null;
|
|
if (tag === 'seqof' || tag === 'setof')
|
|
return this._decodeList(input, tag, state.args[0], options);
|
|
else if (/str$/.test(tag))
|
|
return this._decodeStr(input, tag, options);
|
|
else if (tag === 'objid' && state.args)
|
|
return this._decodeObjid(input, state.args[0], state.args[1], options);
|
|
else if (tag === 'objid')
|
|
return this._decodeObjid(input, null, null, options);
|
|
else if (tag === 'gentime' || tag === 'utctime')
|
|
return this._decodeTime(input, tag, options);
|
|
else if (tag === 'null_')
|
|
return this._decodeNull(input, options);
|
|
else if (tag === 'bool')
|
|
return this._decodeBool(input, options);
|
|
else if (tag === 'objDesc')
|
|
return this._decodeStr(input, tag, options);
|
|
else if (tag === 'int' || tag === 'enum')
|
|
return this._decodeInt(input, state.args && state.args[0], options);
|
|
|
|
if (state.use !== null) {
|
|
return this._getUse(state.use, input._reporterState.obj)
|
|
._decode(input, options);
|
|
} else {
|
|
return input.error('unknown tag: ' + tag);
|
|
}
|
|
};
|
|
|
|
Node.prototype._getUse = function _getUse(entity, obj) {
|
|
|
|
var state = this._baseState;
|
|
// Create altered use decoder if implicit is set
|
|
state.useDecoder = this._use(entity, obj);
|
|
minimalisticAssert(state.useDecoder._baseState.parent === null);
|
|
state.useDecoder = state.useDecoder._baseState.children[0];
|
|
if (state.implicit !== state.useDecoder._baseState.implicit) {
|
|
state.useDecoder = state.useDecoder.clone();
|
|
state.useDecoder._baseState.implicit = state.implicit;
|
|
}
|
|
return state.useDecoder;
|
|
};
|
|
|
|
Node.prototype._decodeChoice = function decodeChoice(input, options) {
|
|
var state = this._baseState;
|
|
var result = null;
|
|
var match = false;
|
|
|
|
Object.keys(state.choice).some(function(key) {
|
|
var save = input.save();
|
|
var node = state.choice[key];
|
|
try {
|
|
var value = node._decode(input, options);
|
|
if (input.isError(value))
|
|
return false;
|
|
|
|
result = { type: key, value: value };
|
|
match = true;
|
|
} catch (e) {
|
|
input.restore(save);
|
|
return false;
|
|
}
|
|
return true;
|
|
}, this);
|
|
|
|
if (!match)
|
|
return input.error('Choice not matched');
|
|
|
|
return result;
|
|
};
|
|
|
|
//
|
|
// Encoding
|
|
//
|
|
|
|
Node.prototype._createEncoderBuffer = function createEncoderBuffer(data) {
|
|
return new EncoderBuffer$1(data, this.reporter);
|
|
};
|
|
|
|
Node.prototype._encode = function encode(data, reporter, parent) {
|
|
var state = this._baseState;
|
|
if (state['default'] !== null && state['default'] === data)
|
|
return;
|
|
|
|
var result = this._encodeValue(data, reporter, parent);
|
|
if (result === undefined)
|
|
return;
|
|
|
|
if (this._skipDefault(result, reporter, parent))
|
|
return;
|
|
|
|
return result;
|
|
};
|
|
|
|
Node.prototype._encodeValue = function encode(data, reporter, parent) {
|
|
var state = this._baseState;
|
|
|
|
// Decode root node
|
|
if (state.parent === null)
|
|
return state.children[0]._encode(data, reporter || new Reporter$2());
|
|
|
|
var result = null;
|
|
|
|
// Set reporter to share it with a child class
|
|
this.reporter = reporter;
|
|
|
|
// Check if data is there
|
|
if (state.optional && data === undefined) {
|
|
if (state['default'] !== null)
|
|
data = state['default'];
|
|
else
|
|
return;
|
|
}
|
|
|
|
// Encode children first
|
|
var content = null;
|
|
var primitive = false;
|
|
if (state.any) {
|
|
// Anything that was given is translated to buffer
|
|
result = this._createEncoderBuffer(data);
|
|
} else if (state.choice) {
|
|
result = this._encodeChoice(data, reporter);
|
|
} else if (state.contains) {
|
|
content = this._getUse(state.contains, parent)._encode(data, reporter);
|
|
primitive = true;
|
|
} else if (state.children) {
|
|
content = state.children.map(function(child) {
|
|
if (child._baseState.tag === 'null_')
|
|
return child._encode(null, reporter, data);
|
|
|
|
if (child._baseState.key === null)
|
|
return reporter.error('Child should have a key');
|
|
var prevKey = reporter.enterKey(child._baseState.key);
|
|
|
|
if (typeof data !== 'object')
|
|
return reporter.error('Child expected, but input is not object');
|
|
|
|
var res = child._encode(data[child._baseState.key], reporter, data);
|
|
reporter.leaveKey(prevKey);
|
|
|
|
return res;
|
|
}, this).filter(function(child) {
|
|
return child;
|
|
});
|
|
content = this._createEncoderBuffer(content);
|
|
} else {
|
|
if (state.tag === 'seqof' || state.tag === 'setof') {
|
|
// TODO(indutny): this should be thrown on DSL level
|
|
if (!(state.args && state.args.length === 1))
|
|
return reporter.error('Too many args for : ' + state.tag);
|
|
|
|
if (!Array.isArray(data))
|
|
return reporter.error('seqof/setof, but data is not Array');
|
|
|
|
var child = this.clone();
|
|
child._baseState.implicit = null;
|
|
content = this._createEncoderBuffer(data.map(function(item) {
|
|
var state = this._baseState;
|
|
|
|
return this._getUse(state.args[0], data)._encode(item, reporter);
|
|
}, child));
|
|
} else if (state.use !== null) {
|
|
result = this._getUse(state.use, parent)._encode(data, reporter);
|
|
} else {
|
|
content = this._encodePrimitive(state.tag, data);
|
|
primitive = true;
|
|
}
|
|
}
|
|
|
|
// Encode data itself
|
|
var result;
|
|
if (!state.any && state.choice === null) {
|
|
var tag = state.implicit !== null ? state.implicit : state.tag;
|
|
var cls = state.implicit === null ? 'universal' : 'context';
|
|
|
|
if (tag === null) {
|
|
if (state.use === null)
|
|
reporter.error('Tag could be omitted only for .use()');
|
|
} else {
|
|
if (state.use === null)
|
|
result = this._encodeComposite(tag, primitive, cls, content);
|
|
}
|
|
}
|
|
|
|
// Wrap in explicit
|
|
if (state.explicit !== null)
|
|
result = this._encodeComposite(state.explicit, false, 'context', result);
|
|
|
|
return result;
|
|
};
|
|
|
|
Node.prototype._encodeChoice = function encodeChoice(data, reporter) {
|
|
var state = this._baseState;
|
|
|
|
var node = state.choice[data.type];
|
|
if (!node) {
|
|
minimalisticAssert(
|
|
false,
|
|
data.type + ' not found in ' +
|
|
JSON.stringify(Object.keys(state.choice)));
|
|
}
|
|
return node._encode(data.value, reporter);
|
|
};
|
|
|
|
Node.prototype._encodePrimitive = function encodePrimitive(tag, data) {
|
|
var state = this._baseState;
|
|
|
|
if (/str$/.test(tag))
|
|
return this._encodeStr(data, tag);
|
|
else if (tag === 'objid' && state.args)
|
|
return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);
|
|
else if (tag === 'objid')
|
|
return this._encodeObjid(data, null, null);
|
|
else if (tag === 'gentime' || tag === 'utctime')
|
|
return this._encodeTime(data, tag);
|
|
else if (tag === 'null_')
|
|
return this._encodeNull();
|
|
else if (tag === 'int' || tag === 'enum')
|
|
return this._encodeInt(data, state.args && state.reverseArgs[0]);
|
|
else if (tag === 'bool')
|
|
return this._encodeBool(data);
|
|
else if (tag === 'objDesc')
|
|
return this._encodeStr(data, tag);
|
|
else
|
|
throw new Error('Unsupported tag: ' + tag);
|
|
};
|
|
|
|
Node.prototype._isNumstr = function isNumstr(str) {
|
|
return /^[0-9 ]*$/.test(str);
|
|
};
|
|
|
|
Node.prototype._isPrintstr = function isPrintstr(str) {
|
|
return /^[A-Za-z0-9 '\(\)\+,\-\.\/:=\?]*$/.test(str);
|
|
};
|
|
|
|
var base_1 = createCommonjsModule(function (module, exports) {
|
|
var base = exports;
|
|
|
|
base.Reporter = reporter.Reporter;
|
|
base.DecoderBuffer = buffer.DecoderBuffer;
|
|
base.EncoderBuffer = buffer.EncoderBuffer;
|
|
base.Node = node;
|
|
});
|
|
|
|
var der = createCommonjsModule(function (module, exports) {
|
|
exports.tagClass = {
|
|
0: 'universal',
|
|
1: 'application',
|
|
2: 'context',
|
|
3: 'private'
|
|
};
|
|
exports.tagClassByName = constants_1._reverse(exports.tagClass);
|
|
|
|
exports.tag = {
|
|
0x00: 'end',
|
|
0x01: 'bool',
|
|
0x02: 'int',
|
|
0x03: 'bitstr',
|
|
0x04: 'octstr',
|
|
0x05: 'null_',
|
|
0x06: 'objid',
|
|
0x07: 'objDesc',
|
|
0x08: 'external',
|
|
0x09: 'real',
|
|
0x0a: 'enum',
|
|
0x0b: 'embed',
|
|
0x0c: 'utf8str',
|
|
0x0d: 'relativeOid',
|
|
0x10: 'seq',
|
|
0x11: 'set',
|
|
0x12: 'numstr',
|
|
0x13: 'printstr',
|
|
0x14: 't61str',
|
|
0x15: 'videostr',
|
|
0x16: 'ia5str',
|
|
0x17: 'utctime',
|
|
0x18: 'gentime',
|
|
0x19: 'graphstr',
|
|
0x1a: 'iso646str',
|
|
0x1b: 'genstr',
|
|
0x1c: 'unistr',
|
|
0x1d: 'charstr',
|
|
0x1e: 'bmpstr'
|
|
};
|
|
exports.tagByName = constants_1._reverse(exports.tag);
|
|
});
|
|
var der_1 = der.tagClass;
|
|
var der_2 = der.tagClassByName;
|
|
var der_3 = der.tag;
|
|
var der_4 = der.tagByName;
|
|
|
|
var constants_1 = createCommonjsModule(function (module, exports) {
|
|
var constants = exports;
|
|
|
|
// Helper
|
|
constants._reverse = function reverse(map) {
|
|
var res = {};
|
|
|
|
Object.keys(map).forEach(function(key) {
|
|
// Convert key to integer if it is stringified
|
|
if ((key | 0) == key)
|
|
key = key | 0;
|
|
|
|
var value = map[key];
|
|
res[value] = key;
|
|
});
|
|
|
|
return res;
|
|
};
|
|
|
|
constants.der = der;
|
|
});
|
|
|
|
var base$1 = asn1_1.base;
|
|
var bignum = asn1_1.bignum;
|
|
|
|
// Import DER constants
|
|
var der$1 = asn1_1.constants.der;
|
|
|
|
function DERDecoder(entity) {
|
|
this.enc = 'der';
|
|
this.name = entity.name;
|
|
this.entity = entity;
|
|
|
|
// Construct base tree
|
|
this.tree = new DERNode();
|
|
this.tree._init(entity.body);
|
|
}var der_1$1 = DERDecoder;
|
|
|
|
DERDecoder.prototype.decode = function decode(data, options) {
|
|
if (!(data instanceof base$1.DecoderBuffer))
|
|
data = new base$1.DecoderBuffer(data, options);
|
|
|
|
return this.tree._decode(data, options);
|
|
};
|
|
|
|
// Tree methods
|
|
|
|
function DERNode(parent) {
|
|
base$1.Node.call(this, 'der', parent);
|
|
}
|
|
inherits_browser(DERNode, base$1.Node);
|
|
|
|
DERNode.prototype._peekTag = function peekTag(buffer, tag, any) {
|
|
if (buffer.isEmpty())
|
|
return false;
|
|
|
|
var state = buffer.save();
|
|
var decodedTag = derDecodeTag(buffer, 'Failed to peek tag: "' + tag + '"');
|
|
if (buffer.isError(decodedTag))
|
|
return decodedTag;
|
|
|
|
buffer.restore(state);
|
|
|
|
return decodedTag.tag === tag || decodedTag.tagStr === tag ||
|
|
(decodedTag.tagStr + 'of') === tag || any;
|
|
};
|
|
|
|
DERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {
|
|
var decodedTag = derDecodeTag(buffer,
|
|
'Failed to decode tag of "' + tag + '"');
|
|
if (buffer.isError(decodedTag))
|
|
return decodedTag;
|
|
|
|
var len = derDecodeLen(buffer,
|
|
decodedTag.primitive,
|
|
'Failed to get length of "' + tag + '"');
|
|
|
|
// Failure
|
|
if (buffer.isError(len))
|
|
return len;
|
|
|
|
if (!any &&
|
|
decodedTag.tag !== tag &&
|
|
decodedTag.tagStr !== tag &&
|
|
decodedTag.tagStr + 'of' !== tag) {
|
|
return buffer.error('Failed to match tag: "' + tag + '"');
|
|
}
|
|
|
|
if (decodedTag.primitive || len !== null)
|
|
return buffer.skip(len, 'Failed to match body of: "' + tag + '"');
|
|
|
|
// Indefinite length... find END tag
|
|
var state = buffer.save();
|
|
var res = this._skipUntilEnd(
|
|
buffer,
|
|
'Failed to skip indefinite length body: "' + this.tag + '"');
|
|
if (buffer.isError(res))
|
|
return res;
|
|
|
|
len = buffer.offset - state.offset;
|
|
buffer.restore(state);
|
|
return buffer.skip(len, 'Failed to match body of: "' + tag + '"');
|
|
};
|
|
|
|
DERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {
|
|
while (true) {
|
|
var tag = derDecodeTag(buffer, fail);
|
|
if (buffer.isError(tag))
|
|
return tag;
|
|
var len = derDecodeLen(buffer, tag.primitive, fail);
|
|
if (buffer.isError(len))
|
|
return len;
|
|
|
|
var res;
|
|
if (tag.primitive || len !== null)
|
|
res = buffer.skip(len);
|
|
else
|
|
res = this._skipUntilEnd(buffer, fail);
|
|
|
|
// Failure
|
|
if (buffer.isError(res))
|
|
return res;
|
|
|
|
if (tag.tagStr === 'end')
|
|
break;
|
|
}
|
|
};
|
|
|
|
DERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,
|
|
options) {
|
|
var result = [];
|
|
while (!buffer.isEmpty()) {
|
|
var possibleEnd = this._peekTag(buffer, 'end');
|
|
if (buffer.isError(possibleEnd))
|
|
return possibleEnd;
|
|
|
|
var res = decoder.decode(buffer, 'der', options);
|
|
if (buffer.isError(res) && possibleEnd)
|
|
break;
|
|
result.push(res);
|
|
}
|
|
return result;
|
|
};
|
|
|
|
DERNode.prototype._decodeStr = function decodeStr(buffer, tag) {
|
|
if (tag === 'bitstr') {
|
|
var unused = buffer.readUInt8();
|
|
if (buffer.isError(unused))
|
|
return unused;
|
|
return { unused: unused, data: buffer.raw() };
|
|
} else if (tag === 'bmpstr') {
|
|
var raw = buffer.raw();
|
|
if (raw.length % 2 === 1)
|
|
return buffer.error('Decoding of string type: bmpstr length mismatch');
|
|
|
|
var str = '';
|
|
for (var i = 0; i < raw.length / 2; i++) {
|
|
str += String.fromCharCode(raw.readUInt16BE(i * 2));
|
|
}
|
|
return str;
|
|
} else if (tag === 'numstr') {
|
|
var numstr = buffer.raw().toString('ascii');
|
|
if (!this._isNumstr(numstr)) {
|
|
return buffer.error('Decoding of string type: ' +
|
|
'numstr unsupported characters');
|
|
}
|
|
return numstr;
|
|
} else if (tag === 'octstr') {
|
|
return buffer.raw();
|
|
} else if (tag === 'objDesc') {
|
|
return buffer.raw();
|
|
} else if (tag === 'printstr') {
|
|
var printstr = buffer.raw().toString('ascii');
|
|
if (!this._isPrintstr(printstr)) {
|
|
return buffer.error('Decoding of string type: ' +
|
|
'printstr unsupported characters');
|
|
}
|
|
return printstr;
|
|
} else if (/str$/.test(tag)) {
|
|
return buffer.raw().toString();
|
|
} else {
|
|
return buffer.error('Decoding of string type: ' + tag + ' unsupported');
|
|
}
|
|
};
|
|
|
|
DERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {
|
|
var result;
|
|
var identifiers = [];
|
|
var ident = 0;
|
|
while (!buffer.isEmpty()) {
|
|
var subident = buffer.readUInt8();
|
|
ident <<= 7;
|
|
ident |= subident & 0x7f;
|
|
if ((subident & 0x80) === 0) {
|
|
identifiers.push(ident);
|
|
ident = 0;
|
|
}
|
|
}
|
|
if (subident & 0x80)
|
|
identifiers.push(ident);
|
|
|
|
var first = (identifiers[0] / 40) | 0;
|
|
var second = identifiers[0] % 40;
|
|
|
|
if (relative)
|
|
result = identifiers;
|
|
else
|
|
result = [first, second].concat(identifiers.slice(1));
|
|
|
|
if (values) {
|
|
var tmp = values[result.join(' ')];
|
|
if (tmp === undefined)
|
|
tmp = values[result.join('.')];
|
|
if (tmp !== undefined)
|
|
result = tmp;
|
|
}
|
|
|
|
return result;
|
|
};
|
|
|
|
DERNode.prototype._decodeTime = function decodeTime(buffer, tag) {
|
|
var str = buffer.raw().toString();
|
|
if (tag === 'gentime') {
|
|
var year = str.slice(0, 4) | 0;
|
|
var mon = str.slice(4, 6) | 0;
|
|
var day = str.slice(6, 8) | 0;
|
|
var hour = str.slice(8, 10) | 0;
|
|
var min = str.slice(10, 12) | 0;
|
|
var sec = str.slice(12, 14) | 0;
|
|
} else if (tag === 'utctime') {
|
|
var year = str.slice(0, 2) | 0;
|
|
var mon = str.slice(2, 4) | 0;
|
|
var day = str.slice(4, 6) | 0;
|
|
var hour = str.slice(6, 8) | 0;
|
|
var min = str.slice(8, 10) | 0;
|
|
var sec = str.slice(10, 12) | 0;
|
|
if (year < 70)
|
|
year = 2000 + year;
|
|
else
|
|
year = 1900 + year;
|
|
} else {
|
|
return buffer.error('Decoding ' + tag + ' time is not supported yet');
|
|
}
|
|
|
|
return Date.UTC(year, mon - 1, day, hour, min, sec, 0);
|
|
};
|
|
|
|
DERNode.prototype._decodeNull = function decodeNull(buffer) {
|
|
return null;
|
|
};
|
|
|
|
DERNode.prototype._decodeBool = function decodeBool(buffer) {
|
|
var res = buffer.readUInt8();
|
|
if (buffer.isError(res))
|
|
return res;
|
|
else
|
|
return res !== 0;
|
|
};
|
|
|
|
DERNode.prototype._decodeInt = function decodeInt(buffer, values) {
|
|
// Bigint, return as it is (assume big endian)
|
|
var raw = buffer.raw();
|
|
var res = new bignum(raw);
|
|
|
|
if (values)
|
|
res = values[res.toString(10)] || res;
|
|
|
|
return res;
|
|
};
|
|
|
|
DERNode.prototype._use = function use(entity, obj) {
|
|
if (typeof entity === 'function')
|
|
entity = entity(obj);
|
|
return entity._getDecoder('der').tree;
|
|
};
|
|
|
|
// Utility methods
|
|
|
|
function derDecodeTag(buf, fail) {
|
|
var tag = buf.readUInt8(fail);
|
|
if (buf.isError(tag))
|
|
return tag;
|
|
|
|
var cls = der$1.tagClass[tag >> 6];
|
|
var primitive = (tag & 0x20) === 0;
|
|
|
|
// Multi-octet tag - load
|
|
if ((tag & 0x1f) === 0x1f) {
|
|
var oct = tag;
|
|
tag = 0;
|
|
while ((oct & 0x80) === 0x80) {
|
|
oct = buf.readUInt8(fail);
|
|
if (buf.isError(oct))
|
|
return oct;
|
|
|
|
tag <<= 7;
|
|
tag |= oct & 0x7f;
|
|
}
|
|
} else {
|
|
tag &= 0x1f;
|
|
}
|
|
var tagStr = der$1.tag[tag];
|
|
|
|
return {
|
|
cls: cls,
|
|
primitive: primitive,
|
|
tag: tag,
|
|
tagStr: tagStr
|
|
};
|
|
}
|
|
|
|
function derDecodeLen(buf, primitive, fail) {
|
|
var len = buf.readUInt8(fail);
|
|
if (buf.isError(len))
|
|
return len;
|
|
|
|
// Indefinite form
|
|
if (!primitive && len === 0x80)
|
|
return null;
|
|
|
|
// Definite form
|
|
if ((len & 0x80) === 0) {
|
|
// Short form
|
|
return len;
|
|
}
|
|
|
|
// Long form
|
|
var num = len & 0x7f;
|
|
if (num > 4)
|
|
return buf.error('length octect is too long');
|
|
|
|
len = 0;
|
|
for (var i = 0; i < num; i++) {
|
|
len <<= 8;
|
|
var j = buf.readUInt8(fail);
|
|
if (buf.isError(j))
|
|
return j;
|
|
len |= j;
|
|
}
|
|
|
|
return len;
|
|
}
|
|
|
|
var Buffer$t = buffer$1.Buffer;
|
|
|
|
|
|
|
|
function PEMDecoder(entity) {
|
|
der_1$1.call(this, entity);
|
|
this.enc = 'pem';
|
|
}inherits_browser(PEMDecoder, der_1$1);
|
|
var pem = PEMDecoder;
|
|
|
|
PEMDecoder.prototype.decode = function decode(data, options) {
|
|
var lines = data.toString().split(/[\r\n]+/g);
|
|
|
|
var label = options.label.toUpperCase();
|
|
|
|
var re = /^-----(BEGIN|END) ([^-]+)-----$/;
|
|
var start = -1;
|
|
var end = -1;
|
|
for (var i = 0; i < lines.length; i++) {
|
|
var match = lines[i].match(re);
|
|
if (match === null)
|
|
continue;
|
|
|
|
if (match[2] !== label)
|
|
continue;
|
|
|
|
if (start === -1) {
|
|
if (match[1] !== 'BEGIN')
|
|
break;
|
|
start = i;
|
|
} else {
|
|
if (match[1] !== 'END')
|
|
break;
|
|
end = i;
|
|
break;
|
|
}
|
|
}
|
|
if (start === -1 || end === -1)
|
|
throw new Error('PEM section not found for: ' + label);
|
|
|
|
var base64 = lines.slice(start + 1, end).join('');
|
|
// Remove excessive symbols
|
|
base64.replace(/[^a-z0-9\+\/=]+/gi, '');
|
|
|
|
var input = new Buffer$t(base64, 'base64');
|
|
return der_1$1.prototype.decode.call(this, input, options);
|
|
};
|
|
|
|
var decoders_1 = createCommonjsModule(function (module, exports) {
|
|
var decoders = exports;
|
|
|
|
decoders.der = der_1$1;
|
|
decoders.pem = pem;
|
|
});
|
|
|
|
var Buffer$u = buffer$1.Buffer;
|
|
|
|
|
|
var base$2 = asn1_1.base;
|
|
|
|
// Import DER constants
|
|
var der$2 = asn1_1.constants.der;
|
|
|
|
function DEREncoder(entity) {
|
|
this.enc = 'der';
|
|
this.name = entity.name;
|
|
this.entity = entity;
|
|
|
|
// Construct base tree
|
|
this.tree = new DERNode$1();
|
|
this.tree._init(entity.body);
|
|
}var der_1$2 = DEREncoder;
|
|
|
|
DEREncoder.prototype.encode = function encode(data, reporter) {
|
|
return this.tree._encode(data, reporter).join();
|
|
};
|
|
|
|
// Tree methods
|
|
|
|
function DERNode$1(parent) {
|
|
base$2.Node.call(this, 'der', parent);
|
|
}
|
|
inherits_browser(DERNode$1, base$2.Node);
|
|
|
|
DERNode$1.prototype._encodeComposite = function encodeComposite(tag,
|
|
primitive,
|
|
cls,
|
|
content) {
|
|
var encodedTag = encodeTag(tag, primitive, cls, this.reporter);
|
|
|
|
// Short form
|
|
if (content.length < 0x80) {
|
|
var header = new Buffer$u(2);
|
|
header[0] = encodedTag;
|
|
header[1] = content.length;
|
|
return this._createEncoderBuffer([ header, content ]);
|
|
}
|
|
|
|
// Long form
|
|
// Count octets required to store length
|
|
var lenOctets = 1;
|
|
for (var i = content.length; i >= 0x100; i >>= 8)
|
|
lenOctets++;
|
|
|
|
var header = new Buffer$u(1 + 1 + lenOctets);
|
|
header[0] = encodedTag;
|
|
header[1] = 0x80 | lenOctets;
|
|
|
|
for (var i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)
|
|
header[i] = j & 0xff;
|
|
|
|
return this._createEncoderBuffer([ header, content ]);
|
|
};
|
|
|
|
DERNode$1.prototype._encodeStr = function encodeStr(str, tag) {
|
|
if (tag === 'bitstr') {
|
|
return this._createEncoderBuffer([ str.unused | 0, str.data ]);
|
|
} else if (tag === 'bmpstr') {
|
|
var buf = new Buffer$u(str.length * 2);
|
|
for (var i = 0; i < str.length; i++) {
|
|
buf.writeUInt16BE(str.charCodeAt(i), i * 2);
|
|
}
|
|
return this._createEncoderBuffer(buf);
|
|
} else if (tag === 'numstr') {
|
|
if (!this._isNumstr(str)) {
|
|
return this.reporter.error('Encoding of string type: numstr supports ' +
|
|
'only digits and space');
|
|
}
|
|
return this._createEncoderBuffer(str);
|
|
} else if (tag === 'printstr') {
|
|
if (!this._isPrintstr(str)) {
|
|
return this.reporter.error('Encoding of string type: printstr supports ' +
|
|
'only latin upper and lower case letters, ' +
|
|
'digits, space, apostrophe, left and rigth ' +
|
|
'parenthesis, plus sign, comma, hyphen, ' +
|
|
'dot, slash, colon, equal sign, ' +
|
|
'question mark');
|
|
}
|
|
return this._createEncoderBuffer(str);
|
|
} else if (/str$/.test(tag)) {
|
|
return this._createEncoderBuffer(str);
|
|
} else if (tag === 'objDesc') {
|
|
return this._createEncoderBuffer(str);
|
|
} else {
|
|
return this.reporter.error('Encoding of string type: ' + tag +
|
|
' unsupported');
|
|
}
|
|
};
|
|
|
|
DERNode$1.prototype._encodeObjid = function encodeObjid(id, values, relative) {
|
|
if (typeof id === 'string') {
|
|
if (!values)
|
|
return this.reporter.error('string objid given, but no values map found');
|
|
if (!values.hasOwnProperty(id))
|
|
return this.reporter.error('objid not found in values map');
|
|
id = values[id].split(/[\s\.]+/g);
|
|
for (var i = 0; i < id.length; i++)
|
|
id[i] |= 0;
|
|
} else if (Array.isArray(id)) {
|
|
id = id.slice();
|
|
for (var i = 0; i < id.length; i++)
|
|
id[i] |= 0;
|
|
}
|
|
|
|
if (!Array.isArray(id)) {
|
|
return this.reporter.error('objid() should be either array or string, ' +
|
|
'got: ' + JSON.stringify(id));
|
|
}
|
|
|
|
if (!relative) {
|
|
if (id[1] >= 40)
|
|
return this.reporter.error('Second objid identifier OOB');
|
|
id.splice(0, 2, id[0] * 40 + id[1]);
|
|
}
|
|
|
|
// Count number of octets
|
|
var size = 0;
|
|
for (var i = 0; i < id.length; i++) {
|
|
var ident = id[i];
|
|
for (size++; ident >= 0x80; ident >>= 7)
|
|
size++;
|
|
}
|
|
|
|
var objid = new Buffer$u(size);
|
|
var offset = objid.length - 1;
|
|
for (var i = id.length - 1; i >= 0; i--) {
|
|
var ident = id[i];
|
|
objid[offset--] = ident & 0x7f;
|
|
while ((ident >>= 7) > 0)
|
|
objid[offset--] = 0x80 | (ident & 0x7f);
|
|
}
|
|
|
|
return this._createEncoderBuffer(objid);
|
|
};
|
|
|
|
function two(num) {
|
|
if (num < 10)
|
|
return '0' + num;
|
|
else
|
|
return num;
|
|
}
|
|
|
|
DERNode$1.prototype._encodeTime = function encodeTime(time, tag) {
|
|
var str;
|
|
var date = new Date(time);
|
|
|
|
if (tag === 'gentime') {
|
|
str = [
|
|
two(date.getFullYear()),
|
|
two(date.getUTCMonth() + 1),
|
|
two(date.getUTCDate()),
|
|
two(date.getUTCHours()),
|
|
two(date.getUTCMinutes()),
|
|
two(date.getUTCSeconds()),
|
|
'Z'
|
|
].join('');
|
|
} else if (tag === 'utctime') {
|
|
str = [
|
|
two(date.getFullYear() % 100),
|
|
two(date.getUTCMonth() + 1),
|
|
two(date.getUTCDate()),
|
|
two(date.getUTCHours()),
|
|
two(date.getUTCMinutes()),
|
|
two(date.getUTCSeconds()),
|
|
'Z'
|
|
].join('');
|
|
} else {
|
|
this.reporter.error('Encoding ' + tag + ' time is not supported yet');
|
|
}
|
|
|
|
return this._encodeStr(str, 'octstr');
|
|
};
|
|
|
|
DERNode$1.prototype._encodeNull = function encodeNull() {
|
|
return this._createEncoderBuffer('');
|
|
};
|
|
|
|
DERNode$1.prototype._encodeInt = function encodeInt(num, values) {
|
|
if (typeof num === 'string') {
|
|
if (!values)
|
|
return this.reporter.error('String int or enum given, but no values map');
|
|
if (!values.hasOwnProperty(num)) {
|
|
return this.reporter.error('Values map doesn\'t contain: ' +
|
|
JSON.stringify(num));
|
|
}
|
|
num = values[num];
|
|
}
|
|
|
|
// Bignum, assume big endian
|
|
if (typeof num !== 'number' && !Buffer$u.isBuffer(num)) {
|
|
var numArray = num.toArray();
|
|
if (!num.sign && numArray[0] & 0x80) {
|
|
numArray.unshift(0);
|
|
}
|
|
num = new Buffer$u(numArray);
|
|
}
|
|
|
|
if (Buffer$u.isBuffer(num)) {
|
|
var size = num.length;
|
|
if (num.length === 0)
|
|
size++;
|
|
|
|
var out = new Buffer$u(size);
|
|
num.copy(out);
|
|
if (num.length === 0)
|
|
out[0] = 0;
|
|
return this._createEncoderBuffer(out);
|
|
}
|
|
|
|
if (num < 0x80)
|
|
return this._createEncoderBuffer(num);
|
|
|
|
if (num < 0x100)
|
|
return this._createEncoderBuffer([0, num]);
|
|
|
|
var size = 1;
|
|
for (var i = num; i >= 0x100; i >>= 8)
|
|
size++;
|
|
|
|
var out = new Array(size);
|
|
for (var i = out.length - 1; i >= 0; i--) {
|
|
out[i] = num & 0xff;
|
|
num >>= 8;
|
|
}
|
|
if(out[0] & 0x80) {
|
|
out.unshift(0);
|
|
}
|
|
|
|
return this._createEncoderBuffer(new Buffer$u(out));
|
|
};
|
|
|
|
DERNode$1.prototype._encodeBool = function encodeBool(value) {
|
|
return this._createEncoderBuffer(value ? 0xff : 0);
|
|
};
|
|
|
|
DERNode$1.prototype._use = function use(entity, obj) {
|
|
if (typeof entity === 'function')
|
|
entity = entity(obj);
|
|
return entity._getEncoder('der').tree;
|
|
};
|
|
|
|
DERNode$1.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {
|
|
var state = this._baseState;
|
|
var i;
|
|
if (state['default'] === null)
|
|
return false;
|
|
|
|
var data = dataBuffer.join();
|
|
if (state.defaultBuffer === undefined)
|
|
state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();
|
|
|
|
if (data.length !== state.defaultBuffer.length)
|
|
return false;
|
|
|
|
for (i=0; i < data.length; i++)
|
|
if (data[i] !== state.defaultBuffer[i])
|
|
return false;
|
|
|
|
return true;
|
|
};
|
|
|
|
// Utility methods
|
|
|
|
function encodeTag(tag, primitive, cls, reporter) {
|
|
var res;
|
|
|
|
if (tag === 'seqof')
|
|
tag = 'seq';
|
|
else if (tag === 'setof')
|
|
tag = 'set';
|
|
|
|
if (der$2.tagByName.hasOwnProperty(tag))
|
|
res = der$2.tagByName[tag];
|
|
else if (typeof tag === 'number' && (tag | 0) === tag)
|
|
res = tag;
|
|
else
|
|
return reporter.error('Unknown tag: ' + tag);
|
|
|
|
if (res >= 0x1f)
|
|
return reporter.error('Multi-octet tag encoding unsupported');
|
|
|
|
if (!primitive)
|
|
res |= 0x20;
|
|
|
|
res |= (der$2.tagClassByName[cls || 'universal'] << 6);
|
|
|
|
return res;
|
|
}
|
|
|
|
function PEMEncoder(entity) {
|
|
der_1$2.call(this, entity);
|
|
this.enc = 'pem';
|
|
}inherits_browser(PEMEncoder, der_1$2);
|
|
var pem$1 = PEMEncoder;
|
|
|
|
PEMEncoder.prototype.encode = function encode(data, options) {
|
|
var buf = der_1$2.prototype.encode.call(this, data);
|
|
|
|
var p = buf.toString('base64');
|
|
var out = [ '-----BEGIN ' + options.label + '-----' ];
|
|
for (var i = 0; i < p.length; i += 64)
|
|
out.push(p.slice(i, i + 64));
|
|
out.push('-----END ' + options.label + '-----');
|
|
return out.join('\n');
|
|
};
|
|
|
|
var encoders_1 = createCommonjsModule(function (module, exports) {
|
|
var encoders = exports;
|
|
|
|
encoders.der = der_1$2;
|
|
encoders.pem = pem$1;
|
|
});
|
|
|
|
var asn1_1 = createCommonjsModule(function (module, exports) {
|
|
var asn1 = exports;
|
|
|
|
asn1.bignum = bn;
|
|
|
|
asn1.define = api_1.define;
|
|
asn1.base = base_1;
|
|
asn1.constants = constants_1;
|
|
asn1.decoders = decoders_1;
|
|
asn1.encoders = encoders_1;
|
|
});
|
|
|
|
var Time = asn1_1.define('Time', function () {
|
|
this.choice({
|
|
utcTime: this.utctime(),
|
|
generalTime: this.gentime()
|
|
});
|
|
});
|
|
|
|
var AttributeTypeValue = asn1_1.define('AttributeTypeValue', function () {
|
|
this.seq().obj(
|
|
this.key('type').objid(),
|
|
this.key('value').any()
|
|
);
|
|
});
|
|
|
|
var AlgorithmIdentifier = asn1_1.define('AlgorithmIdentifier', function () {
|
|
this.seq().obj(
|
|
this.key('algorithm').objid(),
|
|
this.key('parameters').optional(),
|
|
this.key('curve').objid().optional()
|
|
);
|
|
});
|
|
|
|
var SubjectPublicKeyInfo = asn1_1.define('SubjectPublicKeyInfo', function () {
|
|
this.seq().obj(
|
|
this.key('algorithm').use(AlgorithmIdentifier),
|
|
this.key('subjectPublicKey').bitstr()
|
|
);
|
|
});
|
|
|
|
var RelativeDistinguishedName = asn1_1.define('RelativeDistinguishedName', function () {
|
|
this.setof(AttributeTypeValue);
|
|
});
|
|
|
|
var RDNSequence = asn1_1.define('RDNSequence', function () {
|
|
this.seqof(RelativeDistinguishedName);
|
|
});
|
|
|
|
var Name = asn1_1.define('Name', function () {
|
|
this.choice({
|
|
rdnSequence: this.use(RDNSequence)
|
|
});
|
|
});
|
|
|
|
var Validity = asn1_1.define('Validity', function () {
|
|
this.seq().obj(
|
|
this.key('notBefore').use(Time),
|
|
this.key('notAfter').use(Time)
|
|
);
|
|
});
|
|
|
|
var Extension = asn1_1.define('Extension', function () {
|
|
this.seq().obj(
|
|
this.key('extnID').objid(),
|
|
this.key('critical').bool().def(false),
|
|
this.key('extnValue').octstr()
|
|
);
|
|
});
|
|
|
|
var TBSCertificate = asn1_1.define('TBSCertificate', function () {
|
|
this.seq().obj(
|
|
this.key('version').explicit(0).int().optional(),
|
|
this.key('serialNumber').int(),
|
|
this.key('signature').use(AlgorithmIdentifier),
|
|
this.key('issuer').use(Name),
|
|
this.key('validity').use(Validity),
|
|
this.key('subject').use(Name),
|
|
this.key('subjectPublicKeyInfo').use(SubjectPublicKeyInfo),
|
|
this.key('issuerUniqueID').implicit(1).bitstr().optional(),
|
|
this.key('subjectUniqueID').implicit(2).bitstr().optional(),
|
|
this.key('extensions').explicit(3).seqof(Extension).optional()
|
|
);
|
|
});
|
|
|
|
var X509Certificate = asn1_1.define('X509Certificate', function () {
|
|
this.seq().obj(
|
|
this.key('tbsCertificate').use(TBSCertificate),
|
|
this.key('signatureAlgorithm').use(AlgorithmIdentifier),
|
|
this.key('signatureValue').bitstr()
|
|
);
|
|
});
|
|
|
|
var certificate = X509Certificate;
|
|
|
|
var certificate$1 = certificate;
|
|
|
|
var RSAPrivateKey = asn1_1.define('RSAPrivateKey', function () {
|
|
this.seq().obj(
|
|
this.key('version').int(),
|
|
this.key('modulus').int(),
|
|
this.key('publicExponent').int(),
|
|
this.key('privateExponent').int(),
|
|
this.key('prime1').int(),
|
|
this.key('prime2').int(),
|
|
this.key('exponent1').int(),
|
|
this.key('exponent2').int(),
|
|
this.key('coefficient').int()
|
|
);
|
|
});
|
|
var RSAPrivateKey_1 = RSAPrivateKey;
|
|
|
|
var RSAPublicKey = asn1_1.define('RSAPublicKey', function () {
|
|
this.seq().obj(
|
|
this.key('modulus').int(),
|
|
this.key('publicExponent').int()
|
|
);
|
|
});
|
|
var RSAPublicKey_1 = RSAPublicKey;
|
|
|
|
var PublicKey = asn1_1.define('SubjectPublicKeyInfo', function () {
|
|
this.seq().obj(
|
|
this.key('algorithm').use(AlgorithmIdentifier$1),
|
|
this.key('subjectPublicKey').bitstr()
|
|
);
|
|
});
|
|
var PublicKey_1 = PublicKey;
|
|
|
|
var AlgorithmIdentifier$1 = asn1_1.define('AlgorithmIdentifier', function () {
|
|
this.seq().obj(
|
|
this.key('algorithm').objid(),
|
|
this.key('none').null_().optional(),
|
|
this.key('curve').objid().optional(),
|
|
this.key('params').seq().obj(
|
|
this.key('p').int(),
|
|
this.key('q').int(),
|
|
this.key('g').int()
|
|
).optional()
|
|
);
|
|
});
|
|
|
|
var PrivateKeyInfo = asn1_1.define('PrivateKeyInfo', function () {
|
|
this.seq().obj(
|
|
this.key('version').int(),
|
|
this.key('algorithm').use(AlgorithmIdentifier$1),
|
|
this.key('subjectPrivateKey').octstr()
|
|
);
|
|
});
|
|
var PrivateKey = PrivateKeyInfo;
|
|
var EncryptedPrivateKeyInfo = asn1_1.define('EncryptedPrivateKeyInfo', function () {
|
|
this.seq().obj(
|
|
this.key('algorithm').seq().obj(
|
|
this.key('id').objid(),
|
|
this.key('decrypt').seq().obj(
|
|
this.key('kde').seq().obj(
|
|
this.key('id').objid(),
|
|
this.key('kdeparams').seq().obj(
|
|
this.key('salt').octstr(),
|
|
this.key('iters').int()
|
|
)
|
|
),
|
|
this.key('cipher').seq().obj(
|
|
this.key('algo').objid(),
|
|
this.key('iv').octstr()
|
|
)
|
|
)
|
|
),
|
|
this.key('subjectPrivateKey').octstr()
|
|
);
|
|
});
|
|
|
|
var EncryptedPrivateKey = EncryptedPrivateKeyInfo;
|
|
|
|
var DSAPrivateKey = asn1_1.define('DSAPrivateKey', function () {
|
|
this.seq().obj(
|
|
this.key('version').int(),
|
|
this.key('p').int(),
|
|
this.key('q').int(),
|
|
this.key('g').int(),
|
|
this.key('pub_key').int(),
|
|
this.key('priv_key').int()
|
|
);
|
|
});
|
|
var DSAPrivateKey_1 = DSAPrivateKey;
|
|
|
|
var DSAparam = asn1_1.define('DSAparam', function () {
|
|
this.int();
|
|
});
|
|
|
|
var ECPrivateKey = asn1_1.define('ECPrivateKey', function () {
|
|
this.seq().obj(
|
|
this.key('version').int(),
|
|
this.key('privateKey').octstr(),
|
|
this.key('parameters').optional().explicit(0).use(ECParameters),
|
|
this.key('publicKey').optional().explicit(1).bitstr()
|
|
);
|
|
});
|
|
var ECPrivateKey_1 = ECPrivateKey;
|
|
|
|
var ECParameters = asn1_1.define('ECParameters', function () {
|
|
this.choice({
|
|
namedCurve: this.objid()
|
|
});
|
|
});
|
|
|
|
var signature$2 = asn1_1.define('signature', function () {
|
|
this.seq().obj(
|
|
this.key('r').int(),
|
|
this.key('s').int()
|
|
);
|
|
});
|
|
|
|
var asn1_1$1 = {
|
|
certificate: certificate$1,
|
|
RSAPrivateKey: RSAPrivateKey_1,
|
|
RSAPublicKey: RSAPublicKey_1,
|
|
PublicKey: PublicKey_1,
|
|
PrivateKey: PrivateKey,
|
|
EncryptedPrivateKey: EncryptedPrivateKey,
|
|
DSAPrivateKey: DSAPrivateKey_1,
|
|
DSAparam: DSAparam,
|
|
ECPrivateKey: ECPrivateKey_1,
|
|
signature: signature$2
|
|
};
|
|
|
|
var aesid = {
|
|
"2.16.840.1.101.3.4.1.1": "aes-128-ecb",
|
|
"2.16.840.1.101.3.4.1.2": "aes-128-cbc",
|
|
"2.16.840.1.101.3.4.1.3": "aes-128-ofb",
|
|
"2.16.840.1.101.3.4.1.4": "aes-128-cfb",
|
|
"2.16.840.1.101.3.4.1.21": "aes-192-ecb",
|
|
"2.16.840.1.101.3.4.1.22": "aes-192-cbc",
|
|
"2.16.840.1.101.3.4.1.23": "aes-192-ofb",
|
|
"2.16.840.1.101.3.4.1.24": "aes-192-cfb",
|
|
"2.16.840.1.101.3.4.1.41": "aes-256-ecb",
|
|
"2.16.840.1.101.3.4.1.42": "aes-256-cbc",
|
|
"2.16.840.1.101.3.4.1.43": "aes-256-ofb",
|
|
"2.16.840.1.101.3.4.1.44": "aes-256-cfb"
|
|
};
|
|
|
|
var aesid$1 = /*#__PURE__*/Object.freeze({
|
|
'default': aesid
|
|
});
|
|
|
|
// adapted from https://github.com/apatil/pemstrip
|
|
var findProc = /Proc-Type: 4,ENCRYPTED[\n\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\n\r]+([0-9A-z\n\r\+\/\=]+)[\n\r]+/m;
|
|
var startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m;
|
|
var fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\n\r\+\/\=]+)-----END \1-----$/m;
|
|
|
|
|
|
var Buffer$v = safeBuffer.Buffer;
|
|
var fixProc = function (okey, password) {
|
|
var key = okey.toString();
|
|
var match = key.match(findProc);
|
|
var decrypted;
|
|
if (!match) {
|
|
var match2 = key.match(fullRegex);
|
|
decrypted = new Buffer$v(match2[2].replace(/[\r\n]/g, ''), 'base64');
|
|
} else {
|
|
var suite = 'aes' + match[1];
|
|
var iv = Buffer$v.from(match[2], 'hex');
|
|
var cipherText = Buffer$v.from(match[3].replace(/[\r\n]/g, ''), 'base64');
|
|
var cipherKey = evp_bytestokey(password, iv.slice(0, 8), parseInt(match[1], 10)).key;
|
|
var out = [];
|
|
var cipher = browser$4.createDecipheriv(suite, cipherKey, iv);
|
|
out.push(cipher.update(cipherText));
|
|
out.push(cipher.final());
|
|
decrypted = Buffer$v.concat(out);
|
|
}
|
|
var tag = key.match(startRegex)[1];
|
|
return {
|
|
tag: tag,
|
|
data: decrypted
|
|
}
|
|
};
|
|
|
|
var aesid$2 = getCjsExportFromNamespace(aesid$1);
|
|
|
|
var Buffer$w = safeBuffer.Buffer;
|
|
var parseAsn1 = parseKeys;
|
|
|
|
function parseKeys (buffer) {
|
|
var password;
|
|
if (typeof buffer === 'object' && !Buffer$w.isBuffer(buffer)) {
|
|
password = buffer.passphrase;
|
|
buffer = buffer.key;
|
|
}
|
|
if (typeof buffer === 'string') {
|
|
buffer = Buffer$w.from(buffer);
|
|
}
|
|
|
|
var stripped = fixProc(buffer, password);
|
|
|
|
var type = stripped.tag;
|
|
var data = stripped.data;
|
|
var subtype, ndata;
|
|
switch (type) {
|
|
case 'CERTIFICATE':
|
|
ndata = asn1_1$1.certificate.decode(data, 'der').tbsCertificate.subjectPublicKeyInfo;
|
|
// falls through
|
|
case 'PUBLIC KEY':
|
|
if (!ndata) {
|
|
ndata = asn1_1$1.PublicKey.decode(data, 'der');
|
|
}
|
|
subtype = ndata.algorithm.algorithm.join('.');
|
|
switch (subtype) {
|
|
case '1.2.840.113549.1.1.1':
|
|
return asn1_1$1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der')
|
|
case '1.2.840.10045.2.1':
|
|
ndata.subjectPrivateKey = ndata.subjectPublicKey;
|
|
return {
|
|
type: 'ec',
|
|
data: ndata
|
|
}
|
|
case '1.2.840.10040.4.1':
|
|
ndata.algorithm.params.pub_key = asn1_1$1.DSAparam.decode(ndata.subjectPublicKey.data, 'der');
|
|
return {
|
|
type: 'dsa',
|
|
data: ndata.algorithm.params
|
|
}
|
|
default: throw new Error('unknown key id ' + subtype)
|
|
}
|
|
throw new Error('unknown key type ' + type)
|
|
case 'ENCRYPTED PRIVATE KEY':
|
|
data = asn1_1$1.EncryptedPrivateKey.decode(data, 'der');
|
|
data = decrypt$2(data, password);
|
|
// falls through
|
|
case 'PRIVATE KEY':
|
|
ndata = asn1_1$1.PrivateKey.decode(data, 'der');
|
|
subtype = ndata.algorithm.algorithm.join('.');
|
|
switch (subtype) {
|
|
case '1.2.840.113549.1.1.1':
|
|
return asn1_1$1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der')
|
|
case '1.2.840.10045.2.1':
|
|
return {
|
|
curve: ndata.algorithm.curve,
|
|
privateKey: asn1_1$1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey
|
|
}
|
|
case '1.2.840.10040.4.1':
|
|
ndata.algorithm.params.priv_key = asn1_1$1.DSAparam.decode(ndata.subjectPrivateKey, 'der');
|
|
return {
|
|
type: 'dsa',
|
|
params: ndata.algorithm.params
|
|
}
|
|
default: throw new Error('unknown key id ' + subtype)
|
|
}
|
|
throw new Error('unknown key type ' + type)
|
|
case 'RSA PUBLIC KEY':
|
|
return asn1_1$1.RSAPublicKey.decode(data, 'der')
|
|
case 'RSA PRIVATE KEY':
|
|
return asn1_1$1.RSAPrivateKey.decode(data, 'der')
|
|
case 'DSA PRIVATE KEY':
|
|
return {
|
|
type: 'dsa',
|
|
params: asn1_1$1.DSAPrivateKey.decode(data, 'der')
|
|
}
|
|
case 'EC PRIVATE KEY':
|
|
data = asn1_1$1.ECPrivateKey.decode(data, 'der');
|
|
return {
|
|
curve: data.parameters.value,
|
|
privateKey: data.privateKey
|
|
}
|
|
default: throw new Error('unknown key type ' + type)
|
|
}
|
|
}
|
|
parseKeys.signature = asn1_1$1.signature;
|
|
function decrypt$2 (data, password) {
|
|
var salt = data.algorithm.decrypt.kde.kdeparams.salt;
|
|
var iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10);
|
|
var algo = aesid$2[data.algorithm.decrypt.cipher.algo.join('.')];
|
|
var iv = data.algorithm.decrypt.cipher.iv;
|
|
var cipherText = data.subjectPrivateKey;
|
|
var keylen = parseInt(algo.split('-')[1], 10) / 8;
|
|
var key = browser$3.pbkdf2Sync(password, salt, iters, keylen, 'sha1');
|
|
var cipher = browser$4.createDecipheriv(algo, key, iv);
|
|
var out = [];
|
|
out.push(cipher.update(cipherText));
|
|
out.push(cipher.final());
|
|
return Buffer$w.concat(out)
|
|
}
|
|
|
|
var curves = {
|
|
"1.3.132.0.10": "secp256k1",
|
|
"1.3.132.0.33": "p224",
|
|
"1.2.840.10045.3.1.1": "p192",
|
|
"1.2.840.10045.3.1.7": "p256",
|
|
"1.3.132.0.34": "p384",
|
|
"1.3.132.0.35": "p521"
|
|
};
|
|
|
|
var curves$1 = /*#__PURE__*/Object.freeze({
|
|
'default': curves
|
|
});
|
|
|
|
var curves$2 = getCjsExportFromNamespace(curves$1);
|
|
|
|
// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js
|
|
|
|
|
|
var EC$1 = elliptic_1.ec;
|
|
|
|
|
|
|
|
|
|
function sign (hash, key, hashType, signType, tag) {
|
|
var priv = parseAsn1(key);
|
|
if (priv.curve) {
|
|
// rsa keys can be interpreted as ecdsa ones in openssl
|
|
if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')
|
|
return ecSign(hash, priv)
|
|
} else if (priv.type === 'dsa') {
|
|
if (signType !== 'dsa') throw new Error('wrong private key type')
|
|
return dsaSign(hash, priv, hashType)
|
|
} else {
|
|
if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')
|
|
}
|
|
hash = Buffer.concat([tag, hash]);
|
|
var len = priv.modulus.byteLength();
|
|
var pad = [ 0, 1 ];
|
|
while (hash.length + pad.length + 1 < len) pad.push(0xff);
|
|
pad.push(0x00);
|
|
var i = -1;
|
|
while (++i < hash.length) pad.push(hash[i]);
|
|
|
|
var out = browserifyRsa(pad, priv);
|
|
return out
|
|
}
|
|
|
|
function ecSign (hash, priv) {
|
|
var curveId = curves$2[priv.curve.join('.')];
|
|
if (!curveId) throw new Error('unknown curve ' + priv.curve.join('.'))
|
|
|
|
var curve = new EC$1(curveId);
|
|
var key = curve.keyFromPrivate(priv.privateKey);
|
|
var out = key.sign(hash);
|
|
|
|
return new Buffer(out.toDER())
|
|
}
|
|
|
|
function dsaSign (hash, priv, algo) {
|
|
var x = priv.params.priv_key;
|
|
var p = priv.params.p;
|
|
var q = priv.params.q;
|
|
var g = priv.params.g;
|
|
var r = new bn(0);
|
|
var k;
|
|
var H = bits2int(hash, q).mod(q);
|
|
var s = false;
|
|
var kv = getKey(x, q, hash, algo);
|
|
while (s === false) {
|
|
k = makeKey(q, kv, algo);
|
|
r = makeR(g, k, p, q);
|
|
s = k.invm(q).imul(H.add(x.mul(r))).mod(q);
|
|
if (s.cmpn(0) === 0) {
|
|
s = false;
|
|
r = new bn(0);
|
|
}
|
|
}
|
|
return toDER(r, s)
|
|
}
|
|
|
|
function toDER (r, s) {
|
|
r = r.toArray();
|
|
s = s.toArray();
|
|
|
|
// Pad values
|
|
if (r[0] & 0x80) r = [ 0 ].concat(r);
|
|
if (s[0] & 0x80) s = [ 0 ].concat(s);
|
|
|
|
var total = r.length + s.length + 4;
|
|
var res = [ 0x30, total, 0x02, r.length ];
|
|
res = res.concat(r, [ 0x02, s.length ], s);
|
|
return new Buffer(res)
|
|
}
|
|
|
|
function getKey (x, q, hash, algo) {
|
|
x = new Buffer(x.toArray());
|
|
if (x.length < q.byteLength()) {
|
|
var zeros = new Buffer(q.byteLength() - x.length);
|
|
zeros.fill(0);
|
|
x = Buffer.concat([ zeros, x ]);
|
|
}
|
|
var hlen = hash.length;
|
|
var hbits = bits2octets(hash, q);
|
|
var v = new Buffer(hlen);
|
|
v.fill(1);
|
|
var k = new Buffer(hlen);
|
|
k.fill(0);
|
|
k = browser$2(algo, k).update(v).update(new Buffer([ 0 ])).update(x).update(hbits).digest();
|
|
v = browser$2(algo, k).update(v).digest();
|
|
k = browser$2(algo, k).update(v).update(new Buffer([ 1 ])).update(x).update(hbits).digest();
|
|
v = browser$2(algo, k).update(v).digest();
|
|
return { k: k, v: v }
|
|
}
|
|
|
|
function bits2int (obits, q) {
|
|
var bits = new bn(obits);
|
|
var shift = (obits.length << 3) - q.bitLength();
|
|
if (shift > 0) bits.ishrn(shift);
|
|
return bits
|
|
}
|
|
|
|
function bits2octets (bits, q) {
|
|
bits = bits2int(bits, q);
|
|
bits = bits.mod(q);
|
|
var out = new Buffer(bits.toArray());
|
|
if (out.length < q.byteLength()) {
|
|
var zeros = new Buffer(q.byteLength() - out.length);
|
|
zeros.fill(0);
|
|
out = Buffer.concat([ zeros, out ]);
|
|
}
|
|
return out
|
|
}
|
|
|
|
function makeKey (q, kv, algo) {
|
|
var t;
|
|
var k;
|
|
|
|
do {
|
|
t = new Buffer(0);
|
|
|
|
while (t.length * 8 < q.bitLength()) {
|
|
kv.v = browser$2(algo, kv.k).update(kv.v).digest();
|
|
t = Buffer.concat([ t, kv.v ]);
|
|
}
|
|
|
|
k = bits2int(t, q);
|
|
kv.k = browser$2(algo, kv.k).update(kv.v).update(new Buffer([ 0 ])).digest();
|
|
kv.v = browser$2(algo, kv.k).update(kv.v).digest();
|
|
} while (k.cmp(q) !== -1)
|
|
|
|
return k
|
|
}
|
|
|
|
function makeR (g, k, p, q) {
|
|
return g.toRed(bn.mont(p)).redPow(k).fromRed().mod(q)
|
|
}
|
|
|
|
var sign_1 = sign;
|
|
var getKey_1 = getKey;
|
|
var makeKey_1 = makeKey;
|
|
sign_1.getKey = getKey_1;
|
|
sign_1.makeKey = makeKey_1;
|
|
|
|
// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js
|
|
|
|
var EC$2 = elliptic_1.ec;
|
|
|
|
|
|
|
|
function verify (sig, hash, key, signType, tag) {
|
|
var pub = parseAsn1(key);
|
|
if (pub.type === 'ec') {
|
|
// rsa keys can be interpreted as ecdsa ones in openssl
|
|
if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')
|
|
return ecVerify(sig, hash, pub)
|
|
} else if (pub.type === 'dsa') {
|
|
if (signType !== 'dsa') throw new Error('wrong public key type')
|
|
return dsaVerify(sig, hash, pub)
|
|
} else {
|
|
if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')
|
|
}
|
|
hash = Buffer.concat([tag, hash]);
|
|
var len = pub.modulus.byteLength();
|
|
var pad = [ 1 ];
|
|
var padNum = 0;
|
|
while (hash.length + pad.length + 2 < len) {
|
|
pad.push(0xff);
|
|
padNum++;
|
|
}
|
|
pad.push(0x00);
|
|
var i = -1;
|
|
while (++i < hash.length) {
|
|
pad.push(hash[i]);
|
|
}
|
|
pad = new Buffer(pad);
|
|
var red = bn.mont(pub.modulus);
|
|
sig = new bn(sig).toRed(red);
|
|
|
|
sig = sig.redPow(new bn(pub.publicExponent));
|
|
sig = new Buffer(sig.fromRed().toArray());
|
|
var out = padNum < 8 ? 1 : 0;
|
|
len = Math.min(sig.length, pad.length);
|
|
if (sig.length !== pad.length) out = 1;
|
|
|
|
i = -1;
|
|
while (++i < len) out |= sig[i] ^ pad[i];
|
|
return out === 0
|
|
}
|
|
|
|
function ecVerify (sig, hash, pub) {
|
|
var curveId = curves$2[pub.data.algorithm.curve.join('.')];
|
|
if (!curveId) throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.'))
|
|
|
|
var curve = new EC$2(curveId);
|
|
var pubkey = pub.data.subjectPrivateKey.data;
|
|
|
|
return curve.verify(hash, sig, pubkey)
|
|
}
|
|
|
|
function dsaVerify (sig, hash, pub) {
|
|
var p = pub.data.p;
|
|
var q = pub.data.q;
|
|
var g = pub.data.g;
|
|
var y = pub.data.pub_key;
|
|
var unpacked = parseAsn1.signature.decode(sig, 'der');
|
|
var s = unpacked.s;
|
|
var r = unpacked.r;
|
|
checkValue(s, q);
|
|
checkValue(r, q);
|
|
var montp = bn.mont(p);
|
|
var w = s.invm(q);
|
|
var v = g.toRed(montp)
|
|
.redPow(new bn(hash).mul(w).mod(q))
|
|
.fromRed()
|
|
.mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())
|
|
.mod(p)
|
|
.mod(q);
|
|
return v.cmp(r) === 0
|
|
}
|
|
|
|
function checkValue (b, q) {
|
|
if (b.cmpn(0) <= 0) throw new Error('invalid sig')
|
|
if (b.cmp(q) >= q) throw new Error('invalid sig')
|
|
}
|
|
|
|
var verify_1 = verify;
|
|
|
|
Object.keys(algorithms$2).forEach(function (key) {
|
|
algorithms$2[key].id = new Buffer(algorithms$2[key].id, 'hex');
|
|
algorithms$2[key.toLowerCase()] = algorithms$2[key];
|
|
});
|
|
|
|
function Sign (algorithm) {
|
|
stream.Writable.call(this);
|
|
|
|
var data = algorithms$2[algorithm];
|
|
if (!data) throw new Error('Unknown message digest')
|
|
|
|
this._hashType = data.hash;
|
|
this._hash = browser$1(data.hash);
|
|
this._tag = data.id;
|
|
this._signType = data.sign;
|
|
}
|
|
inherits_browser(Sign, stream.Writable);
|
|
|
|
Sign.prototype._write = function _write (data, _, done) {
|
|
this._hash.update(data);
|
|
done();
|
|
};
|
|
|
|
Sign.prototype.update = function update (data, enc) {
|
|
if (typeof data === 'string') data = new Buffer(data, enc);
|
|
|
|
this._hash.update(data);
|
|
return this
|
|
};
|
|
|
|
Sign.prototype.sign = function signMethod (key, enc) {
|
|
this.end();
|
|
var hash = this._hash.digest();
|
|
var sig = sign_1(hash, key, this._hashType, this._signType, this._tag);
|
|
|
|
return enc ? sig.toString(enc) : sig
|
|
};
|
|
|
|
function Verify (algorithm) {
|
|
stream.Writable.call(this);
|
|
|
|
var data = algorithms$2[algorithm];
|
|
if (!data) throw new Error('Unknown message digest')
|
|
|
|
this._hash = browser$1(data.hash);
|
|
this._tag = data.id;
|
|
this._signType = data.sign;
|
|
}
|
|
inherits_browser(Verify, stream.Writable);
|
|
|
|
Verify.prototype._write = function _write (data, _, done) {
|
|
this._hash.update(data);
|
|
done();
|
|
};
|
|
|
|
Verify.prototype.update = function update (data, enc) {
|
|
if (typeof data === 'string') data = new Buffer(data, enc);
|
|
|
|
this._hash.update(data);
|
|
return this
|
|
};
|
|
|
|
Verify.prototype.verify = function verifyMethod (key, sig, enc) {
|
|
if (typeof sig === 'string') sig = new Buffer(sig, enc);
|
|
|
|
this.end();
|
|
var hash = this._hash.digest();
|
|
return verify_1(sig, hash, key, this._signType, this._tag)
|
|
};
|
|
|
|
function createSign (algorithm) {
|
|
return new Sign(algorithm)
|
|
}
|
|
|
|
function createVerify (algorithm) {
|
|
return new Verify(algorithm)
|
|
}
|
|
|
|
var browser$7 = {
|
|
Sign: createSign,
|
|
Verify: createVerify,
|
|
createSign: createSign,
|
|
createVerify: createVerify
|
|
};
|
|
|
|
var browser$8 = function createECDH (curve) {
|
|
return new ECDH(curve)
|
|
};
|
|
|
|
var aliases = {
|
|
secp256k1: {
|
|
name: 'secp256k1',
|
|
byteLength: 32
|
|
},
|
|
secp224r1: {
|
|
name: 'p224',
|
|
byteLength: 28
|
|
},
|
|
prime256v1: {
|
|
name: 'p256',
|
|
byteLength: 32
|
|
},
|
|
prime192v1: {
|
|
name: 'p192',
|
|
byteLength: 24
|
|
},
|
|
ed25519: {
|
|
name: 'ed25519',
|
|
byteLength: 32
|
|
},
|
|
secp384r1: {
|
|
name: 'p384',
|
|
byteLength: 48
|
|
},
|
|
secp521r1: {
|
|
name: 'p521',
|
|
byteLength: 66
|
|
}
|
|
};
|
|
|
|
aliases.p224 = aliases.secp224r1;
|
|
aliases.p256 = aliases.secp256r1 = aliases.prime256v1;
|
|
aliases.p192 = aliases.secp192r1 = aliases.prime192v1;
|
|
aliases.p384 = aliases.secp384r1;
|
|
aliases.p521 = aliases.secp521r1;
|
|
|
|
function ECDH (curve) {
|
|
this.curveType = aliases[curve];
|
|
if (!this.curveType) {
|
|
this.curveType = {
|
|
name: curve
|
|
};
|
|
}
|
|
this.curve = new elliptic_1.ec(this.curveType.name); // eslint-disable-line new-cap
|
|
this.keys = void 0;
|
|
}
|
|
|
|
ECDH.prototype.generateKeys = function (enc, format) {
|
|
this.keys = this.curve.genKeyPair();
|
|
return this.getPublicKey(enc, format)
|
|
};
|
|
|
|
ECDH.prototype.computeSecret = function (other, inenc, enc) {
|
|
inenc = inenc || 'utf8';
|
|
if (!Buffer.isBuffer(other)) {
|
|
other = new Buffer(other, inenc);
|
|
}
|
|
var otherPub = this.curve.keyFromPublic(other).getPublic();
|
|
var out = otherPub.mul(this.keys.getPrivate()).getX();
|
|
return formatReturnValue$1(out, enc, this.curveType.byteLength)
|
|
};
|
|
|
|
ECDH.prototype.getPublicKey = function (enc, format) {
|
|
var key = this.keys.getPublic(format === 'compressed', true);
|
|
if (format === 'hybrid') {
|
|
if (key[key.length - 1] % 2) {
|
|
key[0] = 7;
|
|
} else {
|
|
key[0] = 6;
|
|
}
|
|
}
|
|
return formatReturnValue$1(key, enc)
|
|
};
|
|
|
|
ECDH.prototype.getPrivateKey = function (enc) {
|
|
return formatReturnValue$1(this.keys.getPrivate(), enc)
|
|
};
|
|
|
|
ECDH.prototype.setPublicKey = function (pub, enc) {
|
|
enc = enc || 'utf8';
|
|
if (!Buffer.isBuffer(pub)) {
|
|
pub = new Buffer(pub, enc);
|
|
}
|
|
this.keys._importPublic(pub);
|
|
return this
|
|
};
|
|
|
|
ECDH.prototype.setPrivateKey = function (priv, enc) {
|
|
enc = enc || 'utf8';
|
|
if (!Buffer.isBuffer(priv)) {
|
|
priv = new Buffer(priv, enc);
|
|
}
|
|
|
|
var _priv = new bn(priv);
|
|
_priv = _priv.toString(16);
|
|
this.keys = this.curve.genKeyPair();
|
|
this.keys._importPrivate(_priv);
|
|
return this
|
|
};
|
|
|
|
function formatReturnValue$1 (bn, enc, len) {
|
|
if (!Array.isArray(bn)) {
|
|
bn = bn.toArray();
|
|
}
|
|
var buf = new Buffer(bn);
|
|
if (len && buf.length < len) {
|
|
var zeros = new Buffer(len - buf.length);
|
|
zeros.fill(0);
|
|
buf = Buffer.concat([zeros, buf]);
|
|
}
|
|
if (!enc) {
|
|
return buf
|
|
} else {
|
|
return buf.toString(enc)
|
|
}
|
|
}
|
|
|
|
var Buffer$x = safeBuffer.Buffer;
|
|
|
|
var mgf = function (seed, len) {
|
|
var t = Buffer$x.alloc(0);
|
|
var i = 0;
|
|
var c;
|
|
while (t.length < len) {
|
|
c = i2ops(i++);
|
|
t = Buffer$x.concat([t, browser$1('sha1').update(seed).update(c).digest()]);
|
|
}
|
|
return t.slice(0, len)
|
|
};
|
|
|
|
function i2ops (c) {
|
|
var out = Buffer$x.allocUnsafe(4);
|
|
out.writeUInt32BE(c, 0);
|
|
return out
|
|
}
|
|
|
|
var xor = function xor (a, b) {
|
|
var len = a.length;
|
|
var i = -1;
|
|
while (++i < len) {
|
|
a[i] ^= b[i];
|
|
}
|
|
return a
|
|
};
|
|
|
|
var Buffer$y = safeBuffer.Buffer;
|
|
|
|
function withPublic (paddedMsg, key) {
|
|
return Buffer$y.from(paddedMsg
|
|
.toRed(bn.mont(key.modulus))
|
|
.redPow(new bn(key.publicExponent))
|
|
.fromRed()
|
|
.toArray())
|
|
}
|
|
|
|
var withPublic_1 = withPublic;
|
|
|
|
var Buffer$z = safeBuffer.Buffer;
|
|
|
|
var publicEncrypt = function publicEncrypt (publicKey, msg, reverse) {
|
|
var padding;
|
|
if (publicKey.padding) {
|
|
padding = publicKey.padding;
|
|
} else if (reverse) {
|
|
padding = 1;
|
|
} else {
|
|
padding = 4;
|
|
}
|
|
var key = parseAsn1(publicKey);
|
|
var paddedMsg;
|
|
if (padding === 4) {
|
|
paddedMsg = oaep(key, msg);
|
|
} else if (padding === 1) {
|
|
paddedMsg = pkcs1(key, msg, reverse);
|
|
} else if (padding === 3) {
|
|
paddedMsg = new bn(msg);
|
|
if (paddedMsg.cmp(key.modulus) >= 0) {
|
|
throw new Error('data too long for modulus')
|
|
}
|
|
} else {
|
|
throw new Error('unknown padding')
|
|
}
|
|
if (reverse) {
|
|
return browserifyRsa(paddedMsg, key)
|
|
} else {
|
|
return withPublic_1(paddedMsg, key)
|
|
}
|
|
};
|
|
|
|
function oaep (key, msg) {
|
|
var k = key.modulus.byteLength();
|
|
var mLen = msg.length;
|
|
var iHash = browser$1('sha1').update(Buffer$z.alloc(0)).digest();
|
|
var hLen = iHash.length;
|
|
var hLen2 = 2 * hLen;
|
|
if (mLen > k - hLen2 - 2) {
|
|
throw new Error('message too long')
|
|
}
|
|
var ps = Buffer$z.alloc(k - mLen - hLen2 - 2);
|
|
var dblen = k - hLen - 1;
|
|
var seed = browser(hLen);
|
|
var maskedDb = xor(Buffer$z.concat([iHash, ps, Buffer$z.alloc(1, 1), msg], dblen), mgf(seed, dblen));
|
|
var maskedSeed = xor(seed, mgf(maskedDb, hLen));
|
|
return new bn(Buffer$z.concat([Buffer$z.alloc(1), maskedSeed, maskedDb], k))
|
|
}
|
|
function pkcs1 (key, msg, reverse) {
|
|
var mLen = msg.length;
|
|
var k = key.modulus.byteLength();
|
|
if (mLen > k - 11) {
|
|
throw new Error('message too long')
|
|
}
|
|
var ps;
|
|
if (reverse) {
|
|
ps = Buffer$z.alloc(k - mLen - 3, 0xff);
|
|
} else {
|
|
ps = nonZero(k - mLen - 3);
|
|
}
|
|
return new bn(Buffer$z.concat([Buffer$z.from([0, reverse ? 1 : 2]), ps, Buffer$z.alloc(1), msg], k))
|
|
}
|
|
function nonZero (len) {
|
|
var out = Buffer$z.allocUnsafe(len);
|
|
var i = 0;
|
|
var cache = browser(len * 2);
|
|
var cur = 0;
|
|
var num;
|
|
while (i < len) {
|
|
if (cur === cache.length) {
|
|
cache = browser(len * 2);
|
|
cur = 0;
|
|
}
|
|
num = cache[cur++];
|
|
if (num) {
|
|
out[i++] = num;
|
|
}
|
|
}
|
|
return out
|
|
}
|
|
|
|
var Buffer$A = safeBuffer.Buffer;
|
|
|
|
var privateDecrypt = function privateDecrypt (privateKey, enc, reverse) {
|
|
var padding;
|
|
if (privateKey.padding) {
|
|
padding = privateKey.padding;
|
|
} else if (reverse) {
|
|
padding = 1;
|
|
} else {
|
|
padding = 4;
|
|
}
|
|
|
|
var key = parseAsn1(privateKey);
|
|
var k = key.modulus.byteLength();
|
|
if (enc.length > k || new bn(enc).cmp(key.modulus) >= 0) {
|
|
throw new Error('decryption error')
|
|
}
|
|
var msg;
|
|
if (reverse) {
|
|
msg = withPublic_1(new bn(enc), key);
|
|
} else {
|
|
msg = browserifyRsa(enc, key);
|
|
}
|
|
var zBuffer = Buffer$A.alloc(k - msg.length);
|
|
msg = Buffer$A.concat([zBuffer, msg], k);
|
|
if (padding === 4) {
|
|
return oaep$1(key, msg)
|
|
} else if (padding === 1) {
|
|
return pkcs1$1(key, msg, reverse)
|
|
} else if (padding === 3) {
|
|
return msg
|
|
} else {
|
|
throw new Error('unknown padding')
|
|
}
|
|
};
|
|
|
|
function oaep$1 (key, msg) {
|
|
var k = key.modulus.byteLength();
|
|
var iHash = browser$1('sha1').update(Buffer$A.alloc(0)).digest();
|
|
var hLen = iHash.length;
|
|
if (msg[0] !== 0) {
|
|
throw new Error('decryption error')
|
|
}
|
|
var maskedSeed = msg.slice(1, hLen + 1);
|
|
var maskedDb = msg.slice(hLen + 1);
|
|
var seed = xor(maskedSeed, mgf(maskedDb, hLen));
|
|
var db = xor(maskedDb, mgf(seed, k - hLen - 1));
|
|
if (compare(iHash, db.slice(0, hLen))) {
|
|
throw new Error('decryption error')
|
|
}
|
|
var i = hLen;
|
|
while (db[i] === 0) {
|
|
i++;
|
|
}
|
|
if (db[i++] !== 1) {
|
|
throw new Error('decryption error')
|
|
}
|
|
return db.slice(i)
|
|
}
|
|
|
|
function pkcs1$1 (key, msg, reverse) {
|
|
var p1 = msg.slice(0, 2);
|
|
var i = 2;
|
|
var status = 0;
|
|
while (msg[i++] !== 0) {
|
|
if (i >= msg.length) {
|
|
status++;
|
|
break
|
|
}
|
|
}
|
|
var ps = msg.slice(2, i - 1);
|
|
|
|
if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)) {
|
|
status++;
|
|
}
|
|
if (ps.length < 8) {
|
|
status++;
|
|
}
|
|
if (status) {
|
|
throw new Error('decryption error')
|
|
}
|
|
return msg.slice(i)
|
|
}
|
|
function compare (a, b) {
|
|
a = Buffer$A.from(a);
|
|
b = Buffer$A.from(b);
|
|
var dif = 0;
|
|
var len = a.length;
|
|
if (a.length !== b.length) {
|
|
dif++;
|
|
len = Math.min(a.length, b.length);
|
|
}
|
|
var i = -1;
|
|
while (++i < len) {
|
|
dif += (a[i] ^ b[i]);
|
|
}
|
|
return dif
|
|
}
|
|
|
|
var browser$9 = createCommonjsModule(function (module, exports) {
|
|
exports.publicEncrypt = publicEncrypt;
|
|
exports.privateDecrypt = privateDecrypt;
|
|
|
|
exports.privateEncrypt = function privateEncrypt (key, buf) {
|
|
return exports.publicEncrypt(key, buf, true)
|
|
};
|
|
|
|
exports.publicDecrypt = function publicDecrypt (key, buf) {
|
|
return exports.privateDecrypt(key, buf, true)
|
|
};
|
|
});
|
|
var browser_1$3 = browser$9.publicEncrypt;
|
|
var browser_2$3 = browser$9.privateDecrypt;
|
|
var browser_3$3 = browser$9.privateEncrypt;
|
|
var browser_4$3 = browser$9.publicDecrypt;
|
|
|
|
var browser$a = createCommonjsModule(function (module, exports) {
|
|
|
|
function oldBrowser () {
|
|
throw new Error('secure random number generation not supported by this browser\nuse chrome, FireFox or Internet Explorer 11')
|
|
}
|
|
|
|
|
|
var Buffer = safeBuffer.Buffer;
|
|
var kBufferMaxLength = safeBuffer.kMaxLength;
|
|
var crypto = commonjsGlobal.crypto || commonjsGlobal.msCrypto;
|
|
var kMaxUint32 = Math.pow(2, 32) - 1;
|
|
function assertOffset (offset, length) {
|
|
if (typeof offset !== 'number' || offset !== offset) { // eslint-disable-line no-self-compare
|
|
throw new TypeError('offset must be a number')
|
|
}
|
|
|
|
if (offset > kMaxUint32 || offset < 0) {
|
|
throw new TypeError('offset must be a uint32')
|
|
}
|
|
|
|
if (offset > kBufferMaxLength || offset > length) {
|
|
throw new RangeError('offset out of range')
|
|
}
|
|
}
|
|
|
|
function assertSize (size, offset, length) {
|
|
if (typeof size !== 'number' || size !== size) { // eslint-disable-line no-self-compare
|
|
throw new TypeError('size must be a number')
|
|
}
|
|
|
|
if (size > kMaxUint32 || size < 0) {
|
|
throw new TypeError('size must be a uint32')
|
|
}
|
|
|
|
if (size + offset > length || size > kBufferMaxLength) {
|
|
throw new RangeError('buffer too small')
|
|
}
|
|
}
|
|
if ((crypto && crypto.getRandomValues) || !process.browser) {
|
|
exports.randomFill = randomFill;
|
|
exports.randomFillSync = randomFillSync;
|
|
} else {
|
|
exports.randomFill = oldBrowser;
|
|
exports.randomFillSync = oldBrowser;
|
|
}
|
|
function randomFill (buf, offset, size, cb) {
|
|
if (!Buffer.isBuffer(buf) && !(buf instanceof commonjsGlobal.Uint8Array)) {
|
|
throw new TypeError('"buf" argument must be a Buffer or Uint8Array')
|
|
}
|
|
|
|
if (typeof offset === 'function') {
|
|
cb = offset;
|
|
offset = 0;
|
|
size = buf.length;
|
|
} else if (typeof size === 'function') {
|
|
cb = size;
|
|
size = buf.length - offset;
|
|
} else if (typeof cb !== 'function') {
|
|
throw new TypeError('"cb" argument must be a function')
|
|
}
|
|
assertOffset(offset, buf.length);
|
|
assertSize(size, offset, buf.length);
|
|
return actualFill(buf, offset, size, cb)
|
|
}
|
|
|
|
function actualFill (buf, offset, size, cb) {
|
|
if (process.browser) {
|
|
var ourBuf = buf.buffer;
|
|
var uint = new Uint8Array(ourBuf, offset, size);
|
|
crypto.getRandomValues(uint);
|
|
if (cb) {
|
|
process.nextTick(function () {
|
|
cb(null, buf);
|
|
});
|
|
return
|
|
}
|
|
return buf
|
|
}
|
|
if (cb) {
|
|
browser(size, function (err, bytes) {
|
|
if (err) {
|
|
return cb(err)
|
|
}
|
|
bytes.copy(buf, offset);
|
|
cb(null, buf);
|
|
});
|
|
return
|
|
}
|
|
var bytes = browser(size);
|
|
bytes.copy(buf, offset);
|
|
return buf
|
|
}
|
|
function randomFillSync (buf, offset, size) {
|
|
if (typeof offset === 'undefined') {
|
|
offset = 0;
|
|
}
|
|
if (!Buffer.isBuffer(buf) && !(buf instanceof commonjsGlobal.Uint8Array)) {
|
|
throw new TypeError('"buf" argument must be a Buffer or Uint8Array')
|
|
}
|
|
|
|
assertOffset(offset, buf.length);
|
|
|
|
if (size === undefined) size = buf.length - offset;
|
|
|
|
assertSize(size, offset, buf.length);
|
|
|
|
return actualFill(buf, offset, size)
|
|
}
|
|
});
|
|
var browser_1$4 = browser$a.randomFill;
|
|
var browser_2$4 = browser$a.randomFillSync;
|
|
|
|
var cryptoBrowserify = createCommonjsModule(function (module, exports) {
|
|
|
|
exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = browser;
|
|
exports.createHash = exports.Hash = browser$1;
|
|
exports.createHmac = exports.Hmac = browser$2;
|
|
|
|
|
|
var algoKeys = Object.keys(algos);
|
|
var hashes = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160'].concat(algoKeys);
|
|
exports.getHashes = function () {
|
|
return hashes
|
|
};
|
|
|
|
|
|
exports.pbkdf2 = browser$3.pbkdf2;
|
|
exports.pbkdf2Sync = browser$3.pbkdf2Sync;
|
|
|
|
|
|
|
|
exports.Cipher = browser$5.Cipher;
|
|
exports.createCipher = browser$5.createCipher;
|
|
exports.Cipheriv = browser$5.Cipheriv;
|
|
exports.createCipheriv = browser$5.createCipheriv;
|
|
exports.Decipher = browser$5.Decipher;
|
|
exports.createDecipher = browser$5.createDecipher;
|
|
exports.Decipheriv = browser$5.Decipheriv;
|
|
exports.createDecipheriv = browser$5.createDecipheriv;
|
|
exports.getCiphers = browser$5.getCiphers;
|
|
exports.listCiphers = browser$5.listCiphers;
|
|
|
|
|
|
|
|
exports.DiffieHellmanGroup = browser$6.DiffieHellmanGroup;
|
|
exports.createDiffieHellmanGroup = browser$6.createDiffieHellmanGroup;
|
|
exports.getDiffieHellman = browser$6.getDiffieHellman;
|
|
exports.createDiffieHellman = browser$6.createDiffieHellman;
|
|
exports.DiffieHellman = browser$6.DiffieHellman;
|
|
|
|
|
|
|
|
exports.createSign = browser$7.createSign;
|
|
exports.Sign = browser$7.Sign;
|
|
exports.createVerify = browser$7.createVerify;
|
|
exports.Verify = browser$7.Verify;
|
|
|
|
exports.createECDH = browser$8;
|
|
|
|
|
|
|
|
exports.publicEncrypt = browser$9.publicEncrypt;
|
|
exports.privateEncrypt = browser$9.privateEncrypt;
|
|
exports.publicDecrypt = browser$9.publicDecrypt;
|
|
exports.privateDecrypt = browser$9.privateDecrypt;
|
|
|
|
// the least I can do is make error messages for the rest of the node.js/crypto api.
|
|
// ;[
|
|
// 'createCredentials'
|
|
// ].forEach(function (name) {
|
|
// exports[name] = function () {
|
|
// throw new Error([
|
|
// 'sorry, ' + name + ' is not implemented yet',
|
|
// 'we accept pull requests',
|
|
// 'https://github.com/crypto-browserify/crypto-browserify'
|
|
// ].join('\n'))
|
|
// }
|
|
// })
|
|
|
|
|
|
|
|
exports.randomFill = browser$a.randomFill;
|
|
exports.randomFillSync = browser$a.randomFillSync;
|
|
|
|
exports.createCredentials = function () {
|
|
throw new Error([
|
|
'sorry, createCredentials is not implemented yet',
|
|
'we accept pull requests',
|
|
'https://github.com/crypto-browserify/crypto-browserify'
|
|
].join('\n'))
|
|
};
|
|
|
|
exports.constants = {
|
|
'DH_CHECK_P_NOT_SAFE_PRIME': 2,
|
|
'DH_CHECK_P_NOT_PRIME': 1,
|
|
'DH_UNABLE_TO_CHECK_GENERATOR': 4,
|
|
'DH_NOT_SUITABLE_GENERATOR': 8,
|
|
'NPN_ENABLED': 1,
|
|
'ALPN_ENABLED': 1,
|
|
'RSA_PKCS1_PADDING': 1,
|
|
'RSA_SSLV23_PADDING': 2,
|
|
'RSA_NO_PADDING': 3,
|
|
'RSA_PKCS1_OAEP_PADDING': 4,
|
|
'RSA_X931_PADDING': 5,
|
|
'RSA_PKCS1_PSS_PADDING': 6,
|
|
'POINT_CONVERSION_COMPRESSED': 2,
|
|
'POINT_CONVERSION_UNCOMPRESSED': 4,
|
|
'POINT_CONVERSION_HYBRID': 6
|
|
};
|
|
});
|
|
var cryptoBrowserify_1 = cryptoBrowserify.randomBytes;
|
|
var cryptoBrowserify_2 = cryptoBrowserify.rng;
|
|
var cryptoBrowserify_3 = cryptoBrowserify.pseudoRandomBytes;
|
|
var cryptoBrowserify_4 = cryptoBrowserify.prng;
|
|
var cryptoBrowserify_5 = cryptoBrowserify.createHash;
|
|
var cryptoBrowserify_6 = cryptoBrowserify.Hash;
|
|
var cryptoBrowserify_7 = cryptoBrowserify.createHmac;
|
|
var cryptoBrowserify_8 = cryptoBrowserify.Hmac;
|
|
var cryptoBrowserify_9 = cryptoBrowserify.getHashes;
|
|
var cryptoBrowserify_10 = cryptoBrowserify.pbkdf2;
|
|
var cryptoBrowserify_11 = cryptoBrowserify.pbkdf2Sync;
|
|
var cryptoBrowserify_12 = cryptoBrowserify.Cipher;
|
|
var cryptoBrowserify_13 = cryptoBrowserify.createCipher;
|
|
var cryptoBrowserify_14 = cryptoBrowserify.Cipheriv;
|
|
var cryptoBrowserify_15 = cryptoBrowserify.createCipheriv;
|
|
var cryptoBrowserify_16 = cryptoBrowserify.Decipher;
|
|
var cryptoBrowserify_17 = cryptoBrowserify.createDecipher;
|
|
var cryptoBrowserify_18 = cryptoBrowserify.Decipheriv;
|
|
var cryptoBrowserify_19 = cryptoBrowserify.createDecipheriv;
|
|
var cryptoBrowserify_20 = cryptoBrowserify.getCiphers;
|
|
var cryptoBrowserify_21 = cryptoBrowserify.listCiphers;
|
|
var cryptoBrowserify_22 = cryptoBrowserify.DiffieHellmanGroup;
|
|
var cryptoBrowserify_23 = cryptoBrowserify.createDiffieHellmanGroup;
|
|
var cryptoBrowserify_24 = cryptoBrowserify.getDiffieHellman;
|
|
var cryptoBrowserify_25 = cryptoBrowserify.createDiffieHellman;
|
|
var cryptoBrowserify_26 = cryptoBrowserify.DiffieHellman;
|
|
var cryptoBrowserify_27 = cryptoBrowserify.createSign;
|
|
var cryptoBrowserify_28 = cryptoBrowserify.Sign;
|
|
var cryptoBrowserify_29 = cryptoBrowserify.createVerify;
|
|
var cryptoBrowserify_30 = cryptoBrowserify.Verify;
|
|
var cryptoBrowserify_31 = cryptoBrowserify.createECDH;
|
|
var cryptoBrowserify_32 = cryptoBrowserify.publicEncrypt;
|
|
var cryptoBrowserify_33 = cryptoBrowserify.privateEncrypt;
|
|
var cryptoBrowserify_34 = cryptoBrowserify.publicDecrypt;
|
|
var cryptoBrowserify_35 = cryptoBrowserify.privateDecrypt;
|
|
var cryptoBrowserify_36 = cryptoBrowserify.randomFill;
|
|
var cryptoBrowserify_37 = cryptoBrowserify.randomFillSync;
|
|
var cryptoBrowserify_38 = cryptoBrowserify.createCredentials;
|
|
var cryptoBrowserify_39 = cryptoBrowserify.constants;
|
|
|
|
export default cryptoBrowserify;
|
|
export { cryptoBrowserify_12 as Cipher, cryptoBrowserify_14 as Cipheriv, cryptoBrowserify_16 as Decipher, cryptoBrowserify_18 as Decipheriv, cryptoBrowserify_26 as DiffieHellman, cryptoBrowserify_22 as DiffieHellmanGroup, cryptoBrowserify_6 as Hash, cryptoBrowserify_8 as Hmac, cryptoBrowserify_28 as Sign, cryptoBrowserify_30 as Verify, cryptoBrowserify_39 as constants, cryptoBrowserify_13 as createCipher, cryptoBrowserify_15 as createCipheriv, cryptoBrowserify_38 as createCredentials, cryptoBrowserify_17 as createDecipher, cryptoBrowserify_19 as createDecipheriv, cryptoBrowserify_25 as createDiffieHellman, cryptoBrowserify_23 as createDiffieHellmanGroup, cryptoBrowserify_31 as createECDH, cryptoBrowserify_5 as createHash, cryptoBrowserify_7 as createHmac, cryptoBrowserify_27 as createSign, cryptoBrowserify_29 as createVerify, cryptoBrowserify_20 as getCiphers, cryptoBrowserify_24 as getDiffieHellman, cryptoBrowserify_9 as getHashes, cryptoBrowserify_21 as listCiphers, cryptoBrowserify_10 as pbkdf2, cryptoBrowserify_11 as pbkdf2Sync, cryptoBrowserify_35 as privateDecrypt, cryptoBrowserify_33 as privateEncrypt, cryptoBrowserify_4 as prng, cryptoBrowserify_3 as pseudoRandomBytes, cryptoBrowserify_34 as publicDecrypt, cryptoBrowserify_32 as publicEncrypt, cryptoBrowserify_1 as randomBytes, cryptoBrowserify_36 as randomFill, cryptoBrowserify_37 as randomFillSync, cryptoBrowserify_2 as rng };
|