@intlayer/backend 7.0.9-canary.0 → 7.0.9-canary.3

package/dist/esm/node_modules/node-forge/lib/sha512.mjs

@@ -0,0 +1,417 @@
+import { __commonJS } from "../../../_virtual/rolldown_runtime.mjs";
+import { require_forge } from "./forge.mjs";
+import { require_util } from "./util.mjs";
+import { require_md } from "./md.mjs";
+
+//#region ../../node_modules/node-forge/lib/sha512.js
+var require_sha512 = /* @__PURE__ */ __commonJS({ "../../node_modules/node-forge/lib/sha512.js": ((exports, module) => {
+	/**
+	* Secure Hash Algorithm with a 1024-bit block size implementation.
+	*
+	* This includes: SHA-512, SHA-384, SHA-512/224, and SHA-512/256. For
+	* SHA-256 (block size 512 bits), see sha256.js.
+	*
+	* See FIPS 180-4 for details.
+	*
+	* @author Dave Longley
+	*
+	* Copyright (c) 2014-2015 Digital Bazaar, Inc.
+	*/
+	var forge = require_forge();
+	require_md();
+	require_util();
+	var sha512 = module.exports = forge.sha512 = forge.sha512 || {};
+	forge.md.sha512 = forge.md.algorithms.sha512 = sha512;
+	var sha384 = forge.sha384 = forge.sha512.sha384 = forge.sha512.sha384 || {};
+	sha384.create = function() {
+		return sha512.create("SHA-384");
+	};
+	forge.md.sha384 = forge.md.algorithms.sha384 = sha384;
+	forge.sha512.sha256 = forge.sha512.sha256 || { create: function() {
+		return sha512.create("SHA-512/256");
+	} };
+	forge.md["sha512/256"] = forge.md.algorithms["sha512/256"] = forge.sha512.sha256;
+	forge.sha512.sha224 = forge.sha512.sha224 || { create: function() {
+		return sha512.create("SHA-512/224");
+	} };
+	forge.md["sha512/224"] = forge.md.algorithms["sha512/224"] = forge.sha512.sha224;
+	/**
+	* Creates a SHA-2 message digest object.
+	*
+	* @param algorithm the algorithm to use (SHA-512, SHA-384, SHA-512/224,
+	*          SHA-512/256).
+	*
+	* @return a message digest object.
+	*/
+	sha512.create = function(algorithm) {
+		if (!_initialized) _init();
+		if (typeof algorithm === "undefined") algorithm = "SHA-512";
+		if (!(algorithm in _states)) throw new Error("Invalid SHA-512 algorithm: " + algorithm);
+		var _state = _states[algorithm];
+		var _h = null;
+		var _input = forge.util.createBuffer();
+		var _w = new Array(80);
+		for (var wi = 0; wi < 80; ++wi) _w[wi] = new Array(2);
+		var digestLength = 64;
+		switch (algorithm) {
+			case "SHA-384":
+				digestLength = 48;
+				break;
+			case "SHA-512/256":
+				digestLength = 32;
+				break;
+			case "SHA-512/224":
+				digestLength = 28;
+				break;
+		}
+		var md = {
+			algorithm: algorithm.replace("-", "").toLowerCase(),
+			blockLength: 128,
+			digestLength,
+			messageLength: 0,
+			fullMessageLength: null,
+			messageLengthSize: 16
+		};
+		/**
+		* Starts the digest.
+		*
+		* @return this digest object.
+		*/
+		md.start = function() {
+			md.messageLength = 0;
+			md.fullMessageLength = md.messageLength128 = [];
+			var int32s = md.messageLengthSize / 4;
+			for (var i = 0; i < int32s; ++i) md.fullMessageLength.push(0);
+			_input = forge.util.createBuffer();
+			_h = new Array(_state.length);
+			for (var i = 0; i < _state.length; ++i) _h[i] = _state[i].slice(0);
+			return md;
+		};
+		md.start();
+		/**
+		* Updates the digest with the given message input. The given input can
+		* treated as raw input (no encoding will be applied) or an encoding of
+		* 'utf8' maybe given to encode the input using UTF-8.
+		*
+		* @param msg the message input to update with.
+		* @param encoding the encoding to use (default: 'raw', other: 'utf8').
+		*
+		* @return this digest object.
+		*/
+		md.update = function(msg, encoding) {
+			if (encoding === "utf8") msg = forge.util.encodeUtf8(msg);
+			var len = msg.length;
+			md.messageLength += len;
+			len = [len / 4294967296 >>> 0, len >>> 0];
+			for (var i = md.fullMessageLength.length - 1; i >= 0; --i) {
+				md.fullMessageLength[i] += len[1];
+				len[1] = len[0] + (md.fullMessageLength[i] / 4294967296 >>> 0);
+				md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;
+				len[0] = len[1] / 4294967296 >>> 0;
+			}
+			_input.putBytes(msg);
+			_update(_h, _w, _input);
+			if (_input.read > 2048 || _input.length() === 0) _input.compact();
+			return md;
+		};
+		/**
+		* Produces the digest.
+		*
+		* @return a byte buffer containing the digest value.
+		*/
+		md.digest = function() {
+			var finalBlock = forge.util.createBuffer();
+			finalBlock.putBytes(_input.bytes());
+			var overflow = md.fullMessageLength[md.fullMessageLength.length - 1] + md.messageLengthSize & md.blockLength - 1;
+			finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));
+			var next, carry;
+			var bits = md.fullMessageLength[0] * 8;
+			for (var i = 0; i < md.fullMessageLength.length - 1; ++i) {
+				next = md.fullMessageLength[i + 1] * 8;
+				carry = next / 4294967296 >>> 0;
+				bits += carry;
+				finalBlock.putInt32(bits >>> 0);
+				bits = next >>> 0;
+			}
+			finalBlock.putInt32(bits);
+			var h = new Array(_h.length);
+			for (var i = 0; i < _h.length; ++i) h[i] = _h[i].slice(0);
+			_update(h, _w, finalBlock);
+			var rval = forge.util.createBuffer();
+			var hlen;
+			if (algorithm === "SHA-512") hlen = h.length;
+			else if (algorithm === "SHA-384") hlen = h.length - 2;
+			else hlen = h.length - 4;
+			for (var i = 0; i < hlen; ++i) {
+				rval.putInt32(h[i][0]);
+				if (i !== hlen - 1 || algorithm !== "SHA-512/224") rval.putInt32(h[i][1]);
+			}
+			return rval;
+		};
+		return md;
+	};
+	var _padding = null;
+	var _initialized = false;
+	var _k = null;
+	var _states = null;
+	/**
+	* Initializes the constant tables.
+	*/
+	function _init() {
+		_padding = String.fromCharCode(128);
+		_padding += forge.util.fillString(String.fromCharCode(0), 128);
+		_k = [
+			[1116352408, 3609767458],
+			[1899447441, 602891725],
+			[3049323471, 3964484399],
+			[3921009573, 2173295548],
+			[961987163, 4081628472],
+			[1508970993, 3053834265],
+			[2453635748, 2937671579],
+			[2870763221, 3664609560],
+			[3624381080, 2734883394],
+			[310598401, 1164996542],
+			[607225278, 1323610764],
+			[1426881987, 3590304994],
+			[1925078388, 4068182383],
+			[2162078206, 991336113],
+			[2614888103, 633803317],
+			[3248222580, 3479774868],
+			[3835390401, 2666613458],
+			[4022224774, 944711139],
+			[264347078, 2341262773],
+			[604807628, 2007800933],
+			[770255983, 1495990901],
+			[1249150122, 1856431235],
+			[1555081692, 3175218132],
+			[1996064986, 2198950837],
+			[2554220882, 3999719339],
+			[2821834349, 766784016],
+			[2952996808, 2566594879],
+			[3210313671, 3203337956],
+			[3336571891, 1034457026],
+			[3584528711, 2466948901],
+			[113926993, 3758326383],
+			[338241895, 168717936],
+			[666307205, 1188179964],
+			[773529912, 1546045734],
+			[1294757372, 1522805485],
+			[1396182291, 2643833823],
+			[1695183700, 2343527390],
+			[1986661051, 1014477480],
+			[2177026350, 1206759142],
+			[2456956037, 344077627],
+			[2730485921, 1290863460],
+			[2820302411, 3158454273],
+			[3259730800, 3505952657],
+			[3345764771, 106217008],
+			[3516065817, 3606008344],
+			[3600352804, 1432725776],
+			[4094571909, 1467031594],
+			[275423344, 851169720],
+			[430227734, 3100823752],
+			[506948616, 1363258195],
+			[659060556, 3750685593],
+			[883997877, 3785050280],
+			[958139571, 3318307427],
+			[1322822218, 3812723403],
+			[1537002063, 2003034995],
+			[1747873779, 3602036899],
+			[1955562222, 1575990012],
+			[2024104815, 1125592928],
+			[2227730452, 2716904306],
+			[2361852424, 442776044],
+			[2428436474, 593698344],
+			[2756734187, 3733110249],
+			[3204031479, 2999351573],
+			[3329325298, 3815920427],
+			[3391569614, 3928383900],
+			[3515267271, 566280711],
+			[3940187606, 3454069534],
+			[4118630271, 4000239992],
+			[116418474, 1914138554],
+			[174292421, 2731055270],
+			[289380356, 3203993006],
+			[460393269, 320620315],
+			[685471733, 587496836],
+			[852142971, 1086792851],
+			[1017036298, 365543100],
+			[1126000580, 2618297676],
+			[1288033470, 3409855158],
+			[1501505948, 4234509866],
+			[1607167915, 987167468],
+			[1816402316, 1246189591]
+		];
+		_states = {};
+		_states["SHA-512"] = [
+			[1779033703, 4089235720],
+			[3144134277, 2227873595],
+			[1013904242, 4271175723],
+			[2773480762, 1595750129],
+			[1359893119, 2917565137],
+			[2600822924, 725511199],
+			[528734635, 4215389547],
+			[1541459225, 327033209]
+		];
+		_states["SHA-384"] = [
+			[3418070365, 3238371032],
+			[1654270250, 914150663],
+			[2438529370, 812702999],
+			[355462360, 4144912697],
+			[1731405415, 4290775857],
+			[2394180231, 1750603025],
+			[3675008525, 1694076839],
+			[1203062813, 3204075428]
+		];
+		_states["SHA-512/256"] = [
+			[573645204, 4230739756],
+			[2673172387, 3360449730],
+			[596883563, 1867755857],
+			[2520282905, 1497426621],
+			[2519219938, 2827943907],
+			[3193839141, 1401305490],
+			[721525244, 746961066],
+			[246885852, 2177182882]
+		];
+		_states["SHA-512/224"] = [
+			[2352822216, 424955298],
+			[1944164710, 2312950998],
+			[502970286, 855612546],
+			[1738396948, 1479516111],
+			[258812777, 2077511080],
+			[2011393907, 79989058],
+			[1067287976, 1780299464],
+			[286451373, 2446758561]
+		];
+		_initialized = true;
+	}
+	/**
+	* Updates a SHA-512 state with the given byte buffer.
+	*
+	* @param s the SHA-512 state to update.
+	* @param w the array to use to store words.
+	* @param bytes the byte buffer to update with.
+	*/
+	function _update(s, w, bytes) {
+		var t1_hi, t1_lo;
+		var t2_hi, t2_lo;
+		var s0_hi, s0_lo;
+		var s1_hi, s1_lo;
+		var ch_hi, ch_lo;
+		var maj_hi, maj_lo;
+		var a_hi, a_lo;
+		var b_hi, b_lo;
+		var c_hi, c_lo;
+		var d_hi, d_lo;
+		var e_hi, e_lo;
+		var f_hi, f_lo;
+		var g_hi, g_lo;
+		var h_hi, h_lo;
+		var i, hi, lo, w2, w7, w15, w16;
+		var len = bytes.length();
+		while (len >= 128) {
+			for (i = 0; i < 16; ++i) {
+				w[i][0] = bytes.getInt32() >>> 0;
+				w[i][1] = bytes.getInt32() >>> 0;
+			}
+			for (; i < 80; ++i) {
+				w2 = w[i - 2];
+				hi = w2[0];
+				lo = w2[1];
+				t1_hi = ((hi >>> 19 | lo << 13) ^ (lo >>> 29 | hi << 3) ^ hi >>> 6) >>> 0;
+				t1_lo = ((hi << 13 | lo >>> 19) ^ (lo << 3 | hi >>> 29) ^ (hi << 26 | lo >>> 6)) >>> 0;
+				w15 = w[i - 15];
+				hi = w15[0];
+				lo = w15[1];
+				t2_hi = ((hi >>> 1 | lo << 31) ^ (hi >>> 8 | lo << 24) ^ hi >>> 7) >>> 0;
+				t2_lo = ((hi << 31 | lo >>> 1) ^ (hi << 24 | lo >>> 8) ^ (hi << 25 | lo >>> 7)) >>> 0;
+				w7 = w[i - 7];
+				w16 = w[i - 16];
+				lo = t1_lo + w7[1] + t2_lo + w16[1];
+				w[i][0] = t1_hi + w7[0] + t2_hi + w16[0] + (lo / 4294967296 >>> 0) >>> 0;
+				w[i][1] = lo >>> 0;
+			}
+			a_hi = s[0][0];
+			a_lo = s[0][1];
+			b_hi = s[1][0];
+			b_lo = s[1][1];
+			c_hi = s[2][0];
+			c_lo = s[2][1];
+			d_hi = s[3][0];
+			d_lo = s[3][1];
+			e_hi = s[4][0];
+			e_lo = s[4][1];
+			f_hi = s[5][0];
+			f_lo = s[5][1];
+			g_hi = s[6][0];
+			g_lo = s[6][1];
+			h_hi = s[7][0];
+			h_lo = s[7][1];
+			for (i = 0; i < 80; ++i) {
+				s1_hi = ((e_hi >>> 14 | e_lo << 18) ^ (e_hi >>> 18 | e_lo << 14) ^ (e_lo >>> 9 | e_hi << 23)) >>> 0;
+				s1_lo = ((e_hi << 18 | e_lo >>> 14) ^ (e_hi << 14 | e_lo >>> 18) ^ (e_lo << 23 | e_hi >>> 9)) >>> 0;
+				ch_hi = (g_hi ^ e_hi & (f_hi ^ g_hi)) >>> 0;
+				ch_lo = (g_lo ^ e_lo & (f_lo ^ g_lo)) >>> 0;
+				s0_hi = ((a_hi >>> 28 | a_lo << 4) ^ (a_lo >>> 2 | a_hi << 30) ^ (a_lo >>> 7 | a_hi << 25)) >>> 0;
+				s0_lo = ((a_hi << 4 | a_lo >>> 28) ^ (a_lo << 30 | a_hi >>> 2) ^ (a_lo << 25 | a_hi >>> 7)) >>> 0;
+				maj_hi = (a_hi & b_hi | c_hi & (a_hi ^ b_hi)) >>> 0;
+				maj_lo = (a_lo & b_lo | c_lo & (a_lo ^ b_lo)) >>> 0;
+				lo = h_lo + s1_lo + ch_lo + _k[i][1] + w[i][1];
+				t1_hi = h_hi + s1_hi + ch_hi + _k[i][0] + w[i][0] + (lo / 4294967296 >>> 0) >>> 0;
+				t1_lo = lo >>> 0;
+				lo = s0_lo + maj_lo;
+				t2_hi = s0_hi + maj_hi + (lo / 4294967296 >>> 0) >>> 0;
+				t2_lo = lo >>> 0;
+				h_hi = g_hi;
+				h_lo = g_lo;
+				g_hi = f_hi;
+				g_lo = f_lo;
+				f_hi = e_hi;
+				f_lo = e_lo;
+				lo = d_lo + t1_lo;
+				e_hi = d_hi + t1_hi + (lo / 4294967296 >>> 0) >>> 0;
+				e_lo = lo >>> 0;
+				d_hi = c_hi;
+				d_lo = c_lo;
+				c_hi = b_hi;
+				c_lo = b_lo;
+				b_hi = a_hi;
+				b_lo = a_lo;
+				lo = t1_lo + t2_lo;
+				a_hi = t1_hi + t2_hi + (lo / 4294967296 >>> 0) >>> 0;
+				a_lo = lo >>> 0;
+			}
+			lo = s[0][1] + a_lo;
+			s[0][0] = s[0][0] + a_hi + (lo / 4294967296 >>> 0) >>> 0;
+			s[0][1] = lo >>> 0;
+			lo = s[1][1] + b_lo;
+			s[1][0] = s[1][0] + b_hi + (lo / 4294967296 >>> 0) >>> 0;
+			s[1][1] = lo >>> 0;
+			lo = s[2][1] + c_lo;
+			s[2][0] = s[2][0] + c_hi + (lo / 4294967296 >>> 0) >>> 0;
+			s[2][1] = lo >>> 0;
+			lo = s[3][1] + d_lo;
+			s[3][0] = s[3][0] + d_hi + (lo / 4294967296 >>> 0) >>> 0;
+			s[3][1] = lo >>> 0;
+			lo = s[4][1] + e_lo;
+			s[4][0] = s[4][0] + e_hi + (lo / 4294967296 >>> 0) >>> 0;
+			s[4][1] = lo >>> 0;
+			lo = s[5][1] + f_lo;
+			s[5][0] = s[5][0] + f_hi + (lo / 4294967296 >>> 0) >>> 0;
+			s[5][1] = lo >>> 0;
+			lo = s[6][1] + g_lo;
+			s[6][0] = s[6][0] + g_hi + (lo / 4294967296 >>> 0) >>> 0;
+			s[6][1] = lo >>> 0;
+			lo = s[7][1] + h_lo;
+			s[7][0] = s[7][0] + h_hi + (lo / 4294967296 >>> 0) >>> 0;
+			s[7][1] = lo >>> 0;
+			len -= 128;
+		}
+	}
+}) });
+
+//#endregion
+export default require_sha512();
+
+export { require_sha512 };
+//# sourceMappingURL=sha512.mjs.map

