@firmachain/firma-js
Version:
The Official FirmaChain Javascript SDK written in Typescript
137 lines (136 loc) • 6.91 kB
JavaScript
;
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (g && (g = 0, op[0] && (_ = 0)), _) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
var __read = (this && this.__read) || function (o, n) {
var m = typeof Symbol === "function" && o[Symbol.iterator];
if (!m) return o;
var i = m.call(o), r, ar = [], e;
try {
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
}
catch (error) { e = { error: error }; }
finally {
try {
if (r && !r.done && (m = i["return"])) m.call(i);
}
finally { if (e) throw e.error; }
}
return ar;
};
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
if (ar || !(i in from)) {
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
ar[i] = from[i];
}
}
return to.concat(ar || Array.prototype.slice.call(from));
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.decrypt = exports.encrypt = exports.supportedAlgorithms = exports.executeKdf = exports.cosmjsSalt = void 0;
var crypto_1 = require("@cosmjs/crypto");
var encoding_1 = require("@cosmjs/encoding");
/**
* A fixed salt is chosen to archive a deterministic password to key derivation.
* This reduces the scope of a potential rainbow attack to all CosmJS users.
* Must be 16 bytes due to implementation limitations.
*/
exports.cosmjsSalt = (0, encoding_1.toAscii)("The CosmJS salt.");
function executeKdf(password, configuration) {
return __awaiter(this, void 0, void 0, function () {
var options;
return __generator(this, function (_a) {
switch (configuration.algorithm) {
case "argon2id": {
options = configuration.params;
if (!(0, crypto_1.isArgon2idOptions)(options))
throw new Error("Invalid format of argon2id params");
return [2 /*return*/, crypto_1.Argon2id.execute(password, exports.cosmjsSalt, options)];
}
default:
throw new Error("Unsupported KDF algorithm");
}
return [2 /*return*/];
});
});
}
exports.executeKdf = executeKdf;
exports.supportedAlgorithms = {
xchacha20poly1305Ietf: "xchacha20poly1305-ietf",
};
function encrypt(plaintext, encryptionKey, config) {
return __awaiter(this, void 0, void 0, function () {
var _a, nonce, _b, _c;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
_a = config.algorithm;
switch (_a) {
case exports.supportedAlgorithms.xchacha20poly1305Ietf: return [3 /*break*/, 1];
}
return [3 /*break*/, 3];
case 1:
nonce = crypto_1.Random.getBytes(crypto_1.xchacha20NonceLength);
_b = Uint8Array.bind;
_c = [__spreadArray([], __read(nonce), false)];
return [4 /*yield*/, crypto_1.Xchacha20poly1305Ietf.encrypt(plaintext, encryptionKey, nonce)];
case 2:
// Prepend fixed-length nonce to ciphertext as suggested in the example from https://github.com/jedisct1/libsodium.js#api
return [2 /*return*/, new (_b.apply(Uint8Array, [void 0, __spreadArray.apply(void 0, _c.concat([__read.apply(void 0, [(_d.sent())]), false]))]))()];
case 3: throw new Error("Unsupported encryption algorithm: '".concat(config.algorithm, "'"));
}
});
});
}
exports.encrypt = encrypt;
function decrypt(ciphertext, encryptionKey, config) {
return __awaiter(this, void 0, void 0, function () {
var nonce;
return __generator(this, function (_a) {
switch (config.algorithm) {
case exports.supportedAlgorithms.xchacha20poly1305Ietf: {
nonce = ciphertext.slice(0, crypto_1.xchacha20NonceLength);
return [2 /*return*/, crypto_1.Xchacha20poly1305Ietf.decrypt(ciphertext.slice(crypto_1.xchacha20NonceLength), encryptionKey, nonce)];
}
default:
throw new Error("Unsupported encryption algorithm: '".concat(config.algorithm, "'"));
}
return [2 /*return*/];
});
});
}
exports.decrypt = decrypt;