|
@@ -0,0 +1,132 @@
|
|
|
+/**
|
|
|
+ * @author n1474335 [n1474335@gmail.com]
|
|
|
+ * @copyright Crown Copyright 2016
|
|
|
+ * @license Apache-2.0
|
|
|
+ */
|
|
|
+
|
|
|
+import Operation from "../Operation";
|
|
|
+import Utils from "../Utils";
|
|
|
+import { bitOp, xor } from "../lib/BitwiseOp";
|
|
|
+import { toHex } from "../lib/Hex";
|
|
|
+
|
|
|
+/**
|
|
|
+ * XOR Brute Force operation
|
|
|
+ */
|
|
|
+class XORBruteForce extends Operation {
|
|
|
+
|
|
|
+ /**
|
|
|
+ * XORBruteForce constructor
|
|
|
+ */
|
|
|
+ constructor() {
|
|
|
+ super();
|
|
|
+
|
|
|
+ this.name = "XOR Brute Force";
|
|
|
+ this.module = "Default";
|
|
|
+ this.description = "Enumerate all possible XOR solutions. Current maximum key length is 2 due to browser performance.<br><br>Optionally enter a string that you expect to find in the plaintext to filter results (crib).";
|
|
|
+ this.inputType = "byteArray";
|
|
|
+ this.outputType = "string";
|
|
|
+ this.args = [
|
|
|
+ {
|
|
|
+ "name": "Key length",
|
|
|
+ "type": "number",
|
|
|
+ "value": 1
|
|
|
+ },
|
|
|
+ {
|
|
|
+ "name": "Sample length",
|
|
|
+ "type": "number",
|
|
|
+ "value": 100
|
|
|
+ },
|
|
|
+ {
|
|
|
+ "name": "Sample offset",
|
|
|
+ "type": "number",
|
|
|
+ "value": 0
|
|
|
+ },
|
|
|
+ {
|
|
|
+ "name": "Scheme",
|
|
|
+ "type": "option",
|
|
|
+ "value": ["Standard", "Input differential", "Output differential"]
|
|
|
+ },
|
|
|
+ {
|
|
|
+ "name": "Null preserving",
|
|
|
+ "type": "boolean",
|
|
|
+ "value": false
|
|
|
+ },
|
|
|
+ {
|
|
|
+ "name": "Print key",
|
|
|
+ "type": "boolean",
|
|
|
+ "value": true
|
|
|
+ },
|
|
|
+ {
|
|
|
+ "name": "Output as hex",
|
|
|
+ "type": "boolean",
|
|
|
+ "value": false
|
|
|
+ },
|
|
|
+ {
|
|
|
+ "name": "Crib (known plaintext string)",
|
|
|
+ "type": "binaryString",
|
|
|
+ "value": ""
|
|
|
+ }
|
|
|
+ ];
|
|
|
+ }
|
|
|
+
|
|
|
+ /**
|
|
|
+ * @param {byteArray} input
|
|
|
+ * @param {Object[]} args
|
|
|
+ * @returns {string}
|
|
|
+ */
|
|
|
+ run(input, args) {
|
|
|
+ const [keyLength, sampleLength, sampleOffset, scheme, nullPreserving, printKey, outputHex, /* ignore element */] = args, //eslint-disable-line array-bracket-spacing
|
|
|
+ crib = args[7].toLowerCase();
|
|
|
+
|
|
|
+ const output = [];
|
|
|
+ let result,
|
|
|
+ resultUtf8,
|
|
|
+ record = "";
|
|
|
+
|
|
|
+ input = input.slice(sampleOffset, sampleOffset + sampleLength);
|
|
|
+
|
|
|
+ if (ENVIRONMENT_IS_WORKER())
|
|
|
+ self.sendStatusMessage("Calculating " + Math.pow(256, keyLength) + " values...");
|
|
|
+
|
|
|
+ /**
|
|
|
+ * Converts an integer to an array of bytes expressing that number.
|
|
|
+ *
|
|
|
+ * @param {number} int
|
|
|
+ * @param {number} len - Length of the resulting array
|
|
|
+ * @returns {array}
|
|
|
+ */
|
|
|
+ const intToByteArray = (int, len) => {
|
|
|
+ const res = Array(len).fill(0);
|
|
|
+ for (let i = len - 1; i >= 0; i--) {
|
|
|
+ res[i] = int & 0xff;
|
|
|
+ int = int >>> 8;
|
|
|
+ }
|
|
|
+ return res;
|
|
|
+ };
|
|
|
+
|
|
|
+ for (let key = 1, l = Math.pow(256, keyLength); key < l; key++) {
|
|
|
+ if (key % 10000 === 0 && ENVIRONMENT_IS_WORKER()) {
|
|
|
+ self.sendStatusMessage("Calculating " + l + " values... " + Math.floor(key / l * 100) + "%");
|
|
|
+ }
|
|
|
+
|
|
|
+ result = bitOp(input, intToByteArray(key, keyLength), xor, nullPreserving, scheme);
|
|
|
+ resultUtf8 = Utils.byteArrayToUtf8(result);
|
|
|
+ record = "";
|
|
|
+
|
|
|
+ if (crib && resultUtf8.toLowerCase().indexOf(crib) < 0) continue;
|
|
|
+ if (printKey) record += "Key = " + Utils.hex(key, (2*keyLength)) + ": ";
|
|
|
+ if (outputHex) {
|
|
|
+ record += toHex(result);
|
|
|
+ } else {
|
|
|
+ record += Utils.printable(resultUtf8, false);
|
|
|
+ }
|
|
|
+
|
|
|
+ output.push(record);
|
|
|
+ }
|
|
|
+
|
|
|
+ return output.join("\n");
|
|
|
+ }
|
|
|
+
|
|
|
+}
|
|
|
+
|
|
|
+export default XORBruteForce;
|