package/dist/esm/node_modules/node-forge/lib/sha512.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sha512.mjs","names":[],"sources":["../../../../../../../node_modules/node-forge/lib/sha512.js"],"sourcesContent":["/**\n * Secure Hash Algorithm with a 1024-bit block size implementation.\n *\n * This includes: SHA-512, SHA-384, SHA-512/224, and SHA-512/256. For\n * SHA-256 (block size 512 bits), see sha256.js.\n *\n * See FIPS 180-4 for details.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2014-2015 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./md');\nrequire('./util');\n\nvar sha512 = module.exports = forge.sha512 = forge.sha512 || {};\n\n// SHA-512\nforge.md.sha512 = forge.md.algorithms.sha512 = sha512;\n\n// SHA-384\nvar sha384 = forge.sha384 = forge.sha512.sha384 = forge.sha512.sha384 || {};\nsha384.create = function() {\n  return sha512.create('SHA-384');\n};\nforge.md.sha384 = forge.md.algorithms.sha384 = sha384;\n\n// SHA-512/256\nforge.sha512.sha256 = forge.sha512.sha256 || {\n  create: function() {\n    return sha512.create('SHA-512/256');\n  }\n};\nforge.md['sha512/256'] = forge.md.algorithms['sha512/256'] =\n  forge.sha512.sha256;\n\n// SHA-512/224\nforge.sha512.sha224 = forge.sha512.sha224 || {\n  create: function() {\n    return sha512.create('SHA-512/224');\n  }\n};\nforge.md['sha512/224'] = forge.md.algorithms['sha512/224'] =\n  forge.sha512.sha224;\n\n/**\n * Creates a SHA-2 message digest object.\n *\n * @param algorithm the algorithm to use (SHA-512, SHA-384, SHA-512/224,\n *          SHA-512/256).\n *\n * @return a message digest object.\n */\nsha512.create = function(algorithm) {\n  // do initialization as necessary\n  if(!_initialized) {\n    _init();\n  }\n\n  if(typeof algorithm === 'undefined') {\n    algorithm = 'SHA-512';\n  }\n\n  if(!(algorithm in _states)) {\n    throw new Error('Invalid SHA-512 algorithm: ' + algorithm);\n  }\n\n  // SHA-512 state contains eight 64-bit integers (each as two 32-bit ints)\n  var _state = _states[algorithm];\n  var _h = null;\n\n  // input buffer\n  var _input = forge.util.createBuffer();\n\n  // used for 64-bit word storage\n  var _w = new Array(80);\n  for(var wi = 0; wi < 80; ++wi) {\n    _w[wi] = new Array(2);\n  }\n\n  // determine digest length by algorithm name (default)\n  var digestLength = 64;\n  switch(algorithm) {\n    case 'SHA-384':\n      digestLength = 48;\n      break;\n    case 'SHA-512/256':\n      digestLength = 32;\n      break;\n    case 'SHA-512/224':\n      digestLength = 28;\n      break;\n  }\n\n  // message digest object\n  var md = {\n    // SHA-512 => sha512\n    algorithm: algorithm.replace('-', '').toLowerCase(),\n    blockLength: 128,\n    digestLength: digestLength,\n    // 56-bit length of message so far (does not including padding)\n    messageLength: 0,\n    // true message length\n    fullMessageLength: null,\n    // size of message length in bytes\n    messageLengthSize: 16\n  };\n\n  /**\n   * Starts the digest.\n   *\n   * @return this digest object.\n   */\n  md.start = function() {\n    // up to 56-bit message length for convenience\n    md.messageLength = 0;\n\n    // full message length (set md.messageLength128 for backwards-compatibility)\n    md.fullMessageLength = md.messageLength128 = [];\n    var int32s = md.messageLengthSize / 4;\n    for(var i = 0; i < int32s; ++i) {\n      md.fullMessageLength.push(0);\n    }\n    _input = forge.util.createBuffer();\n    _h = new Array(_state.length);\n    for(var i = 0; i < _state.length; ++i) {\n      _h[i] = _state[i].slice(0);\n    }\n    return md;\n  };\n  // start digest automatically for first time\n  md.start();\n\n  /**\n   * Updates the digest with the given message input. The given input can\n   * treated as raw input (no encoding will be applied) or an encoding of\n   * 'utf8' maybe given to encode the input using UTF-8.\n   *\n   * @param msg the message input to update with.\n   * @param encoding the encoding to use (default: 'raw', other: 'utf8').\n   *\n   * @return this digest object.\n   */\n  md.update = function(msg, encoding) {\n    if(encoding === 'utf8') {\n      msg = forge.util.encodeUtf8(msg);\n    }\n\n    // update message length\n    var len = msg.length;\n    md.messageLength += len;\n    len = [(len / 0x100000000) >>> 0, len >>> 0];\n    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {\n      md.fullMessageLength[i] += len[1];\n      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);\n      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;\n      len[0] = ((len[1] / 0x100000000) >>> 0);\n    }\n\n    // add bytes to input buffer\n    _input.putBytes(msg);\n\n    // process bytes\n    _update(_h, _w, _input);\n\n    // compact input buffer every 2K or if empty\n    if(_input.read > 2048 || _input.length() === 0) {\n      _input.compact();\n    }\n\n    return md;\n  };\n\n  /**\n   * Produces the digest.\n   *\n   * @return a byte buffer containing the digest value.\n   */\n  md.digest = function() {\n    /* Note: Here we copy the remaining bytes in the input buffer and\n    add the appropriate SHA-512 padding. Then we do the final update\n    on a copy of the state so that if the user wants to get\n    intermediate digests they can do so. */\n\n    /* Determine the number of bytes that must be added to the message\n    to ensure its length is congruent to 896 mod 1024. In other words,\n    the data to be digested must be a multiple of 1024 bits (or 128 bytes).\n    This data includes the message, some padding, and the length of the\n    message. Since the length of the message will be encoded as 16 bytes (128\n    bits), that means that the last segment of the data must have 112 bytes\n    (896 bits) of message and padding. Therefore, the length of the message\n    plus the padding must be congruent to 896 mod 1024 because\n    1024 - 128 = 896.\n\n    In order to fill up the message length it must be filled with\n    padding that begins with 1 bit followed by all 0 bits. Padding\n    must *always* be present, so if the message length is already\n    congruent to 896 mod 1024, then 1024 padding bits must be added. */\n\n    var finalBlock = forge.util.createBuffer();\n    finalBlock.putBytes(_input.bytes());\n\n    // compute remaining size to be digested (include message length size)\n    var remaining = (\n      md.fullMessageLength[md.fullMessageLength.length - 1] +\n      md.messageLengthSize);\n\n    // add padding for overflow blockSize - overflow\n    // _padding starts with 1 byte with first bit is set (byte value 128), then\n    // there may be up to (blockSize - 1) other pad bytes\n    var overflow = remaining & (md.blockLength - 1);\n    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));\n\n    // serialize message length in bits in big-endian order; since length\n    // is stored in bytes we multiply by 8 and add carry from next int\n    var next, carry;\n    var bits = md.fullMessageLength[0] * 8;\n    for(var i = 0; i < md.fullMessageLength.length - 1; ++i) {\n      next = md.fullMessageLength[i + 1] * 8;\n      carry = (next / 0x100000000) >>> 0;\n      bits += carry;\n      finalBlock.putInt32(bits >>> 0);\n      bits = next >>> 0;\n    }\n    finalBlock.putInt32(bits);\n\n    var h = new Array(_h.length);\n    for(var i = 0; i < _h.length; ++i) {\n      h[i] = _h[i].slice(0);\n    }\n    _update(h, _w, finalBlock);\n    var rval = forge.util.createBuffer();\n    var hlen;\n    if(algorithm === 'SHA-512') {\n      hlen = h.length;\n    } else if(algorithm === 'SHA-384') {\n      hlen = h.length - 2;\n    } else {\n      hlen = h.length - 4;\n    }\n    for(var i = 0; i < hlen; ++i) {\n      rval.putInt32(h[i][0]);\n      if(i !== hlen - 1 || algorithm !== 'SHA-512/224') {\n        rval.putInt32(h[i][1]);\n      }\n    }\n    return rval;\n  };\n\n  return md;\n};\n\n// sha-512 padding bytes not initialized yet\nvar _padding = null;\nvar _initialized = false;\n\n// table of constants\nvar _k = null;\n\n// initial hash states\nvar _states = null;\n\n/**\n * Initializes the constant tables.\n */\nfunction _init() {\n  // create padding\n  _padding = String.fromCharCode(128);\n  _padding += forge.util.fillString(String.fromCharCode(0x00), 128);\n\n  // create K table for SHA-512\n  _k = [\n    [0x428a2f98, 0xd728ae22], [0x71374491, 0x23ef65cd],\n    [0xb5c0fbcf, 0xec4d3b2f], [0xe9b5dba5, 0x8189dbbc],\n    [0x3956c25b, 0xf348b538], [0x59f111f1, 0xb605d019],\n    [0x923f82a4, 0xaf194f9b], [0xab1c5ed5, 0xda6d8118],\n    [0xd807aa98, 0xa3030242], [0x12835b01, 0x45706fbe],\n    [0x243185be, 0x4ee4b28c], [0x550c7dc3, 0xd5ffb4e2],\n    [0x72be5d74, 0xf27b896f], [0x80deb1fe, 0x3b1696b1],\n    [0x9bdc06a7, 0x25c71235], [0xc19bf174, 0xcf692694],\n    [0xe49b69c1, 0x9ef14ad2], [0xefbe4786, 0x384f25e3],\n    [0x0fc19dc6, 0x8b8cd5b5], [0x240ca1cc, 0x77ac9c65],\n    [0x2de92c6f, 0x592b0275], [0x4a7484aa, 0x6ea6e483],\n    [0x5cb0a9dc, 0xbd41fbd4], [0x76f988da, 0x831153b5],\n    [0x983e5152, 0xee66dfab], [0xa831c66d, 0x2db43210],\n    [0xb00327c8, 0x98fb213f], [0xbf597fc7, 0xbeef0ee4],\n    [0xc6e00bf3, 0x3da88fc2], [0xd5a79147, 0x930aa725],\n    [0x06ca6351, 0xe003826f], [0x14292967, 0x0a0e6e70],\n    [0x27b70a85, 0x46d22ffc], [0x2e1b2138, 0x5c26c926],\n    [0x4d2c6dfc, 0x5ac42aed], [0x53380d13, 0x9d95b3df],\n    [0x650a7354, 0x8baf63de], [0x766a0abb, 0x3c77b2a8],\n    [0x81c2c92e, 0x47edaee6], [0x92722c85, 0x1482353b],\n    [0xa2bfe8a1, 0x4cf10364], [0xa81a664b, 0xbc423001],\n    [0xc24b8b70, 0xd0f89791], [0xc76c51a3, 0x0654be30],\n    [0xd192e819, 0xd6ef5218], [0xd6990624, 0x5565a910],\n    [0xf40e3585, 0x5771202a], [0x106aa070, 0x32bbd1b8],\n    [0x19a4c116, 0xb8d2d0c8], [0x1e376c08, 0x5141ab53],\n    [0x2748774c, 0xdf8eeb99], [0x34b0bcb5, 0xe19b48a8],\n    [0x391c0cb3, 0xc5c95a63], [0x4ed8aa4a, 0xe3418acb],\n    [0x5b9cca4f, 0x7763e373], [0x682e6ff3, 0xd6b2b8a3],\n    [0x748f82ee, 0x5defb2fc], [0x78a5636f, 0x43172f60],\n    [0x84c87814, 0xa1f0ab72], [0x8cc70208, 0x1a6439ec],\n    [0x90befffa, 0x23631e28], [0xa4506ceb, 0xde82bde9],\n    [0xbef9a3f7, 0xb2c67915], [0xc67178f2, 0xe372532b],\n    [0xca273ece, 0xea26619c], [0xd186b8c7, 0x21c0c207],\n    [0xeada7dd6, 0xcde0eb1e], [0xf57d4f7f, 0xee6ed178],\n    [0x06f067aa, 0x72176fba], [0x0a637dc5, 0xa2c898a6],\n    [0x113f9804, 0xbef90dae], [0x1b710b35, 0x131c471b],\n    [0x28db77f5, 0x23047d84], [0x32caab7b, 0x40c72493],\n    [0x3c9ebe0a, 0x15c9bebc], [0x431d67c4, 0x9c100d4c],\n    [0x4cc5d4be, 0xcb3e42b6], [0x597f299c, 0xfc657e2a],\n    [0x5fcb6fab, 0x3ad6faec], [0x6c44198c, 0x4a475817]\n  ];\n\n  // initial hash states\n  _states = {};\n  _states['SHA-512'] = [\n    [0x6a09e667, 0xf3bcc908],\n    [0xbb67ae85, 0x84caa73b],\n    [0x3c6ef372, 0xfe94f82b],\n    [0xa54ff53a, 0x5f1d36f1],\n    [0x510e527f, 0xade682d1],\n    [0x9b05688c, 0x2b3e6c1f],\n    [0x1f83d9ab, 0xfb41bd6b],\n    [0x5be0cd19, 0x137e2179]\n  ];\n  _states['SHA-384'] = [\n    [0xcbbb9d5d, 0xc1059ed8],\n    [0x629a292a, 0x367cd507],\n    [0x9159015a, 0x3070dd17],\n    [0x152fecd8, 0xf70e5939],\n    [0x67332667, 0xffc00b31],\n    [0x8eb44a87, 0x68581511],\n    [0xdb0c2e0d, 0x64f98fa7],\n    [0x47b5481d, 0xbefa4fa4]\n  ];\n  _states['SHA-512/256'] = [\n    [0x22312194, 0xFC2BF72C],\n    [0x9F555FA3, 0xC84C64C2],\n    [0x2393B86B, 0x6F53B151],\n    [0x96387719, 0x5940EABD],\n    [0x96283EE2, 0xA88EFFE3],\n    [0xBE5E1E25, 0x53863992],\n    [0x2B0199FC, 0x2C85B8AA],\n    [0x0EB72DDC, 0x81C52CA2]\n  ];\n  _states['SHA-512/224'] = [\n    [0x8C3D37C8, 0x19544DA2],\n    [0x73E19966, 0x89DCD4D6],\n    [0x1DFAB7AE, 0x32FF9C82],\n    [0x679DD514, 0x582F9FCF],\n    [0x0F6D2B69, 0x7BD44DA8],\n    [0x77E36F73, 0x04C48942],\n    [0x3F9D85A8, 0x6A1D36C8],\n    [0x1112E6AD, 0x91D692A1]\n  ];\n\n  // now initialized\n  _initialized = true;\n}\n\n/**\n * Updates a SHA-512 state with the given byte buffer.\n *\n * @param s the SHA-512 state to update.\n * @param w the array to use to store words.\n * @param bytes the byte buffer to update with.\n */\nfunction _update(s, w, bytes) {\n  // consume 512 bit (128 byte) chunks\n  var t1_hi, t1_lo;\n  var t2_hi, t2_lo;\n  var s0_hi, s0_lo;\n  var s1_hi, s1_lo;\n  var ch_hi, ch_lo;\n  var maj_hi, maj_lo;\n  var a_hi, a_lo;\n  var b_hi, b_lo;\n  var c_hi, c_lo;\n  var d_hi, d_lo;\n  var e_hi, e_lo;\n  var f_hi, f_lo;\n  var g_hi, g_lo;\n  var h_hi, h_lo;\n  var i, hi, lo, w2, w7, w15, w16;\n  var len = bytes.length();\n  while(len >= 128) {\n    // the w array will be populated with sixteen 64-bit big-endian words\n    // and then extended into 64 64-bit words according to SHA-512\n    for(i = 0; i < 16; ++i) {\n      w[i][0] = bytes.getInt32() >>> 0;\n      w[i][1] = bytes.getInt32() >>> 0;\n    }\n    for(; i < 80; ++i) {\n      // for word 2 words ago: ROTR 19(x) ^ ROTR 61(x) ^ SHR 6(x)\n      w2 = w[i - 2];\n      hi = w2[0];\n      lo = w2[1];\n\n      // high bits\n      t1_hi = (\n        ((hi >>> 19) | (lo << 13)) ^ // ROTR 19\n        ((lo >>> 29) | (hi << 3)) ^ // ROTR 61/(swap + ROTR 29)\n        (hi >>> 6)) >>> 0; // SHR 6\n      // low bits\n      t1_lo = (\n        ((hi << 13) | (lo >>> 19)) ^ // ROTR 19\n        ((lo << 3) | (hi >>> 29)) ^ // ROTR 61/(swap + ROTR 29)\n        ((hi << 26) | (lo >>> 6))) >>> 0; // SHR 6\n\n      // for word 15 words ago: ROTR 1(x) ^ ROTR 8(x) ^ SHR 7(x)\n      w15 = w[i - 15];\n      hi = w15[0];\n      lo = w15[1];\n\n      // high bits\n      t2_hi = (\n        ((hi >>> 1) | (lo << 31)) ^ // ROTR 1\n        ((hi >>> 8) | (lo << 24)) ^ // ROTR 8\n        (hi >>> 7)) >>> 0; // SHR 7\n      // low bits\n      t2_lo = (\n        ((hi << 31) | (lo >>> 1)) ^ // ROTR 1\n        ((hi << 24) | (lo >>> 8)) ^ // ROTR 8\n        ((hi << 25) | (lo >>> 7))) >>> 0; // SHR 7\n\n      // sum(t1, word 7 ago, t2, word 16 ago) modulo 2^64 (carry lo overflow)\n      w7 = w[i - 7];\n      w16 = w[i - 16];\n      lo = (t1_lo + w7[1] + t2_lo + w16[1]);\n      w[i][0] = (t1_hi + w7[0] + t2_hi + w16[0] +\n        ((lo / 0x100000000) >>> 0)) >>> 0;\n      w[i][1] = lo >>> 0;\n    }\n\n    // initialize hash value for this chunk\n    a_hi = s[0][0];\n    a_lo = s[0][1];\n    b_hi = s[1][0];\n    b_lo = s[1][1];\n    c_hi = s[2][0];\n    c_lo = s[2][1];\n    d_hi = s[3][0];\n    d_lo = s[3][1];\n    e_hi = s[4][0];\n    e_lo = s[4][1];\n    f_hi = s[5][0];\n    f_lo = s[5][1];\n    g_hi = s[6][0];\n    g_lo = s[6][1];\n    h_hi = s[7][0];\n    h_lo = s[7][1];\n\n    // round function\n    for(i = 0; i < 80; ++i) {\n      // Sum1(e) = ROTR 14(e) ^ ROTR 18(e) ^ ROTR 41(e)\n      s1_hi = (\n        ((e_hi >>> 14) | (e_lo << 18)) ^ // ROTR 14\n        ((e_hi >>> 18) | (e_lo << 14)) ^ // ROTR 18\n        ((e_lo >>> 9) | (e_hi << 23))) >>> 0; // ROTR 41/(swap + ROTR 9)\n      s1_lo = (\n        ((e_hi << 18) | (e_lo >>> 14)) ^ // ROTR 14\n        ((e_hi << 14) | (e_lo >>> 18)) ^ // ROTR 18\n        ((e_lo << 23) | (e_hi >>> 9))) >>> 0; // ROTR 41/(swap + ROTR 9)\n\n      // Ch(e, f, g) (optimized the same way as SHA-1)\n      ch_hi = (g_hi ^ (e_hi & (f_hi ^ g_hi))) >>> 0;\n      ch_lo = (g_lo ^ (e_lo & (f_lo ^ g_lo))) >>> 0;\n\n      // Sum0(a) = ROTR 28(a) ^ ROTR 34(a) ^ ROTR 39(a)\n      s0_hi = (\n        ((a_hi >>> 28) | (a_lo << 4)) ^ // ROTR 28\n        ((a_lo >>> 2) | (a_hi << 30)) ^ // ROTR 34/(swap + ROTR 2)\n        ((a_lo >>> 7) | (a_hi << 25))) >>> 0; // ROTR 39/(swap + ROTR 7)\n      s0_lo = (\n        ((a_hi << 4) | (a_lo >>> 28)) ^ // ROTR 28\n        ((a_lo << 30) | (a_hi >>> 2)) ^ // ROTR 34/(swap + ROTR 2)\n        ((a_lo << 25) | (a_hi >>> 7))) >>> 0; // ROTR 39/(swap + ROTR 7)\n\n      // Maj(a, b, c) (optimized the same way as SHA-1)\n      maj_hi = ((a_hi & b_hi) | (c_hi & (a_hi ^ b_hi))) >>> 0;\n      maj_lo = ((a_lo & b_lo) | (c_lo & (a_lo ^ b_lo))) >>> 0;\n\n      // main algorithm\n      // t1 = (h + s1 + ch + _k[i] + _w[i]) modulo 2^64 (carry lo overflow)\n      lo = (h_lo + s1_lo + ch_lo + _k[i][1] + w[i][1]);\n      t1_hi = (h_hi + s1_hi + ch_hi + _k[i][0] + w[i][0] +\n        ((lo / 0x100000000) >>> 0)) >>> 0;\n      t1_lo = lo >>> 0;\n\n      // t2 = s0 + maj modulo 2^64 (carry lo overflow)\n      lo = s0_lo + maj_lo;\n      t2_hi = (s0_hi + maj_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n      t2_lo = lo >>> 0;\n\n      h_hi = g_hi;\n      h_lo = g_lo;\n\n      g_hi = f_hi;\n      g_lo = f_lo;\n\n      f_hi = e_hi;\n      f_lo = e_lo;\n\n      // e = (d + t1) modulo 2^64 (carry lo overflow)\n      lo = d_lo + t1_lo;\n      e_hi = (d_hi + t1_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n      e_lo = lo >>> 0;\n\n      d_hi = c_hi;\n      d_lo = c_lo;\n\n      c_hi = b_hi;\n      c_lo = b_lo;\n\n      b_hi = a_hi;\n      b_lo = a_lo;\n\n      // a = (t1 + t2) modulo 2^64 (carry lo overflow)\n      lo = t1_lo + t2_lo;\n      a_hi = (t1_hi + t2_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n      a_lo = lo >>> 0;\n    }\n\n    // update hash state (additional modulo 2^64)\n    lo = s[0][1] + a_lo;\n    s[0][0] = (s[0][0] + a_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[0][1] = lo >>> 0;\n\n    lo = s[1][1] + b_lo;\n    s[1][0] = (s[1][0] + b_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[1][1] = lo >>> 0;\n\n    lo = s[2][1] + c_lo;\n    s[2][0] = (s[2][0] + c_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[2][1] = lo >>> 0;\n\n    lo = s[3][1] + d_lo;\n    s[3][0] = (s[3][0] + d_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[3][1] = lo >>> 0;\n\n    lo = s[4][1] + e_lo;\n    s[4][0] = (s[4][0] + e_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[4][1] = lo >>> 0;\n\n    lo = s[5][1] + f_lo;\n    s[5][0] = (s[5][0] + f_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[5][1] = lo >>> 0;\n\n    lo = s[6][1] + g_lo;\n    s[6][0] = (s[6][0] + g_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[6][1] = lo >>> 0;\n\n    lo = s[7][1] + h_lo;\n    s[7][0] = (s[7][0] + h_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[7][1] = lo >>> 0;\n\n    len -= 128;\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;CAYA,IAAI;AACJ;AACA;CAEA,IAAI,SAAS,OAAO,UAAU,MAAM,SAAS,MAAM,UAAU,EAAE;AAG/D,OAAM,GAAG,SAAS,MAAM,GAAG,WAAW,SAAS;CAG/C,IAAI,SAAS,MAAM,SAAS,MAAM,OAAO,SAAS,MAAM,OAAO,UAAU,EAAE;AAC3E,QAAO,SAAS,WAAW;AACzB,SAAO,OAAO,OAAO,UAAU;;AAEjC,OAAM,GAAG,SAAS,MAAM,GAAG,WAAW,SAAS;AAG/C,OAAM,OAAO,SAAS,MAAM,OAAO,UAAU,EAC3C,QAAQ,WAAW;AACjB,SAAO,OAAO,OAAO,cAAc;IAEtC;AACD,OAAM,GAAG,gBAAgB,MAAM,GAAG,WAAW,gBAC3C,MAAM,OAAO;AAGf,OAAM,OAAO,SAAS,MAAM,OAAO,UAAU,EAC3C,QAAQ,WAAW;AACjB,SAAO,OAAO,OAAO,cAAc;IAEtC;AACD,OAAM,GAAG,gBAAgB,MAAM,GAAG,WAAW,gBAC3C,MAAM,OAAO;;;;;;;;;AAUf,QAAO,SAAS,SAAS,WAAW;AAElC,MAAG,CAAC,aACF,QAAO;AAGT,MAAG,OAAO,cAAc,YACtB,aAAY;AAGd,MAAG,EAAE,aAAa,SAChB,OAAM,IAAI,MAAM,gCAAgC,UAAU;EAI5D,IAAI,SAAS,QAAQ;EACrB,IAAI,KAAK;EAGT,IAAI,SAAS,MAAM,KAAK,cAAc;EAGtC,IAAI,KAAK,IAAI,MAAM,GAAG;AACtB,OAAI,IAAI,KAAK,GAAG,KAAK,IAAI,EAAE,GACzB,IAAG,MAAM,IAAI,MAAM,EAAE;EAIvB,IAAI,eAAe;AACnB,UAAO,WAAP;GACE,KAAK;AACH,mBAAe;AACf;GACF,KAAK;AACH,mBAAe;AACf;GACF,KAAK;AACH,mBAAe;AACf;;EAIJ,IAAI,KAAK;GAEP,WAAW,UAAU,QAAQ,KAAK,GAAG,CAAC,aAAa;GACnD,aAAa;GACC;GAEd,eAAe;GAEf,mBAAmB;GAEnB,mBAAmB;GACpB;;;;;;AAOD,KAAG,QAAQ,WAAW;AAEpB,MAAG,gBAAgB;AAGnB,MAAG,oBAAoB,GAAG,mBAAmB,EAAE;GAC/C,IAAI,SAAS,GAAG,oBAAoB;AACpC,QAAI,IAAI,IAAI,GAAG,IAAI,QAAQ,EAAE,EAC3B,IAAG,kBAAkB,KAAK,EAAE;AAE9B,YAAS,MAAM,KAAK,cAAc;AAClC,QAAK,IAAI,MAAM,OAAO,OAAO;AAC7B,QAAI,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,EAClC,IAAG,KAAK,OAAO,GAAG,MAAM,EAAE;AAE5B,UAAO;;AAGT,KAAG,OAAO;;;;;;;;;;;AAYV,KAAG,SAAS,SAAS,KAAK,UAAU;AAClC,OAAG,aAAa,OACd,OAAM,MAAM,KAAK,WAAW,IAAI;GAIlC,IAAI,MAAM,IAAI;AACd,MAAG,iBAAiB;AACpB,SAAM,CAAE,MAAM,eAAiB,GAAG,QAAQ,EAAE;AAC5C,QAAI,IAAI,IAAI,GAAG,kBAAkB,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;AACxD,OAAG,kBAAkB,MAAM,IAAI;AAC/B,QAAI,KAAK,IAAI,MAAO,GAAG,kBAAkB,KAAK,eAAiB;AAC/D,OAAG,kBAAkB,KAAK,GAAG,kBAAkB,OAAO;AACtD,QAAI,KAAO,IAAI,KAAK,eAAiB;;AAIvC,UAAO,SAAS,IAAI;AAGpB,WAAQ,IAAI,IAAI,OAAO;AAGvB,OAAG,OAAO,OAAO,QAAQ,OAAO,QAAQ,KAAK,EAC3C,QAAO,SAAS;AAGlB,UAAO;;;;;;;AAQT,KAAG,SAAS,WAAW;GAqBrB,IAAI,aAAa,MAAM,KAAK,cAAc;AAC1C,cAAW,SAAS,OAAO,OAAO,CAAC;GAUnC,IAAI,WANF,GAAG,kBAAkB,GAAG,kBAAkB,SAAS,KACnD,GAAG,oBAKuB,GAAG,cAAc;AAC7C,cAAW,SAAS,SAAS,OAAO,GAAG,GAAG,cAAc,SAAS,CAAC;GAIlE,IAAI,MAAM;GACV,IAAI,OAAO,GAAG,kBAAkB,KAAK;AACrC,QAAI,IAAI,IAAI,GAAG,IAAI,GAAG,kBAAkB,SAAS,GAAG,EAAE,GAAG;AACvD,WAAO,GAAG,kBAAkB,IAAI,KAAK;AACrC,YAAS,OAAO,eAAiB;AACjC,YAAQ;AACR,eAAW,SAAS,SAAS,EAAE;AAC/B,WAAO,SAAS;;AAElB,cAAW,SAAS,KAAK;GAEzB,IAAI,IAAI,IAAI,MAAM,GAAG,OAAO;AAC5B,QAAI,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,EAAE,EAC9B,GAAE,KAAK,GAAG,GAAG,MAAM,EAAE;AAEvB,WAAQ,GAAG,IAAI,WAAW;GAC1B,IAAI,OAAO,MAAM,KAAK,cAAc;GACpC,IAAI;AACJ,OAAG,cAAc,UACf,QAAO,EAAE;YACD,cAAc,UACtB,QAAO,EAAE,SAAS;OAElB,QAAO,EAAE,SAAS;AAEpB,QAAI,IAAI,IAAI,GAAG,IAAI,MAAM,EAAE,GAAG;AAC5B,SAAK,SAAS,EAAE,GAAG,GAAG;AACtB,QAAG,MAAM,OAAO,KAAK,cAAc,cACjC,MAAK,SAAS,EAAE,GAAG,GAAG;;AAG1B,UAAO;;AAGT,SAAO;;CAIT,IAAI,WAAW;CACf,IAAI,eAAe;CAGnB,IAAI,KAAK;CAGT,IAAI,UAAU;;;;CAKd,SAAS,QAAQ;AAEf,aAAW,OAAO,aAAa,IAAI;AACnC,cAAY,MAAM,KAAK,WAAW,OAAO,aAAa,EAAK,EAAE,IAAI;AAGjE,OAAK;GACH,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,UAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,WAAY,WAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,UAAW;GAClD,CAAC,YAAY,UAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,UAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,WAAY,WAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,UAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,WAAY,UAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,WAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,UAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,UAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,WAAY,UAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,WAAY,WAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,WAAY,WAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,UAAW;GAClD,CAAC,YAAY,UAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,UAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,WAAY,WAAW;GAClD,CAAC,WAAY,WAAW;GAAE,CAAC,WAAY,UAAW;GAClD,CAAC,WAAY,UAAW;GAAE,CAAC,WAAY,WAAW;GAClD,CAAC,YAAY,UAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,WAAW;GAAE,CAAC,YAAY,WAAW;GAClD,CAAC,YAAY,UAAW;GAAE,CAAC,YAAY,WAAW;GACnD;AAGD,YAAU,EAAE;AACZ,UAAQ,aAAa;GACnB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,UAAW;GACxB,CAAC,WAAY,WAAW;GACxB,CAAC,YAAY,UAAW;GACzB;AACD,UAAQ,aAAa;GACnB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,UAAW;GACxB,CAAC,YAAY,UAAW;GACxB,CAAC,WAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACzB;AACD,UAAQ,iBAAiB;GACvB,CAAC,WAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,WAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,WAAY,UAAW;GACxB,CAAC,WAAY,WAAW;GACzB;AACD,UAAQ,iBAAiB;GACvB,CAAC,YAAY,UAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,WAAY,UAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,WAAY,WAAW;GACxB,CAAC,YAAY,SAAW;GACxB,CAAC,YAAY,WAAW;GACxB,CAAC,WAAY,WAAW;GACzB;AAGD,iBAAe;;;;;;;;;CAUjB,SAAS,QAAQ,GAAG,GAAG,OAAO;EAE5B,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,QAAQ;EACZ,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;EAC5B,IAAI,MAAM,MAAM,QAAQ;AACxB,SAAM,OAAO,KAAK;AAGhB,QAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AACtB,MAAE,GAAG,KAAK,MAAM,UAAU,KAAK;AAC/B,MAAE,GAAG,KAAK,MAAM,UAAU,KAAK;;AAEjC,UAAM,IAAI,IAAI,EAAE,GAAG;AAEjB,SAAK,EAAE,IAAI;AACX,SAAK,GAAG;AACR,SAAK,GAAG;AAGR,cACI,OAAO,KAAO,MAAM,OACpB,OAAO,KAAO,MAAM,KACrB,OAAO,OAAQ;AAElB,cACI,MAAM,KAAO,OAAO,OACpB,MAAM,IAAM,OAAO,OACnB,MAAM,KAAO,OAAO,QAAS;AAGjC,UAAM,EAAE,IAAI;AACZ,SAAK,IAAI;AACT,SAAK,IAAI;AAGT,cACI,OAAO,IAAM,MAAM,OACnB,OAAO,IAAM,MAAM,MACpB,OAAO,OAAQ;AAElB,cACI,MAAM,KAAO,OAAO,MACpB,MAAM,KAAO,OAAO,MACpB,MAAM,KAAO,OAAO,QAAS;AAGjC,SAAK,EAAE,IAAI;AACX,UAAM,EAAE,IAAI;AACZ,SAAM,QAAQ,GAAG,KAAK,QAAQ,IAAI;AAClC,MAAE,GAAG,KAAM,QAAQ,GAAG,KAAK,QAAQ,IAAI,MACnC,KAAK,eAAiB,OAAQ;AAClC,MAAE,GAAG,KAAK,OAAO;;AAInB,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AACZ,UAAO,EAAE,GAAG;AAGZ,QAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAEtB,cACI,SAAS,KAAO,QAAQ,OACxB,SAAS,KAAO,QAAQ,OACxB,SAAS,IAAM,QAAQ,SAAU;AACrC,cACI,QAAQ,KAAO,SAAS,OACxB,QAAQ,KAAO,SAAS,OACxB,QAAQ,KAAO,SAAS,QAAS;AAGrC,aAAS,OAAQ,QAAQ,OAAO,WAAY;AAC5C,aAAS,OAAQ,QAAQ,OAAO,WAAY;AAG5C,cACI,SAAS,KAAO,QAAQ,MACxB,SAAS,IAAM,QAAQ,OACvB,SAAS,IAAM,QAAQ,SAAU;AACrC,cACI,QAAQ,IAAM,SAAS,OACvB,QAAQ,KAAO,SAAS,MACxB,QAAQ,KAAO,SAAS,QAAS;AAGrC,cAAW,OAAO,OAAS,QAAQ,OAAO,WAAY;AACtD,cAAW,OAAO,OAAS,QAAQ,OAAO,WAAY;AAItD,SAAM,OAAO,QAAQ,QAAQ,GAAG,GAAG,KAAK,EAAE,GAAG;AAC7C,YAAS,OAAO,QAAQ,QAAQ,GAAG,GAAG,KAAK,EAAE,GAAG,MAC5C,KAAK,eAAiB,OAAQ;AAClC,YAAQ,OAAO;AAGf,SAAK,QAAQ;AACb,YAAS,QAAQ,UAAW,KAAK,eAAiB,OAAQ;AAC1D,YAAQ,OAAO;AAEf,WAAO;AACP,WAAO;AAEP,WAAO;AACP,WAAO;AAEP,WAAO;AACP,WAAO;AAGP,SAAK,OAAO;AACZ,WAAQ,OAAO,SAAU,KAAK,eAAiB,OAAQ;AACvD,WAAO,OAAO;AAEd,WAAO;AACP,WAAO;AAEP,WAAO;AACP,WAAO;AAEP,WAAO;AACP,WAAO;AAGP,SAAK,QAAQ;AACb,WAAQ,QAAQ,SAAU,KAAK,eAAiB,OAAQ;AACxD,WAAO,OAAO;;AAIhB,QAAK,EAAE,GAAG,KAAK;AACf,KAAE,GAAG,KAAM,EAAE,GAAG,KAAK,QAAS,KAAK,eAAiB,OAAQ;AAC5D,KAAE,GAAG,KAAK,OAAO;AAEjB,QAAK,EAAE,GAAG,KAAK;AACf,KAAE,GAAG,KAAM,EAAE,GAAG,KAAK,QAAS,KAAK,eAAiB,OAAQ;AAC5D,KAAE,GAAG,KAAK,OAAO;AAEjB,QAAK,EAAE,GAAG,KAAK;AACf,KAAE,GAAG,KAAM,EAAE,GAAG,KAAK,QAAS,KAAK,eAAiB,OAAQ;AAC5D,KAAE,GAAG,KAAK,OAAO;AAEjB,QAAK,EAAE,GAAG,KAAK;AACf,KAAE,GAAG,KAAM,EAAE,GAAG,KAAK,QAAS,KAAK,eAAiB,OAAQ;AAC5D,KAAE,GAAG,KAAK,OAAO;AAEjB,QAAK,EAAE,GAAG,KAAK;AACf,KAAE,GAAG,KAAM,EAAE,GAAG,KAAK,QAAS,KAAK,eAAiB,OAAQ;AAC5D,KAAE,GAAG,KAAK,OAAO;AAEjB,QAAK,EAAE,GAAG,KAAK;AACf,KAAE,GAAG,KAAM,EAAE,GAAG,KAAK,QAAS,KAAK,eAAiB,OAAQ;AAC5D,KAAE,GAAG,KAAK,OAAO;AAEjB,QAAK,EAAE,GAAG,KAAK;AACf,KAAE,GAAG,KAAM,EAAE,GAAG,KAAK,QAAS,KAAK,eAAiB,OAAQ;AAC5D,KAAE,GAAG,KAAK,OAAO;AAEjB,QAAK,EAAE,GAAG,KAAK;AACf,KAAE,GAAG,KAAM,EAAE,GAAG,KAAK,QAAS,KAAK,eAAiB,OAAQ;AAC5D,KAAE,GAAG,KAAK,OAAO;AAEjB,UAAO"}

package/dist/esm/node_modules/node-forge/lib/ssh.mjs

@@ -0,0 +1,198 @@
+import { __commonJS } from "../../../_virtual/rolldown_runtime.mjs";
+import { require_forge } from "./forge.mjs";
+import { require_util } from "./util.mjs";
+import { require_aes } from "./aes.mjs";
+import { require_hmac } from "./hmac.mjs";
+import { require_md5 } from "./md5.mjs";
+import { require_sha1 } from "./sha1.mjs";
+
+//#region ../../node_modules/node-forge/lib/ssh.js
+var require_ssh = /* @__PURE__ */ __commonJS({ "../../node_modules/node-forge/lib/ssh.js": ((exports, module) => {
+	/**
+	* Functions to output keys in SSH-friendly formats.
+	*
+	* This is part of the Forge project which may be used under the terms of
+	* either the BSD License or the GNU General Public License (GPL) Version 2.
+	*
+	* See: https://github.com/digitalbazaar/forge/blob/cbebca3780658703d925b61b2caffb1d263a6c1d/LICENSE
+	*
+	* @author https://github.com/shellac
+	*/
+	var forge = require_forge();
+	require_aes();
+	require_hmac();
+	require_md5();
+	require_sha1();
+	require_util();
+	var ssh = module.exports = forge.ssh = forge.ssh || {};
+	/**
+	* Encodes (and optionally encrypts) a private RSA key as a Putty PPK file.
+	*
+	* @param privateKey the key.
+	* @param passphrase a passphrase to protect the key (falsy for no encryption).
+	* @param comment a comment to include in the key file.
+	*
+	* @return the PPK file as a string.
+	*/
+	ssh.privateKeyToPutty = function(privateKey, passphrase, comment) {
+		comment = comment || "";
+		passphrase = passphrase || "";
+		var algorithm = "ssh-rsa";
+		var encryptionAlgorithm = passphrase === "" ? "none" : "aes256-cbc";
+		var ppk = "PuTTY-User-Key-File-2: " + algorithm + "\r\n";
+		ppk += "Encryption: " + encryptionAlgorithm + "\r\n";
+		ppk += "Comment: " + comment + "\r\n";
+		var pubbuffer = forge.util.createBuffer();
+		_addStringToBuffer(pubbuffer, algorithm);
+		_addBigIntegerToBuffer(pubbuffer, privateKey.e);
+		_addBigIntegerToBuffer(pubbuffer, privateKey.n);
+		var pub = forge.util.encode64(pubbuffer.bytes(), 64);
+		var length = Math.floor(pub.length / 66) + 1;
+		ppk += "Public-Lines: " + length + "\r\n";
+		ppk += pub;
+		var privbuffer = forge.util.createBuffer();
+		_addBigIntegerToBuffer(privbuffer, privateKey.d);
+		_addBigIntegerToBuffer(privbuffer, privateKey.p);
+		_addBigIntegerToBuffer(privbuffer, privateKey.q);
+		_addBigIntegerToBuffer(privbuffer, privateKey.qInv);
+		var priv;
+		if (!passphrase) priv = forge.util.encode64(privbuffer.bytes(), 64);
+		else {
+			var encLen = privbuffer.length() + 16 - 1;
+			encLen -= encLen % 16;
+			var padding = _sha1(privbuffer.bytes());
+			padding.truncate(padding.length() - encLen + privbuffer.length());
+			privbuffer.putBuffer(padding);
+			var aeskey = forge.util.createBuffer();
+			aeskey.putBuffer(_sha1("\0\0\0\0", passphrase));
+			aeskey.putBuffer(_sha1("\0\0\0
", passphrase));
+			var cipher = forge.aes.createEncryptionCipher(aeskey.truncate(8), "CBC");
+			cipher.start(forge.util.createBuffer().fillWithByte(0, 16));
+			cipher.update(privbuffer.copy());
+			cipher.finish();
+			var encrypted = cipher.output;
+			encrypted.truncate(16);
+			priv = forge.util.encode64(encrypted.bytes(), 64);
+		}
+		length = Math.floor(priv.length / 66) + 1;
+		ppk += "\r\nPrivate-Lines: " + length + "\r\n";
+		ppk += priv;
+		var mackey = _sha1("putty-private-key-file-mac-key", passphrase);
+		var macbuffer = forge.util.createBuffer();
+		_addStringToBuffer(macbuffer, algorithm);
+		_addStringToBuffer(macbuffer, encryptionAlgorithm);
+		_addStringToBuffer(macbuffer, comment);
+		macbuffer.putInt32(pubbuffer.length());
+		macbuffer.putBuffer(pubbuffer);
+		macbuffer.putInt32(privbuffer.length());
+		macbuffer.putBuffer(privbuffer);
+		var hmac = forge.hmac.create();
+		hmac.start("sha1", mackey);
+		hmac.update(macbuffer.bytes());
+		ppk += "\r\nPrivate-MAC: " + hmac.digest().toHex() + "\r\n";
+		return ppk;
+	};
+	/**
+	* Encodes a public RSA key as an OpenSSH file.
+	*
+	* @param key the key.
+	* @param comment a comment.
+	*
+	* @return the public key in OpenSSH format.
+	*/
+	ssh.publicKeyToOpenSSH = function(key, comment) {
+		var type = "ssh-rsa";
+		comment = comment || "";
+		var buffer = forge.util.createBuffer();
+		_addStringToBuffer(buffer, type);
+		_addBigIntegerToBuffer(buffer, key.e);
+		_addBigIntegerToBuffer(buffer, key.n);
+		return type + " " + forge.util.encode64(buffer.bytes()) + " " + comment;
+	};
+	/**
+	* Encodes a private RSA key as an OpenSSH file.
+	*
+	* @param key the key.
+	* @param passphrase a passphrase to protect the key (falsy for no encryption).
+	*
+	* @return the public key in OpenSSH format.
+	*/
+	ssh.privateKeyToOpenSSH = function(privateKey, passphrase) {
+		if (!passphrase) return forge.pki.privateKeyToPem(privateKey);
+		return forge.pki.encryptRsaPrivateKey(privateKey, passphrase, {
+			legacy: true,
+			algorithm: "aes128"
+		});
+	};
+	/**
+	* Gets the SSH fingerprint for the given public key.
+	*
+	* @param options the options to use.
+	*          [md] the message digest object to use (defaults to forge.md.md5).
+	*          [encoding] an alternative output encoding, such as 'hex'
+	*            (defaults to none, outputs a byte buffer).
+	*          [delimiter] the delimiter to use between bytes for 'hex' encoded
+	*            output, eg: ':' (defaults to none).
+	*
+	* @return the fingerprint as a byte buffer or other encoding based on options.
+	*/
+	ssh.getPublicKeyFingerprint = function(key, options) {
+		options = options || {};
+		var md = options.md || forge.md.md5.create();
+		var type = "ssh-rsa";
+		var buffer = forge.util.createBuffer();
+		_addStringToBuffer(buffer, type);
+		_addBigIntegerToBuffer(buffer, key.e);
+		_addBigIntegerToBuffer(buffer, key.n);
+		md.start();
+		md.update(buffer.getBytes());
+		var digest = md.digest();
+		if (options.encoding === "hex") {
+			var hex = digest.toHex();
+			if (options.delimiter) return hex.match(/.{2}/g).join(options.delimiter);
+			return hex;
+		} else if (options.encoding === "binary") return digest.getBytes();
+		else if (options.encoding) throw new Error("Unknown encoding \"" + options.encoding + "\".");
+		return digest;
+	};
+	/**
+	* Adds len(val) then val to a buffer.
+	*
+	* @param buffer the buffer to add to.
+	* @param val a big integer.
+	*/
+	function _addBigIntegerToBuffer(buffer, val) {
+		var hexVal = val.toString(16);
+		if (hexVal[0] >= "8") hexVal = "00" + hexVal;
+		var bytes = forge.util.hexToBytes(hexVal);
+		buffer.putInt32(bytes.length);
+		buffer.putBytes(bytes);
+	}
+	/**
+	* Adds len(val) then val to a buffer.
+	*
+	* @param buffer the buffer to add to.
+	* @param val a string.
+	*/
+	function _addStringToBuffer(buffer, val) {
+		buffer.putInt32(val.length);
+		buffer.putString(val);
+	}
+	/**
+	* Hashes the arguments into one value using SHA-1.
+	*
+	* @return the sha1 hash of the provided arguments.
+	*/
+	function _sha1() {
+		var sha = forge.md.sha1.create();
+		var num = arguments.length;
+		for (var i = 0; i < num; ++i) sha.update(arguments[i]);
+		return sha.digest();
+	}
+}) });
+
+//#endregion
+export default require_ssh();
+
+export { require_ssh };
+//# sourceMappingURL=ssh.mjs.map