cyberchef 10.22.1 → 10.24.0

package/src/core/lib/BigIntUtils.mjs

@@ -0,0 +1,73 @@
+/**
+ * @author p-leriche [philip.leriche@cantab.net]
+ * @copyright Crown Copyright 2025
+ * @license Apache-2.0
+ */
+
+import OperationError from "../errors/OperationError.mjs";
+
+/**
+ * Number theory utilities used by cryptographic operations.
+ *
+ * Currently provides:
+ *   - parseBigInt
+ *   - Extended Euclidean Algorithm
+ *   - Modular Exponentiation
+ *
+ * Additional algorithms may be added as required.
+ */
+
+/**
+ * parseBigInt helper operation
+ */
+export function parseBigInt(value, param) {
+    const v = (value ?? "").trim();
+    if (/^0x[0-9a-f]+$/i.test(v)) return BigInt(v);
+    if (/^[+-]?[0-9]+$/.test(v)) return BigInt(v);
+    throw new OperationError(param + " must be decimal or hex (0x...)");
+}
+
+/**
+ * Extended Euclidean Algorithm
+ *
+ * Returns [g, x, y] such that:
+ *   a*x + b*y = g = gcd(a, b)
+ *
+ *   (Uses an iterative algorithm to avoid possible stack overflow)
+ */
+export function egcd(a, b) {
+    let oldR = a, r = b;
+    let oldS = 1n, s = 0n;
+    let oldT = 0n, t = 1n;
+
+    while (r !== 0n) {
+        const quotient = oldR / r;
+
+        [oldR, r] = [r, oldR - quotient * r];
+        [oldS, s] = [s, oldS - quotient * s];
+        [oldT, t] = [t, oldT - quotient * t];
+    }
+
+    // oldR is the gcd
+    // oldS and oldT are the Bézout coefficients
+    return [oldR, oldS, oldT];
+}
+
+/**
+ * Modular exponentiation
+ */
+export function modPow(base, exponent, modulus) {
+    let result = 1n;
+    base %= modulus;
+
+    while (exponent > 0n) {
+        if (exponent & 1n) {
+            result = (result * base) % modulus;
+        }
+        base = (base * base) % modulus;
+        exponent >>= 1n;
+    }
+
+    return result;
+}
+

package/src/core/lib/Extract.mjs

@@ -45,6 +45,11 @@ export function search(input, searchRegex, removeRegex=null, sortBy=null, unique
     return results;
 }
 
