@siegesailor/cryptography 1.0.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (95) hide show
  1. package/LICENSE.md +19 -0
  2. package/README.md +79 -0
  3. package/build/algorithms/baby-step-giant-step/index.js +89 -0
  4. package/build/algorithms/baby-step-giant-step/index.js.map +1 -0
  5. package/build/algorithms/baby-step-giant-step/index.test.js +32 -0
  6. package/build/algorithms/baby-step-giant-step/index.test.js.map +1 -0
  7. package/build/algorithms/blum-blum-shub/index.js +88 -0
  8. package/build/algorithms/blum-blum-shub/index.js.map +1 -0
  9. package/build/algorithms/blum-blum-shub/index.test.js +74 -0
  10. package/build/algorithms/blum-blum-shub/index.test.js.map +1 -0
  11. package/build/algorithms/chinese-remainder/index.js +111 -0
  12. package/build/algorithms/chinese-remainder/index.js.map +1 -0
  13. package/build/algorithms/chinese-remainder/index.test.js +28 -0
  14. package/build/algorithms/chinese-remainder/index.test.js.map +1 -0
  15. package/build/algorithms/euclidean/index.js +60 -0
  16. package/build/algorithms/euclidean/index.js.map +1 -0
  17. package/build/algorithms/euclidean/index.test.js +22 -0
  18. package/build/algorithms/euclidean/index.test.js.map +1 -0
  19. package/build/algorithms/extended-euclidean/index.js +77 -0
  20. package/build/algorithms/extended-euclidean/index.js.map +1 -0
  21. package/build/algorithms/extended-euclidean/index.test.js +22 -0
  22. package/build/algorithms/extended-euclidean/index.test.js.map +1 -0
  23. package/build/algorithms/fast-modular-exponentiation/index.js +80 -0
  24. package/build/algorithms/fast-modular-exponentiation/index.js.map +1 -0
  25. package/build/algorithms/fast-modular-exponentiation/index.test.js +31 -0
  26. package/build/algorithms/fast-modular-exponentiation/index.test.js.map +1 -0
  27. package/build/algorithms/miller-rabin-primarily-test/index.js +87 -0
  28. package/build/algorithms/miller-rabin-primarily-test/index.js.map +1 -0
  29. package/build/algorithms/miller-rabin-primarily-test/index.test.js +78 -0
  30. package/build/algorithms/miller-rabin-primarily-test/index.test.js.map +1 -0
  31. package/build/algorithms/multiplicative-inverse/index.js +83 -0
  32. package/build/algorithms/multiplicative-inverse/index.js.map +1 -0
  33. package/build/algorithms/multiplicative-inverse/index.test.js +30 -0
  34. package/build/algorithms/multiplicative-inverse/index.test.js.map +1 -0
  35. package/build/algorithms/naor-reingo/index.js +85 -0
  36. package/build/algorithms/naor-reingo/index.js.map +1 -0
  37. package/build/algorithms/naor-reingo/index.test.js +27 -0
  38. package/build/algorithms/naor-reingo/index.test.js.map +1 -0
  39. package/build/algorithms/pollard-p-1-factorization/index.js +92 -0
  40. package/build/algorithms/pollard-p-1-factorization/index.js.map +1 -0
  41. package/build/algorithms/pollard-p-1-factorization/index.test.js +32 -0
  42. package/build/algorithms/pollard-p-1-factorization/index.test.js.map +1 -0
  43. package/build/algorithms/pollard-rho/index.js +82 -0
  44. package/build/algorithms/pollard-rho/index.js.map +1 -0
  45. package/build/algorithms/pollard-rho/index.test.js +26 -0
  46. package/build/algorithms/pollard-rho/index.test.js.map +1 -0
  47. package/build/algorithms/primitive-root-search/index.js +95 -0
  48. package/build/algorithms/primitive-root-search/index.js.map +1 -0
  49. package/build/algorithms/primitive-root-search/index.test.js +46 -0
  50. package/build/algorithms/primitive-root-search/index.test.js.map +1 -0
  51. package/build/command.js +79 -0
  52. package/build/command.js.map +1 -0
  53. package/build/entry-point.js +31 -0
  54. package/build/entry-point.js.map +1 -0
  55. package/build/key-encryptions/DiffieHellman.js +56 -0
  56. package/build/key-encryptions/DiffieHellman.js.map +1 -0
  57. package/build/key-encryptions/ElGamal.js +83 -0
  58. package/build/key-encryptions/ElGamal.js.map +1 -0
  59. package/build/key-encryptions/RSA.js +102 -0
  60. package/build/key-encryptions/RSA.js.map +1 -0
  61. package/build/shared/algorithm/math.js +9 -0
  62. package/build/shared/algorithm/math.js.map +1 -0
  63. package/build/shared/algorithm/random.js +52 -0
  64. package/build/shared/algorithm/random.js.map +1 -0
  65. package/build/shared/algorithm/wasm.js +105 -0
  66. package/build/shared/algorithm/wasm.js.map +1 -0
  67. package/build/shared/algorithm/wrap.js +57 -0
  68. package/build/shared/algorithm/wrap.js.map +1 -0
  69. package/build/shared/cli/Procedure.js +51 -0
  70. package/build/shared/cli/Procedure.js.map +1 -0
  71. package/build/shared/cli/chalk.js +48 -0
  72. package/build/shared/cli/chalk.js.map +1 -0
  73. package/build/shared/cli/inquirer.js +13 -0
  74. package/build/shared/cli/inquirer.js.map +1 -0
  75. package/build/shared/cli/prompt.js +98 -0
  76. package/build/shared/cli/prompt.js.map +1 -0
  77. package/build/shared/cli/utilities.js +145 -0
  78. package/build/shared/cli/utilities.js.map +1 -0
  79. package/build/shared/constants.js +21 -0
  80. package/build/shared/constants.js.map +1 -0
  81. package/build/shared/testing/wasm.js +78 -0
  82. package/build/shared/testing/wasm.js.map +1 -0
  83. package/build/source/algorithms/baby-step-giant-step/main.wasm +0 -0
  84. package/build/source/algorithms/blum-blum-shub/main.wasm +0 -0
  85. package/build/source/algorithms/chinese-remainder/main.wasm +0 -0
  86. package/build/source/algorithms/euclidean/main.wasm +0 -0
  87. package/build/source/algorithms/extended-euclidean/main.wasm +0 -0
  88. package/build/source/algorithms/fast-modular-exponentiation/main.wasm +0 -0
  89. package/build/source/algorithms/miller-rabin-primarily-test/main.wasm +0 -0
  90. package/build/source/algorithms/multiplicative-inverse/main.wasm +0 -0
  91. package/build/source/algorithms/naor-reingo/main.wasm +0 -0
  92. package/build/source/algorithms/pollard-p-1-factorization/main.wasm +0 -0
  93. package/build/source/algorithms/pollard-rho/main.wasm +0 -0
  94. package/build/source/algorithms/primitive-root-search/main.wasm +0 -0
  95. package/package.json +79 -0
