@awhere/api
Version:
The awesome aWhere API for JavaScript.
121 lines • 6.31 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 };
}
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.encrypt = encrypt;
exports.decrypt = decrypt;
var arrayBufferUtil_1 = require("./arrayBufferUtil");
// const codeChallengeCache: any = {};
var keyCache = {};
function encrypt(data, codeChallenge) {
return __awaiter(this, void 0, void 0, function () {
var encoder, key, encrytpedText;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
encoder = new TextEncoder();
if (!!keyCache[codeChallenge]) return [3 /*break*/, 2];
return [4 /*yield*/, window.crypto.subtle.importKey('raw', (0, arrayBufferUtil_1.arrayBufferFromBase64Url)(codeChallenge), { name: 'AES-GCM', length: 128 }, false, ['encrypt', 'decrypt'])];
case 1:
key = _a.sent();
keyCache[codeChallenge] = key;
return [3 /*break*/, 3];
case 2:
key = keyCache[codeChallenge];
_a.label = 3;
case 3: return [4 /*yield*/, window.crypto.subtle.encrypt({ name: 'AES-GCM', iv: (0, arrayBufferUtil_1.arrayBufferFromBase64Url)(codeChallenge) }, key, encoder.encode(data))];
case 4:
encrytpedText = _a.sent();
return [2 /*return*/, (0, arrayBufferUtil_1.arrayBufferToBase64Url)(encrytpedText)];
}
});
});
}
function decrypt(base64, codeChallenge) {
return __awaiter(this, void 0, void 0, function () {
var decoder, key, data;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
decoder = new TextDecoder();
if (!!keyCache[codeChallenge]) return [3 /*break*/, 2];
return [4 /*yield*/, window.crypto.subtle.importKey('raw', (0, arrayBufferUtil_1.arrayBufferFromBase64Url)(codeChallenge), { name: 'AES-GCM', length: 128 }, false, ['encrypt', 'decrypt'])];
case 1:
key = _a.sent();
keyCache[codeChallenge] = key;
return [3 /*break*/, 3];
case 2:
key = keyCache[codeChallenge];
_a.label = 3;
case 3: return [4 /*yield*/, window.crypto.subtle.decrypt({ name: 'AES-GCM', iv: (0, arrayBufferUtil_1.arrayBufferFromBase64Url)(codeChallenge) }, key, (0, arrayBufferUtil_1.arrayBufferFromBase64Url)(base64))];
case 4:
data = _a.sent();
return [2 /*return*/, decoder.decode(data)];
}
});
});
}
// export async function hash(data: string, verifier: string) {
// const encoder = new TextEncoder();
// let codeChallenge: string;
// if (!codeChallengeCache[verifier]) {
// codeChallenge = await generateCodeChallenge(verifier);
// codeChallengeCache[verifier] = codeChallenge;
// } else {
// codeChallenge = codeChallengeCache[verifier];
// }
// let key: CryptoKey;
// if (!keyCache[verifier]) {
// key = await window.crypto.subtle.importKey(
// 'raw',
// arrayBufferFromBase64Url(codeChallenge),
// { name: 'AES-GCM', length: 128 },
// false,
// ['encrypt']
// );
// keyCache[verifier] = key;
// } else {
// key = keyCache[verifier];
// }
// const encrytpedText = await window.crypto.subtle.encrypt(
// { name: 'AES-GCM', iv: arrayBufferFromBase64Url(codeChallenge) },
// key,
// encoder.encode(data)
// );
// return arrayBufferToBase64Url(encrytpedText);
// }
//# sourceMappingURL=cryptoUtil.js.map