+/**
+ * Email regular expression
+ */
+export const EMAIL_REGEX = /(?:[\u00A0-\uD7FF\uE000-\uFFFFa-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\.[\u00A0-\uD7FF\uE000-\uFFFFa-z0-9!#$%&'*+/=?^_`{|}~-]+)*|"(?:[\x01-\x08\x0b\x0c\x0e-\x1f\x21\x23-\x5b\x5d-\x7f]|\\[\x01-\x09\x0b\x0c\x0e-\x7f])*")@(?:(?:[\u00A0-\uD7FF\uE000-\uFFFFa-z0-9](?:[\u00A0-\uD7FF\uE000-\uFFFFa-z0-9-]*[\u00A0-\uD7FF\uE000-\uFFFFa-z0-9])?\.)+[\u00A0-\uD7FF\uE000-\uFFFFa-z0-9](?:[\u00A0-\uD7FF\uE000-\uFFFFa-z0-9-]*[\u00A0-\uD7FF\uE000-\uFFFFa-z0-9])?|\[(?:(?:(2(5[0-5]|[0-4][0-9])|1[0-9][0-9]|[1-9]?[0-9]))\.){3}(?:(2(5[0-5]|[0-4][0-9])|1[0-9][0-9]|[1-9]?[0-9]))\])/ig;
+
 
 /**
  * URL regular expression

package/src/core/lib/Modhex.mjs

@@ -50,6 +50,7 @@ const HEX_ALPHABET_MAP = HEX_ALPHABET.split("");
 export function toModhex(data, delim=" ", padding=2, extraDelim="", lineSize=0) {
     if (!data) return "";
     if (data instanceof ArrayBuffer) data = new Uint8Array(data);
+    if (data.length === 0) return "";
 
     const regularHexString = toHex(data, "", padding, "", 0);
 
@@ -100,6 +101,7 @@ export function toModhex(data, delim=" ", padding=2, extraDelim="", lineSize=0)
 export function toModhexFast(data) {
     if (!data) return "";
     if (data instanceof ArrayBuffer) data = new Uint8Array(data);
+    if (data.length === 0) return "";
 
     const output = [];
 

package/src/core/lib/ParityBit.mjs

@@ -0,0 +1,50 @@
+/**
+ * Parity Bit functions.
+ *
+ * @author j83305 [awz22@protonmail.com]
+ * @copyright Crown Copyright 2020
+ * @license Apache-2.0
+ *
+ */
+
+import OperationError from "../errors/OperationError.mjs";
+
+/**
+ * Function to take the user input and encode using the given arguments
+ * @param input string of binary
+ * @param args array
+ */
+export function calculateParityBit(input, args) {
+    let count1s = 0;
+    for (let i = 0; i < input.length; i++) {
+        const character = input.charAt(i);
+        if (character === "1") {
+            count1s++;
+        } else if (character !== args[3] && character !== "0" && character !== " ") {
+            throw new OperationError("unexpected character encountered: \"" + character + "\"");
+        }
+    }
+    let parityBit = "1";
+    const flipflop = args[0] === "Even Parity" ? 0 : 1;
+    if (count1s % 2 === flipflop) {
+        parityBit = "0";
+    }
+    if (args[1] === "End") {
+        return input + parityBit;
+    } else {
+        return parityBit + input;
+    }
+}
+
+/**
+ * just removes the parity bit to return the original data
+ * @param input string of binary, encoded
+ * @param args array
+ */
+export function decodeParityBit(input, args) {
+    if (args[1] === "End") {
+        return input.slice(0, -1);
+    } else {
+        return input.slice(1);
+    }
+}

package/src/core/lib/QRCode.mjs

@@ -10,7 +10,7 @@ import OperationError from "../errors/OperationError.mjs";
 import jsQR from "jsqr";
 import qr from "qr-image";
 import Utils from "../Utils.mjs";
-import Jimp from "jimp/es/index.js";
+import { Jimp, JimpMime } from "jimp";
 
 /**
  * Parses a QR code image from an image
@@ -29,18 +29,31 @@ export async function parseQrCode(input, normalise) {
 
     try {
         if (normalise) {
-            image.rgba(false);
-            image.background(0xFFFFFFFF);
-            image.normalize();
             image.greyscale();
-            image = await image.getBufferAsync(Jimp.MIME_JPEG);
-            image = await Jimp.read(image);
+            image.normalize();
         }
     } catch (err) {
         throw new OperationError(`Error normalising image. (${err})`);
     }
 
-    const qrData = jsQR(image.bitmap.data, image.getWidth(), image.getHeight());
+    // Remove transparency which jsQR cannot handle
+    image.scan((x, y, idx) => {
+        // If pixel is fully transparent, make it opaque white
+        if (image.bitmap.data[idx + 3] === 0x00) {
+            image.bitmap.data[idx + 0] = 0xff;
+            image.bitmap.data[idx + 1] = 0xff;
+            image.bitmap.data[idx + 2] = 0xff;
+        }
+        // Otherwise, make it fully opaque at its existing colour
+        image.bitmap.data[idx + 3] = 0xff;
+    });
+    image = await Jimp.read(await image.getBuffer(JimpMime.jpeg));
+
+    const qrData = jsQR(
+        new Uint8ClampedArray(image.bitmap.data),
+        image.width,
+        image.height,
+    );
     if (qrData) {
         return qrData.data;
     } else {
@@ -58,7 +71,13 @@ export async function parseQrCode(input, normalise) {
  * @param {string} errorCorrection
  * @returns {ArrayBuffer}
  */
-export function generateQrCode(input, format, moduleSize, margin, errorCorrection) {
+export function generateQrCode(
+    input,
+    format,
+    moduleSize,
+    margin,
+    errorCorrection,
+) {
     const formats = ["SVG", "EPS", "PDF", "PNG"];
     if (!formats.includes(format.toUpperCase())) {
         throw new OperationError("Unsupported QR code format.");
@@ -70,7 +89,8 @@ export function generateQrCode(input, format, moduleSize, margin, errorCorrectio
             type: format,
             size: moduleSize,
             margin: margin,
-            "ec_level": errorCorrection.charAt(0).toUpperCase()
+            // eslint-disable-next-line camelcase
+            ec_level: errorCorrection.charAt(0).toUpperCase(),
         });
     } catch (err) {
         throw new OperationError(`Error generating QR code. (${err})`);
@@ -86,7 +106,7 @@ export function generateQrCode(input, format, moduleSize, margin, errorCorrectio
         case "PDF":
             return Utils.strToArrayBuffer(qrImage);
         case "PNG":
-            return qrImage.buffer;
+            return qrImage.buffer.slice(qrImage.byteOffset, qrImage.byteLength + qrImage.byteOffset);
         default:
             throw new OperationError("Unsupported QR code format.");
     }