@@ -0,0 +1,85 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ exports.default = main;
7
+ exports.prompt = prompt;
8
+ const wasm_1 = require("../../shared/algorithm/wasm");
9
+ const random_1 = require("../../shared/algorithm/random");
10
+ const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
11
+ const prompt_1 = require("../../shared/cli/prompt");
12
+ const runWASMNaorReingo = (0, wasm_1.createWASMInvoker)("naor-reingo", (wasmExports, count, digits, seed) => {
13
+ if (!wasmExports.naor_reingo_fill_i64 ||
14
+ !Number.isInteger(count) ||
15
+ count <= 0 ||
16
+ !Number.isInteger(digits) ||
17
+ digits <= 0 ||
18
+ digits > 18 ||
19
+ !(0, wasm_1.fitsInI64)(seed)) {
20
+ return null;
21
+ }
22
+ const allocator = (0, wasm_1.createI64Allocator)(wasmExports);
23
+ allocator.reset();
24
+ const outPtr = allocator.allocate(count * wasm_1.I64_BYTES);
25
+ const view = allocator.view();
26
+ if (outPtr === null || !view) {
27
+ return null;
28
+ }
29
+ const written = wasmExports.naor_reingo_fill_i64(count, digits, seed, outPtr);
30
+ if (written !== count) {
31
+ return null;
32
+ }
33
+ const values = [];
34
+ for (let index = 0; index < count; index++) {
35
+ values.push(view[outPtr / wasm_1.I64_BYTES + index]);
36
+ }
37
+ return values;
38
+ });
39
+ function main(count, digits) {
40
+ if (!Number.isInteger(count) || count <= 0) {
41
+ throw new Error("count must be a positive integer.");
42
+ }
43
+ if (!Number.isInteger(digits) || digits < 1) {
44
+ throw new Error("digits must be a positive integer.");
45
+ }
46
+ const lowerBound = 10n ** BigInt(Math.max(0, digits - 1));
47
+ const upperBound = 10n ** BigInt(digits) - 1n;
48
+ const maybeWASMValues = runWASMNaorReingo(count, digits, BigInt(Date.now()));
49
+ if (maybeWASMValues !== null) {
50
+ return maybeWASMValues.map((value) => Number(value));
51
+ }
52
+ const arrayOfResult = [];
53
+ for (let i = 0; i < count; i++) {
54
+ arrayOfResult.push(Number((0, random_1.randomBigIntBetween)(lowerBound, upperBound)));
55
+ }
56
+ return arrayOfResult;
57
+ }
58
+ const runPrompt = (0, prompt_1.createAlgorithmPrompt)("naor-reingo", async ({ ask, writeLine }) => {
59
+ writeLine("\tGenerate pseudo-random decimal numbers with fixed digit length.");
60
+ writeLine(chalk_1.default.gray("\tcount = 3, digits = 2 -> [.., .., ..]"));
61
+ const { count, digits } = await ask([
62
+ {
63
+ type: "number",
64
+ name: "count",
65
+ message: `Enter ${chalk_1.default.italic("count")}:`,
66
+ default: 3,
67
+ },
68
+ {
69
+ type: "number",
70
+ name: "digits",
71
+ message: `Enter ${chalk_1.default.italic("digits")}:`,
72
+ default: 2,
73
+ },
74
+ ]);
75
+ const result = main(Number(count), Number(digits));
76
+ writeLine(`\tResult = ${result}`);
77
+ return {
78
+ inputs: { count, digits },
79
+ result,
80
+ };
81
+ });
82
+ async function prompt(options) {
83
+ return runPrompt(options);
84
+ }
85
+ //# sourceMappingURL=index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/naor-reingo/index.ts"],"names":[],"mappings":";;;;;AAwDA,uBAsBC;AAmCD,wBAEC;AAnHD,kDAKiC;AACjC,sDAAgE;AAChE,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,iBAAiB,GAAG,IAAA,wBAAiB,EACzC,aAAa,EACb,CAAC,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE;IACnC,IACE,CAAC,WAAW,CAAC,oBAAoB;QACjC,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC;QACV,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;QACzB,MAAM,IAAI,CAAC;QACX,MAAM,GAAG,EAAE;QACX,CAAC,IAAA,gBAAS,EAAC,IAAI,CAAC,EAChB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAA,yBAAkB,EAAC,WAAW,CAAC,CAAC;IAClD,SAAS,CAAC,KAAK,EAAE,CAAC;IAElB,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,GAAG,gBAAS,CAAC,CAAC;IACrD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;IAC9B,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,OAAO,GAAG,WAAW,CAAC,oBAAoB,CAC9C,KAAK,EACL,MAAM,EACN,IAAI,EACJ,MAAM,CACP,CAAC;IACF,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,gBAAS,GAAG,KAAK,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CACF,CAAC;AAEF,SAAwB,IAAI,CAAC,KAAa,EAAE,MAAc;IACxD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,UAAU,GAAG,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1D,MAAM,UAAU,GAAG,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IAE9C,MAAM,eAAe,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC7E,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO,eAAe,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAA,4BAAmB,EAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,aAAa,EACb,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CACP,mEAAmE,CACpE,CAAC;IACF,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC,CAAC;IAEjE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,CAAoC;QACrE;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG;YAC1C,OAAO,EAAE,CAAC;SACX;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG;YAC3C,OAAO,EAAE,CAAC;SACX;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACnD,SAAS,CAAC,cAAc,MAAM,EAAE,CAAC,CAAC;IAElC,OAAO;QACL,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE;QACzB,MAAM;KACP,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}
@@ -0,0 +1,27 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ const naor_reingo_1 = __importDefault(require("../../algorithms/naor-reingo"));
7
+ const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
8
+ const wasm_1 = require("../../shared/testing/wasm");
9
+ describe("Generate pseudo random numbers", () => {
10
+ test.each([1, 2, 5, 10, 15])(`${chalk_1.default.greenBright("%p")}-digit random number\n\tis smaller or equal to its base-10 value * 10`, (digits) => {
11
+ const lowerBound = digits === 1 ? 1 : Math.pow(10, digits - 1);
12
+ const upperBound = Math.pow(10, digits) - 1;
13
+ const actualResult = (0, naor_reingo_1.default)(1, digits)[0];
14
+ const fallbackResult = (0, wasm_1.runWithoutWASM)(() => (0, naor_reingo_1.default)(1, digits)[0]);
15
+ expect(actualResult).toBeGreaterThanOrEqual(lowerBound);
16
+ expect(actualResult).toBeLessThanOrEqual(upperBound);
17
+ expect(fallbackResult).toBeGreaterThanOrEqual(lowerBound);
18
+ expect(fallbackResult).toBeLessThanOrEqual(upperBound);
19
+ });
20
+ test.each([
21
+ [0, 1, "count must be a positive integer."],
22
+ [1, 0, "digits must be a positive integer."],
23
+ ])("keeps the same error with and without WASM for count %p and digits %p", (count, digits, errorMessage) => {
24
+ (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, naor_reingo_1.default)(count, digits), errorMessage);
25
+ });
26
+ });
27
+ //# sourceMappingURL=index.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/naor-reingo/index.test.ts"],"names":[],"mappings":";;;;;AAAA,2EAAkD;AAClD,+DAAuC;AACvC,gDAG+B;AAE/B,QAAQ,CAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAC1B,GAAG,eAAK,CAAC,WAAW,CAClB,IAAI,CACL,uEAAuE,EACxE,CAAC,MAAM,EAAE,EAAE;QACT,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QAE5C,MAAM,YAAY,GAAG,IAAA,qBAAU,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,cAAc,GAAG,IAAA,qBAAc,EAAC,GAAG,EAAE,CAAC,IAAA,qBAAU,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtE,MAAM,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;QACxD,MAAM,CAAC,YAAY,CAAC,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QACrD,MAAM,CAAC,cAAc,CAAC,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;QAC1D,MAAM,CAAC,cAAc,CAAC,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;IACzD,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,CAAC,EAAE,CAAC,EAAE,mCAAmC,CAAC;QAC3C,CAAC,CAAC,EAAE,CAAC,EAAE,oCAAoC,CAAC;KAC7C,CAAC,CACA,uEAAuE,EACvE,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE;QAC9B,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,qBAAU,EAAC,KAAK,EAAE,MAAM,CAAC,EAC/B,YAAY,CACb,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}
@@ -0,0 +1,92 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ exports.default = main;
7
+ exports.prompt = prompt;
8
+ const euclidean_1 = __importDefault(require("../../algorithms/euclidean"));
9
+ const fast_modular_exponentiation_1 = __importDefault(require("../../algorithms/fast-modular-exponentiation"));
10
+ const miller_rabin_primarily_test_1 = __importDefault(require("../../algorithms/miller-rabin-primarily-test"));
11
+ const pollard_rho_1 = __importDefault(require("../../algorithms/pollard-rho"));
12
+ const wasm_1 = require("../../shared/algorithm/wasm");
13
+ const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
14
+ const prompt_1 = require("../../shared/cli/prompt");
15
+ const runWASMPollardP1 = (0, wasm_1.createWASMInvoker)("pollard-p-1-factorization", (wasmExports, input, maxExponent) => {
16
+ if (!wasmExports.pollard_p1_i64 ||
17
+ !(0, wasm_1.fitsInI64)(input) ||
18
+ !Number.isInteger(maxExponent) ||
19
+ maxExponent <= 0) {
20
+ return null;
21
+ }
22
+ const result = wasmExports.pollard_p1_i64(input, maxExponent);
23
+ return result > 1n ? result : null;
24
+ });
25
+ function main(input) {
26
+ const pollardPMinusOne = (n) => {
27
+ const maybeWASMFactor = runWASMPollardP1(n, 2500);
28
+ if (maybeWASMFactor !== null &&
29
+ maybeWASMFactor > 1n &&
30
+ maybeWASMFactor < n) {
31
+ return maybeWASMFactor;
32
+ }
33
+ let base = 2n;
34
+ for (let exponent = 2n; exponent < 2500n; exponent++) {
35
+ base = (0, fast_modular_exponentiation_1.default)(base, exponent, n);
36
+ const factor = (0, euclidean_1.default)(base - 1n, n);
37
+ if (factor > 1n && factor < n) {
38
+ return factor;
39
+ }
40
+ }
41
+ return -1n;
42
+ };
43
+ if (input <= 1n) {
44
+ throw new Error("input must be greater than 1.");
45
+ }
46
+ if ((0, miller_rabin_primarily_test_1.default)(input, 10)) {
47
+ throw new Error(`${input} is prime.`);
48
+ }
49
+ const factors = [];
50
+ const factorize = (n) => {
51
+ if (n === 1n) {
52
+ return;
53
+ }
54
+ if ((0, miller_rabin_primarily_test_1.default)(n, 10)) {
55
+ factors.push(n);
56
+ return;
57
+ }
58
+ let factor = pollardPMinusOne(n);
59
+ if (factor === -1n) {
60
+ factor = (0, pollard_rho_1.default)(n);
61
+ }
62
+ if (factor <= 1n || factor === n) {
63
+ throw new Error(`${n} from ${input} doesn't have prime factors.`);
64
+ }
65
+ factorize(factor);
66
+ factorize(n / factor);
67
+ };
68
+ factorize(input);
69
+ return factors.map((factor) => Number(factor));
70
+ }
71
+ const runPrompt = (0, prompt_1.createAlgorithmPrompt)("pollard-p-1-factorization", async ({ ask, writeLine }) => {
72
+ writeLine("\tFactorize a composite number using Pollard p-1 (with fallback). ");
73
+ writeLine(chalk_1.default.gray("\tinput = 8051 -> factors = [83, 97]"));
74
+ const { input } = await ask([
75
+ {
76
+ type: "number",
77
+ name: "input",
78
+ message: `Enter ${chalk_1.default.italic("composite number")}:`,
79
+ default: 8051,
80
+ },
81
+ ]);
82
+ const result = main(BigInt(input));
83
+ writeLine(`\tFactors = ${result}`);
84
+ return {
85
+ inputs: { input },
86
+ result,
87
+ };
88
+ });
89
+ async function prompt(options) {
90
+ return runPrompt(options);
91
+ }
92
+ //# sourceMappingURL=index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/pollard-p-1-factorization/index.ts"],"names":[],"mappings":";;;;;AA4BA,uBAwDC;AA6BD,wBAEC;AAnHD,uEAA+C;AAC/C,2GAAiF;AACjF,2GAAgF;AAChF,2EAAkD;AAClD,kDAAuE;AACvE,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,gBAAgB,GAAG,IAAA,wBAAiB,EACxC,2BAA2B,EAC3B,CAAC,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE;IAClC,IACE,CAAC,WAAW,CAAC,cAAc;QAC3B,CAAC,IAAA,gBAAS,EAAC,KAAK,CAAC;QACjB,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC;QAC9B,WAAW,IAAI,CAAC,EAChB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,MAAM,GAAG,WAAW,CAAC,cAAc,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IAC9D,OAAO,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AACrC,CAAC,CACF,CAAC;AAEF,SAAwB,IAAI,CAAC,KAAa;IACxC,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,EAAE;QACrC,MAAM,eAAe,GAAG,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClD,IACE,eAAe,KAAK,IAAI;YACxB,eAAe,GAAG,EAAE;YACpB,eAAe,GAAG,CAAC,EACnB,CAAC;YACD,OAAO,eAAe,CAAC;QACzB,CAAC;QAED,IAAI,IAAI,GAAG,EAAE,CAAC;QAEd,KAAK,IAAI,QAAQ,GAAG,EAAE,EAAE,QAAQ,GAAG,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC;YACrD,IAAI,GAAG,IAAA,qCAAyB,EAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;YACpD,MAAM,MAAM,GAAG,IAAA,mBAAS,EAAC,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACvC,IAAI,MAAM,GAAG,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO,CAAC,EAAE,CAAC;IACb,CAAC,CAAC;IAEF,IAAI,KAAK,IAAI,EAAE,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,IAAA,qCAAwB,EAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,YAAY,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE;QAC9B,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QACD,IAAI,IAAA,qCAAwB,EAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;QAED,IAAI,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,MAAM,KAAK,CAAC,EAAE,EAAE,CAAC;YACnB,MAAM,GAAG,IAAA,qBAAU,EAAC,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,KAAK,8BAA8B,CAAC,CAAC;QACpE,CAAC;QAED,SAAS,CAAC,MAAM,CAAC,CAAC;QAClB,SAAS,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IACxB,CAAC,CAAC;IAEF,SAAS,CAAC,KAAK,CAAC,CAAC;IAEjB,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,2BAA2B,EAC3B,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CACP,oEAAoE,CACrE,CAAC;IACF,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC,CAAC;IAE9D,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAoB;QAC7C;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,kBAAkB,CAAC,GAAG;YACrD,OAAO,EAAE,IAAI;SACd;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IACnC,SAAS,CAAC,eAAe,MAAM,EAAE,CAAC,CAAC;IAEnC,OAAO;QACL,MAAM,EAAE,EAAE,KAAK,EAAE;QACjB,MAAM;KACP,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}
@@ -0,0 +1,32 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ const pollard_p_1_factorization_1 = __importDefault(require("../../algorithms/pollard-p-1-factorization"));
7
+ const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
8
+ const wasm_1 = require("../../shared/testing/wasm");
9
+ describe("Factor the given number", () => {
10
+ test.each([
11
+ [273, [3, 7, 13]],
12
+ [9123, [3, 3041]],
13
+ [1403, [23, 61]],
14
+ [8051, [83, 97]],
15
+ [10403, [101, 103]],
16
+ ])(`%p is consist with some factors.\n\tfactors = ${chalk_1.default.greenBright("%p")}`, (input, result) => {
17
+ const execute = () => {
18
+ return (0, pollard_p_1_factorization_1.default)(BigInt(input)).sort((left, right) => {
19
+ return left - right;
20
+ });
21
+ };
22
+ expect(execute()).toEqual([...result].sort((left, right) => left - right));
23
+ (0, wasm_1.expectSameResultWithAndWithoutWASM)(execute);
24
+ });
25
+ test.each([
26
+ [1n, "input must be greater than 1."],
27
+ [101n, "101 is prime."],
28
+ ])("keeps the same error with and without WASM for %p", (input, errorMessage) => {
29
+ (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, pollard_p_1_factorization_1.default)(input), errorMessage);
30
+ });
31
+ });
32
+ //# sourceMappingURL=index.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/pollard-p-1-factorization/index.test.ts"],"names":[],"mappings":";;;;;AAAA,uGAA4E;AAC5E,+DAAuC;AACvC,gDAG+B;AAE/B,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACjB,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACjB,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChB,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChB,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KACpB,CAAC,CACA,iDAAiD,eAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAC1E,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;QAChB,MAAM,OAAO,GAAG,GAAG,EAAE;YACnB,OAAO,IAAA,mCAAsB,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;gBAChE,OAAO,IAAI,GAAG,KAAK,CAAC;YACtB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CACvB,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAChD,CAAC;QACF,IAAA,yCAAkC,EAAC,OAAO,CAAC,CAAC;IAC9C,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,EAAE,EAAE,+BAA+B,CAAC;QACrC,CAAC,IAAI,EAAE,eAAe,CAAC;KACxB,CAAC,CACA,mDAAmD,EACnD,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE;QACtB,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,mCAAsB,EAAC,KAAK,CAAC,EACnC,YAAY,CACb,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}
@@ -0,0 +1,82 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ exports.default = main;
7
+ exports.prompt = prompt;
8
+ const euclidean_1 = __importDefault(require("../../algorithms/euclidean"));
9
+ const math_1 = require("../../shared/algorithm/math");
10
+ const random_1 = require("../../shared/algorithm/random");
11
+ const wasm_1 = require("../../shared/algorithm/wasm");
12
+ const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
13
+ const prompt_1 = require("../../shared/cli/prompt");
14
+ const runWASMPollardRho = (0, wasm_1.createWASMInvoker)("pollard-rho", (wasmExports, input, seed, c, maxIterations) => {
15
+ if (!wasmExports.pollard_rho_i64 ||
16
+ !(0, wasm_1.fitsInI64)(input) ||
17
+ !(0, wasm_1.fitsInI64)(seed) ||
18
+ !(0, wasm_1.fitsInI64)(c) ||
19
+ !Number.isInteger(maxIterations) ||
20
+ maxIterations <= 0) {
21
+ return null;
22
+ }
23
+ return wasmExports.pollard_rho_i64(input, seed, c, maxIterations);
24
+ });
25
+ function main(input) {
26
+ if (input <= 1n) {
27
+ throw new Error("input must be greater than 1.");
28
+ }
29
+ if ((input & 1n) === 0n) {
30
+ return 2n;
31
+ }
32
+ const f = (x, c) => (x * x + c) % input;
33
+ for (let attempt = 0; attempt < 10; attempt++) {
34
+ const c = (0, random_1.randomBigIntBetween)(1n, input - 1n);
35
+ let x = (0, random_1.randomBigIntBetween)(2n, input - 1n);
36
+ const maybeWASMFactor = runWASMPollardRho(input, x, c, 100_000);
37
+ if (maybeWASMFactor !== null &&
38
+ maybeWASMFactor > 1n &&
39
+ maybeWASMFactor < input &&
40
+ input % maybeWASMFactor === 0n) {
41
+ return maybeWASMFactor;
42
+ }
43
+ let y = x;
44
+ let divisor = 1n;
45
+ let iterations = 0;
46
+ while (divisor === 1n) {
47
+ x = f(x, c);
48
+ y = f(f(y, c), c);
49
+ divisor = (0, euclidean_1.default)(math_1.math.absolute(x - y), input);
50
+ iterations += 1;
51
+ if (iterations > 100_000) {
52
+ divisor = input;
53
+ }
54
+ }
55
+ if (divisor !== input) {
56
+ return divisor;
57
+ }
58
+ }
59
+ return 1n;
60
+ }
61
+ const runPrompt = (0, prompt_1.createAlgorithmPrompt)("pollard-rho", async ({ ask, writeLine }) => {
62
+ writeLine("\tFactorize a composite number using Pollard rho.");
63
+ writeLine(chalk_1.default.gray("\tinput = 8051 -> factor = 83 or 97"));
64
+ const { input } = await ask([
65
+ {
66
+ type: "number",
67
+ name: "input",
68
+ message: `Enter ${chalk_1.default.italic("composite number")}:`,
69
+ default: 8051,
70
+ },
71
+ ]);
72
+ const result = main(BigInt(input));
73
+ writeLine(`\tFactor = ${result}`);
74
+ return {
75
+ inputs: { input },
76
+ result,
77
+ };
78
+ });
79
+ async function prompt(options) {
80
+ return runPrompt(options);
81
+ }
82
+ //# sourceMappingURL=index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/pollard-rho/index.ts"],"names":[],"mappings":";;;;;AA4BA,uBA6CC;AA2BD,wBAEC;AAtGD,uEAA+C;AAC/C,kDAA+C;AAC/C,sDAAgE;AAChE,kDAAuE;AACvE,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,iBAAiB,GAAG,IAAA,wBAAiB,EAGzC,aAAa,EAAE,CAAC,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,aAAa,EAAE,EAAE;IAC9D,IACE,CAAC,WAAW,CAAC,eAAe;QAC5B,CAAC,IAAA,gBAAS,EAAC,KAAK,CAAC;QACjB,CAAC,IAAA,gBAAS,EAAC,IAAI,CAAC;QAChB,CAAC,IAAA,gBAAS,EAAC,CAAC,CAAC;QACb,CAAC,MAAM,CAAC,SAAS,CAAC,aAAa,CAAC;QAChC,aAAa,IAAI,CAAC,EAClB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,WAAW,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,SAAwB,IAAI,CAAC,KAAa;IACxC,IAAI,KAAK,IAAI,EAAE,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;IAExD,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,IAAA,4BAAmB,EAAC,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,GAAG,IAAA,4BAAmB,EAAC,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC;QAE5C,MAAM,eAAe,GAAG,iBAAiB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;QAChE,IACE,eAAe,KAAK,IAAI;YACxB,eAAe,GAAG,EAAE;YACpB,eAAe,GAAG,KAAK;YACvB,KAAK,GAAG,eAAe,KAAK,EAAE,EAC9B,CAAC;YACD,OAAO,eAAe,CAAC;QACzB,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,OAAO,OAAO,KAAK,EAAE,EAAE,CAAC;YACtB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACZ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,OAAO,GAAG,IAAA,mBAAS,EAAC,WAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACjD,UAAU,IAAI,CAAC,CAAC;YAEhB,IAAI,UAAU,GAAG,OAAO,EAAE,CAAC;gBACzB,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;QACH,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;YACtB,OAAO,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,aAAa,EACb,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,mDAAmD,CAAC,CAAC;IAC/D,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC,CAAC;IAE7D,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAoB;QAC7C;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,kBAAkB,CAAC,GAAG;YACrD,OAAO,EAAE,IAAI;SACd;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IACnC,SAAS,CAAC,cAAc,MAAM,EAAE,CAAC,CAAC;IAElC,OAAO;QACL,MAAM,EAAE,EAAE,KAAK,EAAE;QACjB,MAAM;KACP,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}
@@ -0,0 +1,26 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ const pollard_rho_1 = __importDefault(require("../../algorithms/pollard-rho"));
7
+ const wasm_1 = require("../../shared/testing/wasm");
8
+ describe("Finding the factor for the given input", () => {
9
+ test.each([
10
+ 361187n,
11
+ 29996224275867n,
12
+ 7n ** 5n,
13
+ 732564058083n * 605789375811n,
14
+ ])(`%p has a non-trivial factor`, (input) => {
15
+ const actualFactor = (0, pollard_rho_1.default)(input);
16
+ const fallbackFactor = (0, wasm_1.runWithoutWASM)(() => (0, pollard_rho_1.default)(input));
17
+ expect(actualFactor > 1n).toBeTruthy();
18
+ expect(input % actualFactor).toEqual(0n);
19
+ expect(fallbackFactor > 1n).toBeTruthy();
20
+ expect(input % fallbackFactor).toEqual(0n);
21
+ });
22
+ test("keeps the same error with and without WASM for invalid input", () => {
23
+ (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, pollard_rho_1.default)(1n), "input must be greater than 1.");
24
+ });
25
+ });
26
+ //# sourceMappingURL=index.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/pollard-rho/index.test.ts"],"names":[],"mappings":";;;;;AAAA,2EAAkD;AAClD,gDAG+B;AAE/B,QAAQ,CAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAI,CAAC,IAAI,CAAC;QACR,OAAO;QACP,eAAe;QACf,EAAE,IAAI,EAAE;QACR,aAAa,GAAG,aAAa;KAC9B,CAAC,CAAC,6BAA6B,EAAE,CAAC,KAAK,EAAE,EAAE;QAC1C,MAAM,YAAY,GAAG,IAAA,qBAAU,EAAC,KAAK,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,IAAA,qBAAc,EAAC,GAAG,EAAE,CAAC,IAAA,qBAAU,EAAC,KAAK,CAAC,CAAC,CAAC;QAE/D,MAAM,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC;QACvC,MAAM,CAAC,KAAK,GAAG,YAAY,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,cAAc,GAAG,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC;QACzC,MAAM,CAAC,KAAK,GAAG,cAAc,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACxE,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,qBAAU,EAAC,EAAE,CAAC,EACpB,+BAA+B,CAChC,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,95 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ exports.default = main;
7
+ exports.prompt = prompt;
8
+ const fast_modular_exponentiation_1 = __importDefault(require("../../algorithms/fast-modular-exponentiation"));
9
+ const miller_rabin_primarily_test_1 = __importDefault(require("../../algorithms/miller-rabin-primarily-test"));
10
+ const wasm_1 = require("../../shared/algorithm/wasm");
11
+ const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
12
+ const prompt_1 = require("../../shared/cli/prompt");
13
+ const runWASMPrimitiveRoots = (0, wasm_1.createWASMInvoker)("primitive-root-search", (wasmExports, prime) => {
14
+ if (!wasmExports.primitive_root_search_i64 ||
15
+ prime <= 2n ||
16
+ !(0, wasm_1.fitsInI64)(prime)) {
17
+ return null;
18
+ }
19
+ const maxRoots = Number(prime - 1n);
20
+ if (!Number.isFinite(maxRoots) || maxRoots <= 0 || maxRoots > 10_000) {
21
+ return null;
22
+ }
23
+ const allocator = (0, wasm_1.createI64Allocator)(wasmExports);
24
+ allocator.reset();
25
+ const rootsPtr = allocator.allocate(maxRoots * wasm_1.I64_BYTES);
26
+ const view = allocator.view();
27
+ if (rootsPtr === null || !view) {
28
+ return null;
29
+ }
30
+ const count = wasmExports.primitive_root_search_i64(prime, rootsPtr, maxRoots);
31
+ const result = [];
32
+ const limit = Math.min(count, maxRoots);
33
+ for (let index = 0; index < limit; index++) {
34
+ result.push(view[rootsPtr / wasm_1.I64_BYTES + index]);
35
+ }
36
+ return result;
37
+ });
38
+ function main(prime) {
39
+ if (!(0, miller_rabin_primarily_test_1.default)(BigInt(prime), 10))
40
+ throw new Error("The Given number must be prime.");
41
+ const phi = prime - 1;
42
+ const table = Array.from({ length: phi }, () => Array.from({ length: phi }, () => 0));
43
+ const arrayOfResult = [];
44
+ const maybeWASMRoots = runWASMPrimitiveRoots(BigInt(prime));
45
+ if (maybeWASMRoots !== null) {
46
+ for (const root of maybeWASMRoots) {
47
+ arrayOfResult.push(Number(root));
48
+ }
49
+ for (let indexRow = 0; indexRow < table.length; indexRow++) {
50
+ for (let indexColumn = 0; indexColumn < table[0].length; indexColumn++) {
51
+ const exponent = (0, fast_modular_exponentiation_1.default)(BigInt(indexRow + 1), BigInt(indexColumn + 1), BigInt(prime));
52
+ table[indexRow][indexColumn] = Number(exponent);
53
+ }
54
+ }
55
+ return [table, arrayOfResult];
56
+ }
57
+ for (let indexRow = 0; indexRow < table.length; indexRow++) {
58
+ const set = new Set();
59
+ let isPrimitiveRoot = true;
60
+ for (let indexColumn = 0; indexColumn < table[0].length; indexColumn++) {
61
+ const exponent = (0, fast_modular_exponentiation_1.default)(BigInt(indexRow + 1), BigInt(indexColumn + 1), BigInt(prime));
62
+ const index = Number(exponent);
63
+ table[indexRow][indexColumn] = index;
64
+ if (set.has(index)) {
65
+ isPrimitiveRoot = false;
66
+ }
67
+ set.add(index);
68
+ }
69
+ if (isPrimitiveRoot)
70
+ arrayOfResult.push(indexRow + 1);
71
+ }
72
+ return [table, arrayOfResult];
73
+ }
74
+ const runPrompt = (0, prompt_1.createAlgorithmPrompt)("primitive-root-search", async ({ ask, writeLine }) => {
75
+ writeLine("\tprimitive roots for x = y1, y2, y3...");
76
+ writeLine(chalk_1.default.gray("\tprimitive roots for 23 = 5, 7, 10, 11, 14, 15, 17, 19, 20, 21"));
77
+ const { prime } = await ask([
78
+ {
79
+ type: "number",
80
+ name: "prime",
81
+ message: `Enter ${chalk_1.default.italic("prime")}:`,
82
+ default: 7,
83
+ },
84
+ ]);
85
+ const result = main(prime);
86
+ writeLine(`primitive roots for ${prime} = ${result[1].sort()}`);
87
+ return {
88
+ inputs: { prime },
89
+ result,
90
+ };
91
+ });
92
+ async function prompt(options) {
93
+ return runPrompt(options);
94
+ }
95
+ //# sourceMappingURL=index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/primitive-root-search/index.ts"],"names":[],"mappings":";;;;;AAsDA,uBAqDC;AA+BD,wBAEC;AA5ID,2GAAiF;AACjF,2GAAgF;AAChF,kDAKiC;AACjC,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,qBAAqB,GAAG,IAAA,wBAAiB,EAC7C,uBAAuB,EACvB,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE;IACrB,IACE,CAAC,WAAW,CAAC,yBAAyB;QACtC,KAAK,IAAI,EAAE;QACX,CAAC,IAAA,gBAAS,EAAC,KAAK,CAAC,EACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;IACpC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;QACrE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAA,yBAAkB,EAAC,WAAW,CAAC,CAAC;IAClD,SAAS,CAAC,KAAK,EAAE,CAAC;IAElB,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,QAAQ,GAAG,gBAAS,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;IAC9B,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,yBAAyB,CACjD,KAAK,EACL,QAAQ,EACR,QAAQ,CACT,CAAC;IACF,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACxC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,gBAAS,GAAG,KAAK,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CACF,CAAC;AAEF,SAAwB,IAAI,CAAC,KAAa;IACxC,IAAI,CAAC,IAAA,qCAAwB,EAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IAErD,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;IACtB,MAAM,KAAK,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,CACzD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CACrC,CAAC;IAEF,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,MAAM,cAAc,GAAG,qBAAqB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5D,IAAI,cAAc,KAAK,IAAI,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;YAClC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACnC,CAAC;QAED,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;YAC3D,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;gBACvE,MAAM,QAAQ,GAAG,IAAA,qCAAyB,EACxC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,EACpB,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,EACvB,MAAM,CAAC,KAAK,CAAC,CACd,CAAC;gBACF,KAAK,CAAC,QAAQ,CAAC,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAED,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;QAC3D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,IAAI,eAAe,GAAG,IAAI,CAAC;QAC3B,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;YACvE,MAAM,QAAQ,GAAG,IAAA,qCAAyB,EACxC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,EACpB,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,EACvB,MAAM,CAAC,KAAK,CAAC,CACd,CAAC;YACF,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC/B,KAAK,CAAC,QAAQ,CAAC,CAAC,WAAW,CAAC,GAAG,KAAK,CAAC;YAErC,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnB,eAAe,GAAG,KAAK,CAAC;YAC1B,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACjB,CAAC;QAED,IAAI,eAAe;YAAE,aAAa,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,uBAAuB,EACvB,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,yCAAyC,CAAC,CAAC;IACrD,SAAS,CACP,eAAK,CAAC,IAAI,CACR,iEAAiE,CAClE,CACF,CAAC;IAEF,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAoB;QAC7C;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG;YAC1C,OAAO,EAAE,CAAC;SACX;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,SAAS,CAAC,uBAAuB,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAEhE,OAAO;QACL,MAAM,EAAE,EAAE,KAAK,EAAE;QACjB,MAAM;KACP,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}
@@ -0,0 +1,46 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ const primitive_root_search_1 = __importDefault(require("../../algorithms/primitive-root-search"));
7
+ const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
8
+ const wasm_1 = require("../../shared/testing/wasm");
9
+ describe("Finding the Primitive Roots of the given numbers", () => {
10
+ test.each([
11
+ [23, [5, 7, 10, 11, 14, 15, 17, 19, 20, 21]],
12
+ [
13
+ 131,
14
+ [
15
+ 2, 6, 8, 10, 14, 17, 22, 23, 26, 29, 30, 31, 37, 40, 50, 54, 56, 57, 66,
16
+ 67, 72, 76, 82, 83, 85, 87, 88, 90, 93, 95, 96, 97, 98, 103, 104, 106,
17
+ 110, 111, 115, 116, 118, 119, 120, 122, 124, 126, 127, 128,
18
+ ],
19
+ ],
20
+ [
21
+ 47,
22
+ [
23
+ 5, 10, 11, 13, 15, 19, 20, 22, 23, 26, 29, 30, 31, 33, 35, 38, 39, 40,
24
+ 41, 43, 44, 45,
25
+ ],
26
+ ],
27
+ [13, [2, 6, 7, 11]],
28
+ [
29
+ 71,
30
+ [
31
+ 7, 11, 13, 21, 22, 28, 31, 33, 35, 42, 44, 47, 52, 53, 55, 56, 59, 61,
32
+ 62, 63, 65, 67, 68, 69,
33
+ ],
34
+ ],
35
+ ])(`%p has some primitive roots.\n\tprimitive roots = ${chalk_1.default.greenBright("%p")}`, (input, result) => {
36
+ const execute = () => {
37
+ return (0, primitive_root_search_1.default)(input)[1].sort((left, right) => left - right);
38
+ };
39
+ expect(execute()).toEqual([...result].sort((left, right) => left - right));
40
+ (0, wasm_1.expectSameResultWithAndWithoutWASM)(execute);
41
+ });
42
+ test("keeps the same error with and without WASM for non-prime input", () => {
43
+ (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, primitive_root_search_1.default)(21), "The Given number must be prime.");
44
+ });
45
+ });
46
+ //# sourceMappingURL=index.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/primitive-root-search/index.test.ts"],"names":[],"mappings":";;;;;AAAA,+FAAqE;AACrE,+DAAuC;AACvC,gDAG+B;AAE/B,QAAQ,CAAC,kDAAkD,EAAE,GAAG,EAAE;IAChE,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5C;YACE,GAAG;YACH;gBACE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;gBACvE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;gBACrE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;aAC3D;SACF;QACD;YACE,EAAE;YACF;gBACE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;gBACrE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;aACf;SACF;QACD,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACnB;YACE,EAAE;YACF;gBACE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;gBACrE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;aACvB;SACF;KACF,CAAC,CACA,qDAAqD,eAAK,CAAC,WAAW,CACpE,IAAI,CACL,EAAE,EACH,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;QAChB,MAAM,OAAO,GAAG,GAAG,EAAE;YACnB,OAAO,IAAA,+BAAmB,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CACvC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAC9B,CAAC;QACJ,CAAC,CAAC;QAEF,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CACvB,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAChD,CAAC;QACF,IAAA,yCAAkC,EAAC,OAAO,CAAC,CAAC;IAC9C,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,gEAAgE,EAAE,GAAG,EAAE;QAC1E,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,+BAAmB,EAAC,EAAE,CAAC,EAC7B,iCAAiC,CAClC,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,79 @@
1
+ "use strict";
2
+ var __importDefault = (this && this.__importDefault) || function (mod) {
3
+ return (mod && mod.__esModule) ? mod : { "default": mod };
4
+ };
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ exports.runCLI = runCLI;
7
+ const path_1 = require("path");
8
+ const chalk_1 = __importDefault(require("./shared/cli/chalk"));
9
+ const inquirer_1 = require("./shared/cli/inquirer");
10
+ const utilities_1 = require("./shared/cli/utilities");
11
+ const constants_1 = require("./shared/constants");
12
+ async function promptPurpose(message) {
13
+ const inquirer = await (0, inquirer_1.getInquirer)();
14
+ const { _: purpose } = await inquirer.prompt([
15
+ {
16
+ type: "rawlist",
17
+ name: "_",
18
+ message,
19
+ choices: [
20
+ { name: constants_1.CHOICES.DEMONSTRATE, value: constants_1.CHOICES.DEMONSTRATE },
21
+ { name: constants_1.CHOICES.EXECUTE, value: constants_1.CHOICES.EXECUTE },
22
+ { name: constants_1.CHOICES.EXIT, value: constants_1.CHOICES.EXIT },
23
+ ],
24
+ },
25
+ ]);
26
+ return purpose;
27
+ }
28
+ function isAutomatedRun(options) {
29
+ return (options.procedure !== undefined ||
30
+ options.promptOptions !== undefined ||
31
+ options.purpose !== undefined ||
32
+ options.restartable !== undefined);
33
+ }
34
+ async function runCLI(options = {}) {
35
+ const message = options.message ?? "What do you want to do?";
36
+ const isAutomated = isAutomatedRun(options);
37
+ try {
38
+ const purpose = options.purpose ?? (await promptPurpose(message));
39
+ switch (purpose) {
40
+ case constants_1.CHOICES.DEMONSTRATE:
41
+ await utilities_1.inquire.procedure((0, path_1.join)(__dirname, "key-encryptions"), "Which cryptograph procedure do you want to demonstrate?", utilities_1.format.filename, {
42
+ promptOptions: options.promptOptions,
43
+ restartable: options.restartable,
44
+ selection: options.procedure,
45
+ });
46
+ if (!isAutomated) {
47
+ await runCLI();
48
+ }
49
+ break;
50
+ case constants_1.CHOICES.EXECUTE:
51
+ await utilities_1.inquire.procedure((0, path_1.join)(__dirname, "algorithms"), "Which cryptograph algorithm do you want to execute?", utilities_1.format.foldername, {
52
+ promptOptions: options.promptOptions,
53
+ restartable: options.restartable,
54
+ selection: options.procedure,
55
+ });
56
+ if (!isAutomated) {
57
+ await runCLI();
58
+ }
59
+ break;
60
+ case constants_1.CHOICES.EXIT:
61
+ console.log(chalk_1.default.gray("Successfully terminated the program.\n"));
62
+ break;
63
+ default:
64
+ throw new Error("Something wrong with the prompt flow.");
65
+ }
66
+ }
67
+ catch (_) {
68
+ const error = _;
69
+ console.error(`\t${chalk_1.default.red(error.message)}`);
70
+ if (isAutomated) {
71
+ throw error;
72
+ }
73
+ await runCLI({ message: "Unexpected result. Please restart your flow." });
74
+ }
75
+ }
76
+ if (require.main === module) {
77
+ void runCLI();
78
+ }
79
+ //# sourceMappingURL=command.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"command.js","sourceRoot":"","sources":["../source/command.ts"],"names":[],"mappings":";;;;;AA+CA,wBAsDC;AArGD,+BAA4B;AAE5B,+DAAuC;AACvC,oDAAoD;AAEpD,sDAAyD;AACzD,kDAA6C;AAY7C,KAAK,UAAU,aAAa,CAAC,OAAe;IAC1C,MAAM,QAAQ,GAAG,MAAM,IAAA,sBAAW,GAAE,CAAC;IACrC,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,MAAM,CAEzC;QACD;YACE,IAAI,EAAE,SAAS;YACf,IAAI,EAAE,GAAG;YACT,OAAO;YACP,OAAO,EAAE;gBACP,EAAE,IAAI,EAAE,mBAAO,CAAC,WAAW,EAAE,KAAK,EAAE,mBAAO,CAAC,WAAW,EAAE;gBACzD,EAAE,IAAI,EAAE,mBAAO,CAAC,OAAO,EAAE,KAAK,EAAE,mBAAO,CAAC,OAAO,EAAE;gBACjD,EAAE,IAAI,EAAE,mBAAO,CAAC,IAAI,EAAE,KAAK,EAAE,mBAAO,CAAC,IAAI,EAAE;aAC5C;SACF;KACF,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,cAAc,CAAC,OAAwB;IAC9C,OAAO,CACL,OAAO,CAAC,SAAS,KAAK,SAAS;QAC/B,OAAO,CAAC,aAAa,KAAK,SAAS;QACnC,OAAO,CAAC,OAAO,KAAK,SAAS;QAC7B,OAAO,CAAC,WAAW,KAAK,SAAS,CAClC,CAAC;AACJ,CAAC;AAEM,KAAK,UAAU,MAAM,CAAC,UAA2B,EAAE;IACxD,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,yBAAyB,CAAC;IAC7D,MAAM,WAAW,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IAE5C,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,MAAM,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;QAElE,QAAQ,OAAO,EAAE,CAAC;YAChB,KAAK,mBAAO,CAAC,WAAW;gBACtB,MAAM,mBAAO,CAAC,SAAS,CACrB,IAAA,WAAI,EAAC,SAAS,EAAE,iBAAiB,CAAC,EAClC,yDAAyD,EACzD,kBAAM,CAAC,QAAQ,EACf;oBACE,aAAa,EAAE,OAAO,CAAC,aAAa;oBACpC,WAAW,EAAE,OAAO,CAAC,WAAW;oBAChC,SAAS,EAAE,OAAO,CAAC,SAAS;iBAC7B,CACF,CAAC;gBACF,IAAI,CAAC,WAAW,EAAE,CAAC;oBACjB,MAAM,MAAM,EAAE,CAAC;gBACjB,CAAC;gBACD,MAAM;YACR,KAAK,mBAAO,CAAC,OAAO;gBAClB,MAAM,mBAAO,CAAC,SAAS,CACrB,IAAA,WAAI,EAAC,SAAS,EAAE,YAAY,CAAC,EAC7B,qDAAqD,EACrD,kBAAM,CAAC,UAAU,EACjB;oBACE,aAAa,EAAE,OAAO,CAAC,aAAa;oBACpC,WAAW,EAAE,OAAO,CAAC,WAAW;oBAChC,SAAS,EAAE,OAAO,CAAC,SAAS;iBAC7B,CACF,CAAC;gBACF,IAAI,CAAC,WAAW,EAAE,CAAC;oBACjB,MAAM,MAAM,EAAE,CAAC;gBACjB,CAAC;gBACD,MAAM;YACR,KAAK,mBAAO,CAAC,IAAI;gBACf,OAAO,CAAC,GAAG,CAAC,eAAK,CAAC,IAAI,CAAC,wCAAwC,CAAC,CAAC,CAAC;gBAClE,MAAM;YACR;gBACE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,KAAK,GAAU,CAAU,CAAC;QAChC,OAAO,CAAC,KAAK,CAAC,KAAK,eAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAE/C,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,KAAK,CAAC;QACd,CAAC;QAED,MAAM,MAAM,CAAC,EAAE,OAAO,EAAE,8CAA8C,EAAE,CAAC,CAAC;IAC5E,CAAC;AACH,CAAC;AAED,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;IAC5B,KAAK,MAAM,EAAE,CAAC;AAChB,CAAC"}