Merge branch 'master' of github.com:gchq/CyberChef into node-lib

This commit is contained in:
d98762625 2019-01-04 09:27:32 +00:00
commit a4de937eb6
133 changed files with 4225 additions and 1337 deletions

View file

@ -9,6 +9,6 @@ trim_trailing_whitespace = true
indent_style = space indent_style = space
indent_size = 4 indent_size = 4
[{package.json,.travis.yml}] [{package.json,.travis.yml,nightwatch.json}]
indent_style = space indent_style = space
indent_size = 2 indent_size = 2

View file

@ -87,6 +87,15 @@
"no-var": "error", "no-var": "error",
"prefer-const": "error" "prefer-const": "error"
}, },
"overrides": [
{
"files": "tests/**/*",
"rules": {
"no-unused-expressions": "off",
"no-console": "off"
}
}
],
"globals": { "globals": {
"$": false, "$": false,
"jQuery": false, "jQuery": false,

2
.gitignore vendored
View file

@ -12,3 +12,5 @@ src/core/operations/index.mjs
src/node/config/OperationConfig.json src/node/config/OperationConfig.json
src/node/index.mjs src/node/index.mjs
**/*.DS_Store **/*.DS_Store
tests/browser/output/*

View file

@ -2,15 +2,19 @@ language: node_js
node_js: node_js:
- node - node
cache: npm cache: npm
addons:
chrome: stable
install: npm install install: npm install
before_script: before_script:
- npm install -g grunt - npm install -g grunt
- export NODE_OPTIONS=--max_old_space_size=2048
script: script:
- grunt lint - grunt lint
- grunt test - grunt test
- grunt docs - grunt docs
- grunt node - grunt node
- grunt prod --msg="$COMPILE_MSG" - grunt prod --msg="$COMPILE_MSG"
- xvfb-run --server-args="-screen 0 1200x800x24" grunt testui
before_deploy: before_deploy:
- grunt exec:sitemap - grunt exec:sitemap
- grunt copy:ghPages - grunt copy:ghPages

View file

@ -2,6 +2,15 @@
All major and minor version changes will be documented in this file. Details of patch-level version changes can be found in [commit messages](https://github.com/gchq/CyberChef/commits/master). All major and minor version changes will be documented in this file. Details of patch-level version changes can be found in [commit messages](https://github.com/gchq/CyberChef/commits/master).
### [8.19.0] - 2018-12-30
- UI test suite added to confirm that the app loads correctly in a reasonable time and that various operations from each module can be run [@n1474335] | [#458]
### [8.18.0] - 2018-12-26
- 'Split Colour Channels' operation added [@artemisbot] | [#449]
### [8.17.0] - 2018-12-25
- 'Generate QR Code' and 'Parse QR Code' operations added [@j433866] | [#448]
### [8.16.0] - 2018-12-19 ### [8.16.0] - 2018-12-19
- 'Play Media' operation added [@anthony-arnold] | [#446] - 'Play Media' operation added [@anthony-arnold] | [#446]
@ -79,6 +88,9 @@ All major and minor version changes will be documented in this file. Details of
[8.19.0]: https://github.com/gchq/CyberChef/releases/tag/v8.19.0
[8.18.0]: https://github.com/gchq/CyberChef/releases/tag/v8.18.0
[8.17.0]: https://github.com/gchq/CyberChef/releases/tag/v8.17.0
[8.16.0]: https://github.com/gchq/CyberChef/releases/tag/v8.16.0 [8.16.0]: https://github.com/gchq/CyberChef/releases/tag/v8.16.0
[8.15.0]: https://github.com/gchq/CyberChef/releases/tag/v8.15.0 [8.15.0]: https://github.com/gchq/CyberChef/releases/tag/v8.15.0
[8.14.0]: https://github.com/gchq/CyberChef/releases/tag/v8.14.0 [8.14.0]: https://github.com/gchq/CyberChef/releases/tag/v8.14.0
@ -103,6 +115,7 @@ All major and minor version changes will be documented in this file. Details of
[@n1474335]: https://github.com/n1474335 [@n1474335]: https://github.com/n1474335
[@d98762625]: https://github.com/d98762625 [@d98762625]: https://github.com/d98762625
[@j433866]: https://github.com/j433866
[@GCHQ77703]: https://github.com/GCHQ77703 [@GCHQ77703]: https://github.com/GCHQ77703
[@artemisbot]: https://github.com/artemisbot [@artemisbot]: https://github.com/artemisbot
[@picapi]: https://github.com/picapi [@picapi]: https://github.com/picapi
@ -144,3 +157,6 @@ All major and minor version changes will be documented in this file. Details of
[#441]: https://github.com/gchq/CyberChef/pull/441 [#441]: https://github.com/gchq/CyberChef/pull/441
[#443]: https://github.com/gchq/CyberChef/pull/443 [#443]: https://github.com/gchq/CyberChef/pull/443
[#446]: https://github.com/gchq/CyberChef/pull/446 [#446]: https://github.com/gchq/CyberChef/pull/446
[#448]: https://github.com/gchq/CyberChef/pull/448
[#449]: https://github.com/gchq/CyberChef/pull/449
[#458]: https://github.com/gchq/CyberChef/pull/458

View file

@ -2,6 +2,7 @@
const webpack = require("webpack"); const webpack = require("webpack");
const HtmlWebpackPlugin = require("html-webpack-plugin"); const HtmlWebpackPlugin = require("html-webpack-plugin");
const BundleAnalyzerPlugin = require("webpack-bundle-analyzer").BundleAnalyzerPlugin;
const NodeExternals = require("webpack-node-externals"); const NodeExternals = require("webpack-node-externals");
const Inliner = require("web-resource-inliner"); const Inliner = require("web-resource-inliner");
const glob = require("glob"); const glob = require("glob");
@ -30,8 +31,16 @@ module.exports = function (grunt) {
["clean", "exec:generateConfig", "exec:generateNodeIndex", "webpack:node", "webpack:nodeRepl", "chmod:build"]); ["clean", "exec:generateConfig", "exec:generateNodeIndex", "webpack:node", "webpack:nodeRepl", "chmod:build"]);
grunt.registerTask("test", grunt.registerTask("test",
"A task which runs all the tests in test/tests.", "A task which runs all the operation tests in the tests directory.",
["clean", "exec:generateConfig", "exec:generateNodeIndex", "exec:generateConfig", "exec:tests"]); ["clean", "exec:generateConfig", "exec:opTests"]);
grunt.registerTask("testui",
"A task which runs all the UI tests in the tests directory. The prod task must already have been run.",
["connect:prod", "exec:browserTests"]);
// grunt.registerTask("testnode",
// "Run all the node tests in the tests directory",
// ["clean", "exec:generateConfig", "exec:generateNodeIndex", "exec:generateConfig", "exec:nodeTests"]);
grunt.registerTask("docs", grunt.registerTask("docs",
"Compiles documentation in the /docs directory.", "Compiles documentation in the /docs directory.",
@ -67,6 +76,7 @@ module.exports = function (grunt) {
grunt.loadNpmTasks("grunt-exec"); grunt.loadNpmTasks("grunt-exec");
grunt.loadNpmTasks("grunt-accessibility"); grunt.loadNpmTasks("grunt-accessibility");
grunt.loadNpmTasks("grunt-concurrent"); grunt.loadNpmTasks("grunt-concurrent");
grunt.loadNpmTasks("grunt-contrib-connect");
// Project configuration // Project configuration
@ -144,11 +154,11 @@ module.exports = function (grunt) {
options: { options: {
configFile: "./.eslintrc.json" configFile: "./.eslintrc.json"
}, },
configs: ["*.js"], configs: ["*.{js,mjs}"],
core: ["src/core/**/*.{js,mjs}", "!src/core/vendor/**/*", "!src/core/operations/legacy/**/*"], core: ["src/core/**/*.{js,mjs}", "!src/core/vendor/**/*", "!src/core/operations/legacy/**/*"],
web: ["src/web/**/*.{js,mjs}"], web: ["src/web/**/*.{js,mjs}"],
node: ["src/node/**/*.{js,mjs}"], node: ["src/node/**/*.{js,mjs}"],
tests: ["test/**/*.{js,mjs}"], tests: ["tests/**/*.{js,mjs}"],
}, },
jsdoc: { jsdoc: {
options: { options: {
@ -180,7 +190,8 @@ module.exports = function (grunt) {
}, },
webpack: { webpack: {
options: webpackConfig, options: webpackConfig,
web: { web: () => {
return {
mode: "production", mode: "production",
target: "web", target: "web",
entry: Object.assign({ entry: Object.assign({
@ -210,7 +221,13 @@ module.exports = function (grunt) {
minifyCSS: true minifyCSS: true
} }
}), }),
new BundleAnalyzerPlugin({
analyzerMode: "static",
reportFilename: "BundleAnalyzerReport.html",
openAnalyzer: false
}),
] ]
};
}, },
webInline: { webInline: {
mode: "production", mode: "production",
@ -246,7 +263,7 @@ module.exports = function (grunt) {
externals: [NodeExternals()], externals: [NodeExternals()],
output: { output: {
filename: "index.js", filename: "index.js",
path: __dirname + "/build/test" path: __dirname + "/build/test/node"
}, },
plugins: [ plugins: [
new webpack.DefinePlugin(BUILD_CONSTANTS), new webpack.DefinePlugin(BUILD_CONSTANTS),
@ -354,6 +371,14 @@ module.exports = function (grunt) {
} }
} }
}, },
connect: {
prod: {
options: {
port: 8000,
base: "build/prod/"
}
}
},
copy: { copy: {
ghPages: { ghPages: {
options: { options: {
@ -450,9 +475,15 @@ module.exports = function (grunt) {
"echo '--- Node index generated. ---\n'" "echo '--- Node index generated. ---\n'"
].join(";"), ].join(";"),
}, },
tests: { opTests: {
command: "node --experimental-modules --no-warnings --no-deprecation test/index.mjs" command: "node --experimental-modules --no-warnings --no-deprecation tests/operations/index.mjs"
} },
browserTests: {
command: "./node_modules/.bin/nightwatch --env prod,inline"
},
// nodeTests: {
// command: "node --experimental-modules --no-warnings --no-deprecation tests/node/index.mjs"
// }
}, },
}); });
}; };

34
nightwatch.json Normal file
View file

@ -0,0 +1,34 @@
{
"src_folders": ["tests/browser"],
"output_folder": "tests/browser/output",
"test_settings": {
"default": {
"launch_url": "http://localhost:8080",
"webdriver": {
"start_process": true,
"server_path": "./node_modules/.bin/chromedriver",
"port": 9515,
"log_path": false
},
"desiredCapabilities": {
"browserName": "chrome"
}
},
"dev": {
"launch_url": "http://localhost:8080"
},
"prod": {
"launch_url": "http://localhost:8000/index.html"
},
"inline": {
"launch_url": "http://localhost:8000/cyberchef.htm"
}
}
}

4045
package-lock.json generated

File diff suppressed because it is too large Load diff

View file

@ -1,6 +1,6 @@
{ {
"name": "cyberchef", "name": "cyberchef",
"version": "8.16.0", "version": "8.19.5",
"description": "The Cyber Swiss Army Knife for encryption, encoding, compression and data analysis.", "description": "The Cyber Swiss Army Knife for encryption, encoding, compression and data analysis.",
"author": "n1474335 <n1474335@gmail.com>", "author": "n1474335 <n1474335@gmail.com>",
"homepage": "https://gchq.github.io/CyberChef", "homepage": "https://gchq.github.io/CyberChef",
@ -31,22 +31,24 @@
"module": "src/node/index.mjs", "module": "src/node/index.mjs",
"bugs": "https://github.com/gchq/CyberChef/issues", "bugs": "https://github.com/gchq/CyberChef/issues",
"devDependencies": { "devDependencies": {
"@babel/core": "^7.1.5", "@babel/core": "^7.2.2",
"@babel/preset-env": "^7.1.5", "@babel/preset-env": "^7.2.3",
"autoprefixer": "^9.3.1", "autoprefixer": "^9.4.3",
"babel-loader": "^8.0.4", "babel-loader": "^8.0.4",
"bootstrap": "^4.1.3", "bootstrap": "^4.2.1",
"colors": "^1.3.2", "chromedriver": "^2.45.0",
"css-loader": "^1.0.1", "colors": "^1.3.3",
"eslint": "^5.8.0", "css-loader": "^2.1.0",
"eslint": "^5.11.1",
"exports-loader": "^0.7.0", "exports-loader": "^0.7.0",
"extract-text-webpack-plugin": "^4.0.0-alpha0", "extract-text-webpack-plugin": "^4.0.0-alpha0",
"file-loader": "^2.0.0", "file-loader": "^3.0.1",
"grunt": "^1.0.3", "grunt": "^1.0.3",
"grunt-accessibility": "~6.0.0", "grunt-accessibility": "~6.0.0",
"grunt-chmod": "~1.1.1", "grunt-chmod": "~1.1.1",
"grunt-concurrent": "^2.3.1", "grunt-concurrent": "^2.3.1",
"grunt-contrib-clean": "~2.0.0", "grunt-contrib-clean": "~2.0.0",
"grunt-contrib-connect": "^2.0.0",
"grunt-contrib-copy": "~1.0.0", "grunt-contrib-copy": "~1.0.0",
"grunt-contrib-watch": "^1.1.0", "grunt-contrib-watch": "^1.1.0",
"grunt-eslint": "^21.0.0", "grunt-eslint": "^21.0.0",
@ -57,7 +59,8 @@
"imports-loader": "^0.8.0", "imports-loader": "^0.8.0",
"ink-docstrap": "^1.3.2", "ink-docstrap": "^1.3.2",
"jsdoc-babel": "^0.5.0", "jsdoc-babel": "^0.5.0",
"node-sass": "^4.10.0", "nightwatch": "^1.0.18",
"node-sass": "^4.11.0",
"postcss-css-variables": "^0.11.0", "postcss-css-variables": "^0.11.0",
"postcss-import": "^12.0.1", "postcss-import": "^12.0.1",
"postcss-loader": "^3.0.0", "postcss-loader": "^3.0.0",
@ -68,8 +71,9 @@
"uglifyjs-webpack-plugin": "^2.0.1", "uglifyjs-webpack-plugin": "^2.0.1",
"url-loader": "^1.1.2", "url-loader": "^1.1.2",
"web-resource-inliner": "^4.2.1", "web-resource-inliner": "^4.2.1",
"webpack": "^4.25.1", "webpack": "^4.28.3",
"webpack-dev-server": "^3.1.10", "webpack-bundle-analyzer": "^3.0.3",
"webpack-dev-server": "^3.1.14",
"webpack-node-externals": "^1.7.2", "webpack-node-externals": "^1.7.2",
"worker-loader": "^2.0.0" "worker-loader": "^2.0.0"
}, },
@ -81,7 +85,7 @@
"bignumber.js": "^8.0.1", "bignumber.js": "^8.0.1",
"bootstrap-colorpicker": "^2.5.3", "bootstrap-colorpicker": "^2.5.3",
"bootstrap-material-design": "^4.1.1", "bootstrap-material-design": "^4.1.1",
"bson": "^3.0.2", "bson": "^4.0.1",
"chi-squared": "^1.1.0", "chi-squared": "^1.1.0",
"crypto-api": "^0.8.3", "crypto-api": "^0.8.3",
"crypto-js": "^3.1.9-1", "crypto-js": "^3.1.9-1",
@ -92,33 +96,35 @@
"esmangle": "^1.0.1", "esmangle": "^1.0.1",
"esprima": "^4.0.1", "esprima": "^4.0.1",
"exif-parser": "^0.1.12", "exif-parser": "^0.1.12",
"file-saver": "^2.0.0-rc.4", "file-saver": "^2.0.0",
"highlight.js": "^9.13.1", "highlight.js": "^9.13.1",
"jimp": "^0.6.0",
"jquery": "^3.3.1", "jquery": "^3.3.1",
"js-crc": "^0.2.0", "js-crc": "^0.2.0",
"js-sha3": "^0.8.0", "js-sha3": "^0.8.0",
"jsbn": "^1.1.0", "jsesc": "^2.5.2",
"jsesc": "^2.5.1",
"jsonpath": "^1.0.0", "jsonpath": "^1.0.0",
"jsonwebtoken": "^8.3.0", "jsonwebtoken": "^8.4.0",
"jsqr": "^1.1.1",
"jsrsasign": "8.0.12", "jsrsasign": "8.0.12",
"kbpgp": "^2.0.82", "kbpgp": "^2.0.82",
"lodash": "^4.17.11", "lodash": "^4.17.11",
"loglevel": "^1.6.1", "loglevel": "^1.6.1",
"loglevel-message-prefix": "^3.0.0", "loglevel-message-prefix": "^3.0.0",
"moment": "^2.22.2", "moment": "^2.23.0",
"moment-timezone": "^0.5.23", "moment-timezone": "^0.5.23",
"ngeohash": "^0.6.0", "ngeohash": "^0.6.3",
"node-forge": "^0.7.6", "node-forge": "^0.7.6",
"node-md6": "^0.1.0", "node-md6": "^0.1.0",
"notepack.io": "^2.1.3", "notepack.io": "^2.2.0",
"nwmatcher": "^1.4.4", "nwmatcher": "^1.4.4",
"otp": "^0.1.3", "otp": "^0.1.3",
"popper.js": "^1.14.4", "popper.js": "^1.14.6",
"qr-image": "^3.2.0",
"scryptsy": "^2.0.0", "scryptsy": "^2.0.0",
"snackbarjs": "^1.1.0", "snackbarjs": "^1.1.0",
"sortablejs": "^1.7.0", "sortablejs": "^1.8.0-rc1",
"split.js": "^1.5.9", "split.js": "^1.5.10",
"ssdeep.js": "0.0.2", "ssdeep.js": "0.0.2",
"ua-parser-js": "^0.7.19", "ua-parser-js": "^0.7.19",
"utf8": "^3.0.0", "utf8": "^3.0.0",
@ -132,6 +138,7 @@
"start": "grunt dev", "start": "grunt dev",
"build": "grunt prod", "build": "grunt prod",
"test": "grunt test", "test": "grunt test",
"testui": "grunt testui",
"docs": "grunt docs", "docs": "grunt docs",
"lint": "grunt lint", "lint": "grunt lint",
"repl": "node --experimental-modules --no-warnings src/node/repl-index.mjs", "repl": "node --experimental-modules --no-warnings src/node/repl-index.mjs",

View file

@ -6,6 +6,7 @@
*/ */
import Utils from "./Utils"; import Utils from "./Utils";
import DishError from "./errors/DishError";
import BigNumber from "bignumber.js"; import BigNumber from "bignumber.js";
import log from "loglevel"; import log from "loglevel";
@ -73,7 +74,7 @@ class Dish {
case "list<file>": case "list<file>":
return Dish.LIST_FILE; return Dish.LIST_FILE;
default: default:
throw "Invalid data type string. No matching enum."; throw new DishError("Invalid data type string. No matching enum.");
} }
} }
@ -105,7 +106,7 @@ class Dish {
case Dish.LIST_FILE: case Dish.LIST_FILE:
return "List<File>"; return "List<File>";
default: default:
throw "Invalid data type enum. No matching type."; throw new DishError("Invalid data type enum. No matching type.");
} }
} }
@ -129,7 +130,7 @@ class Dish {
if (!this.valid()) { if (!this.valid()) {
const sample = Utils.truncate(JSON.stringify(this.value), 13); const sample = Utils.truncate(JSON.stringify(this.value), 13);
throw "Data is not a valid " + Dish.enumLookup(type) + ": " + sample; throw new DishError(`Data is not a valid ${Dish.enumLookup(type)}: ${sample}`);
} }
} }
@ -163,6 +164,7 @@ class Dish {
const byteArrayToStr = notUTF8 ? Utils.byteArrayToChars : Utils.byteArrayToUtf8; const byteArrayToStr = notUTF8 ? Utils.byteArrayToChars : Utils.byteArrayToUtf8;
// Convert data to intermediate byteArray type // Convert data to intermediate byteArray type
try {
switch (this.type) { switch (this.type) {
case Dish.STRING: case Dish.STRING:
this.value = this.value ? Utils.strToByteArray(this.value) : []; this.value = this.value ? Utils.strToByteArray(this.value) : [];
@ -195,10 +197,14 @@ class Dish {
default: default:
break; break;
} }
} catch (err) {
throw new DishError(`Error translating from ${Dish.enumLookup(this.type)} to byteArray: ${err}`);
}
this.type = Dish.BYTE_ARRAY; this.type = Dish.BYTE_ARRAY;
// Convert from byteArray to toType // Convert from byteArray to toType
try {
switch (toType) { switch (toType) {
case Dish.STRING: case Dish.STRING:
case Dish.HTML: case Dish.HTML:
@ -235,6 +241,9 @@ class Dish {
default: default:
break; break;
} }
} catch (err) {
throw new DishError(`Error translating from byteArray to ${Dish.enumLookup(toType)}: ${err}`);
}
} }
@ -369,7 +378,7 @@ class Dish {
); );
break; break;
default: default:
throw new Error("Cannot clone Dish, unknown type"); throw new DishError("Cannot clone Dish, unknown type");
} }
return newDish; return newDish;

View file

@ -25,6 +25,7 @@ class Ingredient {
this.hint = ""; this.hint = "";
this.toggleValues = []; this.toggleValues = [];
this.target = null; this.target = null;
this.defaultIndex = 0;
if (ingredientConfig) { if (ingredientConfig) {
this._parseConfig(ingredientConfig); this._parseConfig(ingredientConfig);
@ -46,6 +47,7 @@ class Ingredient {
this.hint = ingredientConfig.hint || false; this.hint = ingredientConfig.hint || false;
this.toggleValues = ingredientConfig.toggleValues; this.toggleValues = ingredientConfig.toggleValues;
this.target = typeof ingredientConfig.target !== "undefined" ? ingredientConfig.target : null; this.target = typeof ingredientConfig.target !== "undefined" ? ingredientConfig.target : null;
this.defaultIndex = typeof ingredientConfig.defaultIndex !== "undefined" ? ingredientConfig.defaultIndex : 0;
} }
@ -93,6 +95,7 @@ class Ingredient {
case "binaryString": case "binaryString":
case "binaryShortString": case "binaryShortString":
case "editableOption": case "editableOption":
case "editableOptionShort":
return Utils.parseEscapedChars(data); return Utils.parseEscapedChars(data);
case "byteArray": case "byteArray":
if (typeof data == "string") { if (typeof data == "string") {

View file

@ -181,6 +181,7 @@ class Operation {
if (ing.hint) conf.hint = ing.hint; if (ing.hint) conf.hint = ing.hint;
if (ing.disabled) conf.disabled = ing.disabled; if (ing.disabled) conf.disabled = ing.disabled;
if (ing.target) conf.target = ing.target; if (ing.target) conf.target = ing.target;
if (ing.defaultIndex) conf.defaultIndex = ing.defaultIndex;
return conf; return conf;
}); });
} }

View file

@ -4,10 +4,10 @@
* @license Apache-2.0 * @license Apache-2.0
*/ */
// import Operation from "./Operation.js";
import OpModules from "./config/modules/OpModules"; import OpModules from "./config/modules/OpModules";
import OperationConfig from "./config/OperationConfig.json"; import OperationConfig from "./config/OperationConfig.json";
import OperationError from "./errors/OperationError"; import OperationError from "./errors/OperationError";
import DishError from "./errors/DishError";
import log from "loglevel"; import log from "loglevel";
/** /**
@ -183,6 +183,10 @@ class Recipe {
// native types is not fully supported yet. // native types is not fully supported yet.
dish.set(err.message, "string"); dish.set(err.message, "string");
return i; return i;
} else if (err instanceof DishError ||
(err.type && err.type === "DishError")) {
dish.set(err.message, "string");
return i;
} else { } else {
const e = typeof err == "string" ? { message: err } : err; const e = typeof err == "string" ? { message: err } : err;

View file

@ -5,8 +5,7 @@
*/ */
import utf8 from "utf8"; import utf8 from "utf8";
import moment from "moment-timezone"; import {fromBase64, toBase64} from "./lib/Base64";
import {fromBase64} from "./lib/Base64";
import {fromHex} from "./lib/Hex"; import {fromHex} from "./lib/Hex";
import {fromDecimal} from "./lib/Decimal"; import {fromDecimal} from "./lib/Decimal";
import {fromBinary} from "./lib/Binary"; import {fromBinary} from "./lib/Binary";
@ -797,38 +796,6 @@ class Utils {
} }
/**
* Expresses a number of milliseconds in a human readable format.
*
* Range | Sample Output
* -----------------------------|-------------------------------
* 0 to 45 seconds | a few seconds ago
* 45 to 90 seconds | a minute ago
* 90 seconds to 45 minutes | 2 minutes ago ... 45 minutes ago
* 45 to 90 minutes | an hour ago
* 90 minutes to 22 hours | 2 hours ago ... 22 hours ago
* 22 to 36 hours | a day ago
* 36 hours to 25 days | 2 days ago ... 25 days ago
* 25 to 45 days | a month ago
* 45 to 345 days | 2 months ago ... 11 months ago
* 345 to 545 days (1.5 years) | a year ago
* 546 days+ | 2 years ago ... 20 years ago
*
* @param {number} ms
* @returns {string}
*
* @example
* // returns "3 minutes"
* Utils.fuzzyTime(152435);
*
* // returns "5 days"
* Utils.fuzzyTime(456851321);
*/
static fuzzyTime(ms) {
return moment.duration(ms, "milliseconds").humanize();
}
/** /**
* Formats a list of files or directories. * Formats a list of files or directories.
* *
@ -850,6 +817,17 @@ class Utils {
return html; return html;
}; };
const formatContent = function (buff, type) {
if (type.startsWith("image")) {
let dataURI = "data:";
dataURI += type + ";";
dataURI += "base64," + toBase64(buff);
return "<img style='max-width: 100%;' src='" + dataURI + "'>";
} else {
return `<pre>${Utils.escapeHtml(Utils.arrayBufferToStr(buff.buffer))}</pre>`;
}
};
const formatFile = async function(file, i) { const formatFile = async function(file, i) {
const buff = await Utils.readFile(file); const buff = await Utils.readFile(file);
const blob = new Blob( const blob = new Blob(
@ -879,7 +857,7 @@ class Utils {
</div> </div>
<div id='collapse${i}' class='collapse' aria-labelledby='heading${i}' data-parent="#files"> <div id='collapse${i}' class='collapse' aria-labelledby='heading${i}' data-parent="#files">
<div class='card-body'> <div class='card-body'>
<pre>${Utils.escapeHtml(Utils.arrayBufferToStr(buff.buffer))}</pre> ${formatContent(buff, file.type)}
</div> </div>
</div> </div>
</div>`; </div>`;

View file

@ -347,9 +347,17 @@
"Detect File Type", "Detect File Type",
"Scan for Embedded Files", "Scan for Embedded Files",
"Remove EXIF", "Remove EXIF",
"Extract EXIF", "Extract EXIF"
]
},
{
"name": "Multimedia",
"ops": [
"Render Image", "Render Image",
"Play Media" "Play Media",
"Remove EXIF",
"Extract EXIF",
"Split Colour Channels"
] ]
}, },
{ {
@ -363,6 +371,8 @@
"Generate UUID", "Generate UUID",
"Generate TOTP", "Generate TOTP",
"Generate HOTP", "Generate HOTP",
"Generate QR Code",
"Parse QR Code",
"Haversine distance", "Haversine distance",
"Numberwang", "Numberwang",
"XKCD Random Number" "XKCD Random Number"

View file

@ -222,7 +222,7 @@ export default ${moduleName};
console.log(`\nNext steps: console.log(`\nNext steps:
1. Add your operation to ${colors.green("src/core/config/Categories.json")} 1. Add your operation to ${colors.green("src/core/config/Categories.json")}
2. Write your operation code. 2. Write your operation code.
3. Write tests in ${colors.green("test/tests/operations/")} 3. Write tests in ${colors.green("tests/operations/tests/")}
4. Run ${colors.cyan("npm run lint")} and ${colors.cyan("npm run test")} 4. Run ${colors.cyan("npm run lint")} and ${colors.cyan("npm run test")}
5. Submit a Pull Request to get your operation added to the official CyberChef repository.`); 5. Submit a Pull Request to get your operation added to the official CyberChef repository.`);

View file

@ -0,0 +1,26 @@
/**
* Custom error type for handling Dish type errors.
* i.e. where the Dish cannot be successfully translated between types
*
* @author n1474335 [n1474335@gmail.com]
* @copyright Crown Copyright 2018
* @license Apache-2.0
*/
class DishError extends Error {
/**
* Standard error constructor. Adds no new behaviour.
*
* @param args - Standard error args
*/
constructor(...args) {
super(...args);
this.type = "DishError";
if (Error.captureStackTrace) {
Error.captureStackTrace(this, DishError);
}
}
}
export default DishError;

View file

@ -19,7 +19,7 @@ class Adler32Checksum extends Operation {
super(); super();
this.name = "Adler-32 Checksum"; this.name = "Adler-32 Checksum";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995, and is a modification of the Fletcher checksum. Compared to a cyclic redundancy check of the same length, it trades reliability for speed (preferring the latter).<br><br>Adler-32 is more reliable than Fletcher-16, and slightly less reliable than Fletcher-32."; this.description = "Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995, and is a modification of the Fletcher checksum. Compared to a cyclic redundancy check of the same length, it trades reliability for speed (preferring the latter).<br><br>Adler-32 is more reliable than Fletcher-16, and slightly less reliable than Fletcher-32.";
this.infoURL = "https://wikipedia.org/wiki/Adler-32"; this.infoURL = "https://wikipedia.org/wiki/Adler-32";
this.inputType = "byteArray"; this.inputType = "byteArray";

View file

@ -19,7 +19,7 @@ class AnalyseHash extends Operation {
super(); super();
this.name = "Analyse hash"; this.name = "Analyse hash";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Tries to determine information about a given hash and suggests which algorithm may have been used to generate it based on its length."; this.description = "Tries to determine information about a given hash and suggests which algorithm may have been used to generate it based on its length.";
this.infoURL = "https://wikipedia.org/wiki/Comparison_of_cryptographic_hash_functions"; this.infoURL = "https://wikipedia.org/wiki/Comparison_of_cryptographic_hash_functions";
this.inputType = "string"; this.inputType = "string";

View file

@ -5,7 +5,7 @@
*/ */
import Operation from "../Operation"; import Operation from "../Operation";
import bsonjs from "bson"; import bson from "bson";
import OperationError from "../errors/OperationError"; import OperationError from "../errors/OperationError";
/** /**
@ -36,8 +36,6 @@ class BSONDeserialise extends Operation {
run(input, args) { run(input, args) {
if (!input.byteLength) return ""; if (!input.byteLength) return "";
const bson = new bsonjs();
try { try {
const data = bson.deserialize(new Buffer(input)); const data = bson.deserialize(new Buffer(input));
return JSON.stringify(data, null, 2); return JSON.stringify(data, null, 2);

View file

@ -5,7 +5,7 @@
*/ */
import Operation from "../Operation"; import Operation from "../Operation";
import bsonjs from "bson"; import bson from "bson";
import OperationError from "../errors/OperationError"; import OperationError from "../errors/OperationError";
/** /**
@ -36,8 +36,6 @@ class BSONSerialise extends Operation {
run(input, args) { run(input, args) {
if (!input) return new ArrayBuffer(); if (!input) return new ArrayBuffer();
const bson = new bsonjs();
try { try {
const data = JSON.parse(input); const data = JSON.parse(input);
return bson.serialize(data).buffer; return bson.serialize(data).buffer;

View file

@ -19,7 +19,7 @@ class Bcrypt extends Operation {
super(); super();
this.name = "Bcrypt"; this.name = "Bcrypt";
this.module = "Hashing"; this.module = "Crypto";
this.description = "bcrypt is a password hashing function designed by Niels Provos and David Mazi\xe8res, based on the Blowfish cipher, and presented at USENIX in 1999. Besides incorporating a salt to protect against rainbow table attacks, bcrypt is an adaptive function: over time, the iteration count (rounds) can be increased to make it slower, so it remains resistant to brute-force search attacks even with increasing computation power.<br><br>Enter the password in the input to generate its hash."; this.description = "bcrypt is a password hashing function designed by Niels Provos and David Mazi\xe8res, based on the Blowfish cipher, and presented at USENIX in 1999. Besides incorporating a salt to protect against rainbow table attacks, bcrypt is an adaptive function: over time, the iteration count (rounds) can be increased to make it slower, so it remains resistant to brute-force search attacks even with increasing computation power.<br><br>Enter the password in the input to generate its hash.";
this.infoURL = "https://wikipedia.org/wiki/Bcrypt"; this.infoURL = "https://wikipedia.org/wiki/Bcrypt";
this.inputType = "string"; this.inputType = "string";

View file

@ -19,7 +19,7 @@ class BcryptCompare extends Operation {
super(); super();
this.name = "Bcrypt compare"; this.name = "Bcrypt compare";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Tests whether the input matches the given bcrypt hash. To test multiple possible passwords, use the 'Fork' operation."; this.description = "Tests whether the input matches the given bcrypt hash. To test multiple possible passwords, use the 'Fork' operation.";
this.infoURL = "https://wikipedia.org/wiki/Bcrypt"; this.infoURL = "https://wikipedia.org/wiki/Bcrypt";
this.inputType = "string"; this.inputType = "string";

View file

@ -20,7 +20,7 @@ class BcryptParse extends Operation {
super(); super();
this.name = "Bcrypt parse"; this.name = "Bcrypt parse";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Parses a bcrypt hash to determine the number of rounds used, the salt, and the password hash."; this.description = "Parses a bcrypt hash to determine the number of rounds used, the salt, and the password hash.";
this.infoURL = "https://wikipedia.org/wiki/Bcrypt"; this.infoURL = "https://wikipedia.org/wiki/Bcrypt";
this.inputType = "string"; this.inputType = "string";

View file

@ -19,7 +19,7 @@ class CRC16Checksum extends Operation {
super(); super();
this.name = "CRC-16 Checksum"; this.name = "CRC-16 Checksum";
this.module = "Hashing"; this.module = "Crypto";
this.description = "A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.<br><br>The CRC was invented by W. Wesley Peterson in 1961."; this.description = "A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.<br><br>The CRC was invented by W. Wesley Peterson in 1961.";
this.infoURL = "https://wikipedia.org/wiki/Cyclic_redundancy_check"; this.infoURL = "https://wikipedia.org/wiki/Cyclic_redundancy_check";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class CRC32Checksum extends Operation {
super(); super();
this.name = "CRC-32 Checksum"; this.name = "CRC-32 Checksum";
this.module = "Hashing"; this.module = "Crypto";
this.description = "A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.<br><br>The CRC was invented by W. Wesley Peterson in 1961; the 32-bit CRC function of Ethernet and many other standards is the work of several researchers and was published in 1975."; this.description = "A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.<br><br>The CRC was invented by W. Wesley Peterson in 1961; the 32-bit CRC function of Ethernet and many other standards is the work of several researchers and was published in 1975.";
this.infoURL = "https://wikipedia.org/wiki/Cyclic_redundancy_check"; this.infoURL = "https://wikipedia.org/wiki/Cyclic_redundancy_check";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class CTPH extends Operation {
super(); super();
this.name = "CTPH"; this.name = "CTPH";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Context Triggered Piecewise Hashing, also called Fuzzy Hashing, can match inputs that have homologies. Such inputs have sequences of identical bytes in the same order, although bytes in between these sequences may be different in both content and length.<br><br>CTPH was originally based on the work of Dr. Andrew Tridgell and a spam email detector called SpamSum. This method was adapted by Jesse Kornblum and published at the DFRWS conference in 2006 in a paper 'Identifying Almost Identical Files Using Context Triggered Piecewise Hashing'."; this.description = "Context Triggered Piecewise Hashing, also called Fuzzy Hashing, can match inputs that have homologies. Such inputs have sequences of identical bytes in the same order, although bytes in between these sequences may be different in both content and length.<br><br>CTPH was originally based on the work of Dr. Andrew Tridgell and a spam email detector called SpamSum. This method was adapted by Jesse Kornblum and published at the DFRWS conference in 2006 in a paper 'Identifying Almost Identical Files Using Context Triggered Piecewise Hashing'.";
this.infoURL = "https://forensicswiki.org/wiki/Context_Triggered_Piecewise_Hashing"; this.infoURL = "https://forensicswiki.org/wiki/Context_Triggered_Piecewise_Hashing";
this.inputType = "string"; this.inputType = "string";

View file

@ -22,7 +22,7 @@ class CompareCTPHHashes extends Operation {
super(); super();
this.name = "Compare CTPH hashes"; this.name = "Compare CTPH hashes";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Compares two Context Triggered Piecewise Hashing (CTPH) fuzzy hashes to determine the similarity between them on a scale of 0 to 100."; this.description = "Compares two Context Triggered Piecewise Hashing (CTPH) fuzzy hashes to determine the similarity between them on a scale of 0 to 100.";
this.infoURL = "https://forensicswiki.org/wiki/Context_Triggered_Piecewise_Hashing"; this.infoURL = "https://forensicswiki.org/wiki/Context_Triggered_Piecewise_Hashing";
this.inputType = "string"; this.inputType = "string";

View file

@ -22,7 +22,7 @@ class CompareSSDEEPHashes extends Operation {
super(); super();
this.name = "Compare SSDEEP hashes"; this.name = "Compare SSDEEP hashes";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Compares two SSDEEP fuzzy hashes to determine the similarity between them on a scale of 0 to 100."; this.description = "Compares two SSDEEP fuzzy hashes to determine the similarity between them on a scale of 0 to 100.";
this.infoURL = "https://forensicswiki.org/wiki/Ssdeep"; this.infoURL = "https://forensicswiki.org/wiki/Ssdeep";
this.inputType = "string"; this.inputType = "string";

View file

@ -20,7 +20,7 @@ class DecodeText extends Operation {
super(); super();
this.name = "Decode text"; this.name = "Decode text";
this.module = "CharEnc"; this.module = "Encodings";
this.description = [ this.description = [
"Decodes text from the chosen character encoding.", "Decodes text from the chosen character encoding.",
"<br><br>", "<br><br>",

View file

@ -20,7 +20,7 @@ class EncodeText extends Operation {
super(); super();
this.name = "Encode text"; this.name = "Encode text";
this.module = "CharEnc"; this.module = "Encodings";
this.description = [ this.description = [
"Encodes text into the chosen character encoding.", "Encodes text into the chosen character encoding.",
"<br><br>", "<br><br>",

View file

@ -19,7 +19,7 @@ class Fletcher16Checksum extends Operation {
super(); super();
this.name = "Fletcher-16 Checksum"; this.name = "Fletcher-16 Checksum";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques."; this.description = "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques.";
this.infoURL = "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-16"; this.infoURL = "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-16";
this.inputType = "byteArray"; this.inputType = "byteArray";

View file

@ -19,7 +19,7 @@ class Fletcher32Checksum extends Operation {
super(); super();
this.name = "Fletcher-32 Checksum"; this.name = "Fletcher-32 Checksum";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques."; this.description = "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques.";
this.infoURL = "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-32"; this.infoURL = "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-32";
this.inputType = "byteArray"; this.inputType = "byteArray";

View file

@ -19,7 +19,7 @@ class Fletcher64Checksum extends Operation {
super(); super();
this.name = "Fletcher-64 Checksum"; this.name = "Fletcher-64 Checksum";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques."; this.description = "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques.";
this.infoURL = "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-64"; this.infoURL = "https://wikipedia.org/wiki/Fletcher%27s_checksum#Fletcher-64";
this.inputType = "byteArray"; this.inputType = "byteArray";

View file

@ -19,7 +19,7 @@ class Fletcher8Checksum extends Operation {
super(); super();
this.name = "Fletcher-8 Checksum"; this.name = "Fletcher-8 Checksum";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques."; this.description = "The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John Gould Fletcher at Lawrence Livermore Labs in the late 1970s.<br><br>The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques.";
this.infoURL = "https://wikipedia.org/wiki/Fletcher%27s_checksum"; this.infoURL = "https://wikipedia.org/wiki/Fletcher%27s_checksum";
this.inputType = "byteArray"; this.inputType = "byteArray";

View file

@ -19,7 +19,7 @@ class FromGeohash extends Operation {
super(); super();
this.name = "From Geohash"; this.name = "From Geohash";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Converts Geohash strings into Lat/Long coordinates. For example, <code>ww8p1r4t8</code> becomes <code>37.8324,112.5584</code>."; this.description = "Converts Geohash strings into Lat/Long coordinates. For example, <code>ww8p1r4t8</code> becomes <code>37.8324,112.5584</code>.";
this.infoURL = "https://wikipedia.org/wiki/Geohash"; this.infoURL = "https://wikipedia.org/wiki/Geohash";
this.inputType = "string"; this.inputType = "string";

View file

@ -41,7 +41,7 @@ class GenerateAllHashes extends Operation {
super(); super();
this.name = "Generate all hashes"; this.name = "Generate all hashes";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Generates all available hashes and checksums for the input."; this.description = "Generates all available hashes and checksums for the input.";
this.infoURL = "https://wikipedia.org/wiki/Comparison_of_cryptographic_hash_functions"; this.infoURL = "https://wikipedia.org/wiki/Comparison_of_cryptographic_hash_functions";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -0,0 +1,119 @@
/**
* @author j433866 [j433866@gmail.com]
* @copyright Crown Copyright 2018
* @license Apache-2.0
*/
import Operation from "../Operation";
import OperationError from "../errors/OperationError";
import qr from "qr-image";
import { toBase64 } from "../lib/Base64";
import Magic from "../lib/Magic";
import Utils from "../Utils";
/**
* Generate QR Code operation
*/
class GenerateQRCode extends Operation {
/**
* GenerateQRCode constructor
*/
constructor() {
super();
this.name = "Generate QR Code";
this.module = "Image";
this.description = "Generates a Quick Response (QR) code from the input text.<br><br>A QR code is a type of matrix barcode (or two-dimensional barcode) first designed in 1994 for the automotive industry in Japan. A barcode is a machine-readable optical label that contains information about the item to which it is attached.";
this.infoURL = "https://wikipedia.org/wiki/QR_code";
this.inputType = "string";
this.outputType = "byteArray";
this.presentType = "html";
this.args = [
{
"name": "Image Format",
"type": "option",
"value": ["PNG", "SVG", "EPS", "PDF"]
},
{
"name": "Module size (px)",
"type": "number",
"value": 5
},
{
"name": "Margin (num modules)",
"type": "number",
"value": 2
},
{
"name": "Error correction",
"type": "option",
"value": ["Low", "Medium", "Quartile", "High"],
"defaultIndex": 1
}
];
}
/**
* @param {string} input
* @param {Object[]} args
* @returns {byteArray}
*/
run(input, args) {
const [format, size, margin, errorCorrection] = args;
// Create new QR image from the input data, and convert it to a buffer
const qrImage = qr.imageSync(input, {
type: format,
size: size,
margin: margin,
"ec_level": errorCorrection.charAt(0).toUpperCase()
});
if (qrImage == null) {
throw new OperationError("Error generating QR code.");
}
switch (format) {
case "SVG":
case "EPS":
case "PDF":
return [...Buffer.from(qrImage)];
case "PNG":
// Return the QR image buffer as a byte array
return [...qrImage];
default:
throw new OperationError("Unsupported QR code format.");
}
}
/**
* Displays the QR image using HTML for web apps
*
* @param {byteArray} data
* @returns {html}
*/
present(data, args) {
if (!data.length) return "";
const [format] = args;
if (format === "PNG") {
let dataURI = "data:";
const type = Magic.magicFileType(data);
if (type && type.mime.indexOf("image") === 0){
dataURI += type.mime + ";";
} else {
throw new OperationError("Invalid PNG file generated by QR image");
}
dataURI += "base64," + toBase64(data);
return `<img src="${dataURI}">`;
}
return Utils.byteArrayToChars(data);
}
}
export default GenerateQRCode;

View file

@ -22,7 +22,7 @@ class GroupIPAddresses extends Operation {
super(); super();
this.name = "Group IP addresses"; this.name = "Group IP addresses";
this.module = "JSBN"; this.module = "Default";
this.description = "Groups a list of IP addresses into subnets. Supports both IPv4 and IPv6 addresses."; this.description = "Groups a list of IP addresses into subnets. Supports both IPv4 and IPv6 addresses.";
this.infoURL = "https://wikipedia.org/wiki/Subnetwork"; this.infoURL = "https://wikipedia.org/wiki/Subnetwork";
this.inputType = "string"; this.inputType = "string";

View file

@ -19,7 +19,7 @@ class HAS160 extends Operation {
super(); super();
this.name = "HAS-160"; this.name = "HAS-160";
this.module = "Hashing"; this.module = "Crypto";
this.description = "HAS-160 is a cryptographic hash function designed for use with the Korean KCDSA digital signature algorithm. It is derived from SHA-1, with assorted changes intended to increase its security. It produces a 160-bit output.<br><br>HAS-160 is used in the same way as SHA-1. First it divides input in blocks of 512 bits each and pads the final block. A digest function updates the intermediate hash value by processing the input blocks in turn.<br><br>The message digest algorithm consists of 80 rounds."; this.description = "HAS-160 is a cryptographic hash function designed for use with the Korean KCDSA digital signature algorithm. It is derived from SHA-1, with assorted changes intended to increase its security. It produces a 160-bit output.<br><br>HAS-160 is used in the same way as SHA-1. First it divides input in blocks of 512 bits each and pads the final block. A digest function updates the intermediate hash value by processing the input blocks in turn.<br><br>The message digest algorithm consists of 80 rounds.";
this.infoURL = "https://wikipedia.org/wiki/HAS-160"; this.infoURL = "https://wikipedia.org/wiki/HAS-160";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -20,7 +20,7 @@ class HMAC extends Operation {
super(); super();
this.name = "HMAC"; this.name = "HMAC";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Keyed-Hash Message Authentication Codes (HMAC) are a mechanism for message authentication using cryptographic hash functions."; this.description = "Keyed-Hash Message Authentication Codes (HMAC) are a mechanism for message authentication using cryptographic hash functions.";
this.infoURL = "https://wikipedia.org/wiki/HMAC"; this.infoURL = "https://wikipedia.org/wiki/HMAC";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -20,7 +20,7 @@ class Keccak extends Operation {
super(); super();
this.name = "Keccak"; this.name = "Keccak";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The Keccak hash algorithm was designed by Guido Bertoni, Joan Daemen, Micha\xebl Peeters, and Gilles Van Assche, building upon RadioGat\xfan. It was selected as the winner of the SHA-3 design competition.<br><br>This version of the algorithm is Keccak[c=2d] and differs from the SHA-3 specification."; this.description = "The Keccak hash algorithm was designed by Guido Bertoni, Joan Daemen, Micha\xebl Peeters, and Gilles Van Assche, building upon RadioGat\xfan. It was selected as the winner of the SHA-3 design competition.<br><br>This version of the algorithm is Keccak[c=2d] and differs from the SHA-3 specification.";
this.infoURL = "https://wikipedia.org/wiki/SHA-3"; this.infoURL = "https://wikipedia.org/wiki/SHA-3";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class MD2 extends Operation {
super(); super();
this.name = "MD2"; this.name = "MD2";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The MD2 (Message-Digest 2) algorithm is a cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers.<br><br>Although MD2 is no longer considered secure, even as of 2014, it remains in use in public key infrastructures as part of certificates generated with MD2 and RSA."; this.description = "The MD2 (Message-Digest 2) algorithm is a cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers.<br><br>Although MD2 is no longer considered secure, even as of 2014, it remains in use in public key infrastructures as part of certificates generated with MD2 and RSA.";
this.infoURL = "https://wikipedia.org/wiki/MD2_(cryptography)"; this.infoURL = "https://wikipedia.org/wiki/MD2_(cryptography)";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class MD4 extends Operation {
super(); super();
this.name = "MD4"; this.name = "MD4";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The MD4 (Message-Digest 4) algorithm is a cryptographic hash function developed by Ronald Rivest in 1990. The digest length is 128 bits. The algorithm has influenced later designs, such as the MD5, SHA-1 and RIPEMD algorithms.<br><br>The security of MD4 has been severely compromised."; this.description = "The MD4 (Message-Digest 4) algorithm is a cryptographic hash function developed by Ronald Rivest in 1990. The digest length is 128 bits. The algorithm has influenced later designs, such as the MD5, SHA-1 and RIPEMD algorithms.<br><br>The security of MD4 has been severely compromised.";
this.infoURL = "https://wikipedia.org/wiki/MD4"; this.infoURL = "https://wikipedia.org/wiki/MD4";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class MD5 extends Operation {
super(); super();
this.name = "MD5"; this.name = "MD5";
this.module = "Hashing"; this.module = "Crypto";
this.description = "MD5 (Message-Digest 5) is a widely used hash function. It has been used in a variety of security applications and is also commonly used to check the integrity of files.<br><br>However, MD5 is not collision resistant and it isn't suitable for applications like SSL/TLS certificates or digital signatures that rely on this property."; this.description = "MD5 (Message-Digest 5) is a widely used hash function. It has been used in a variety of security applications and is also commonly used to check the integrity of files.<br><br>However, MD5 is not collision resistant and it isn't suitable for applications like SSL/TLS certificates or digital signatures that rely on this property.";
this.infoURL = "https://wikipedia.org/wiki/MD5"; this.infoURL = "https://wikipedia.org/wiki/MD5";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -20,7 +20,7 @@ class MD6 extends Operation {
super(); super();
this.name = "MD6"; this.name = "MD6";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The MD6 (Message-Digest 6) algorithm is a cryptographic hash function. It uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs."; this.description = "The MD6 (Message-Digest 6) algorithm is a cryptographic hash function. It uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs.";
this.infoURL = "https://wikipedia.org/wiki/MD6"; this.infoURL = "https://wikipedia.org/wiki/MD6";
this.inputType = "string"; this.inputType = "string";

View file

@ -21,7 +21,7 @@ class ParseIPRange extends Operation {
super(); super();
this.name = "Parse IP range"; this.name = "Parse IP range";
this.module = "JSBN"; this.module = "Default";
this.description = "Given a CIDR range (e.g. <code>10.0.0.0/24</code>), hyphenated range (e.g. <code>10.0.0.0 - 10.0.1.0</code>), or a list of IPs and/or CIDR ranges (separated by a new line), this operation provides network information and enumerates all IP addresses in the range.<br><br>IPv6 is supported but will not be enumerated."; this.description = "Given a CIDR range (e.g. <code>10.0.0.0/24</code>), hyphenated range (e.g. <code>10.0.0.0 - 10.0.1.0</code>), or a list of IPs and/or CIDR ranges (separated by a new line), this operation provides network information and enumerates all IP addresses in the range.<br><br>IPv6 is supported but will not be enumerated.";
this.infoURL = "https://wikipedia.org/wiki/Subnetwork"; this.infoURL = "https://wikipedia.org/wiki/Subnetwork";
this.inputType = "string"; this.inputType = "string";

View file

@ -23,7 +23,7 @@ class ParseIPv4Header extends Operation {
super(); super();
this.name = "Parse IPv4 header"; this.name = "Parse IPv4 header";
this.module = "JSBN"; this.module = "Default";
this.description = "Given an IPv4 header, this operations parses and displays each field in an easily readable format."; this.description = "Given an IPv4 header, this operations parses and displays each field in an easily readable format.";
this.infoURL = "https://wikipedia.org/wiki/IPv4#Header"; this.infoURL = "https://wikipedia.org/wiki/IPv4#Header";
this.inputType = "string"; this.inputType = "string";

View file

@ -8,7 +8,7 @@ import Operation from "../Operation";
import Utils from "../Utils"; import Utils from "../Utils";
import OperationError from "../errors/OperationError"; import OperationError from "../errors/OperationError";
import {strToIpv6, ipv6ToStr, ipv4ToStr, IPV6_REGEX} from "../lib/IP"; import {strToIpv6, ipv6ToStr, ipv4ToStr, IPV6_REGEX} from "../lib/IP";
import BigInteger from "jsbn"; import BigNumber from "bignumber.js";
/** /**
* Parse IPv6 address operation * Parse IPv6 address operation
@ -22,7 +22,7 @@ class ParseIPv6Address extends Operation {
super(); super();
this.name = "Parse IPv6 address"; this.name = "Parse IPv6 address";
this.module = "JSBN"; this.module = "Default";
this.description = "Displays the longhand and shorthand versions of a valid IPv6 address.<br><br>Recognises all reserved ranges and parses encapsulated or tunnelled addresses including Teredo and 6to4."; this.description = "Displays the longhand and shorthand versions of a valid IPv6 address.<br><br>Recognises all reserved ranges and parses encapsulated or tunnelled addresses including Teredo and 6to4.";
this.infoURL = "https://wikipedia.org/wiki/IPv6_address"; this.infoURL = "https://wikipedia.org/wiki/IPv6_address";
this.inputType = "string"; this.inputType = "string";
@ -147,7 +147,7 @@ class ParseIPv6Address extends Operation {
const v4Addr = ipv4ToStr((ipv6[1] << 16) + ipv6[2]), const v4Addr = ipv4ToStr((ipv6[1] << 16) + ipv6[2]),
slaId = ipv6[3], slaId = ipv6[3],
interfaceIdStr = ipv6[4].toString(16) + ipv6[5].toString(16) + ipv6[6].toString(16) + ipv6[7].toString(16), interfaceIdStr = ipv6[4].toString(16) + ipv6[5].toString(16) + ipv6[6].toString(16) + ipv6[7].toString(16),
interfaceId = new BigInteger(interfaceIdStr, 16); interfaceId = new BigNumber(interfaceIdStr, 16);
output += "\n\nEncapsulated IPv4 address: " + v4Addr + output += "\n\nEncapsulated IPv4 address: " + v4Addr +
"\nSLA ID: " + slaId + "\nSLA ID: " + slaId +

View file

@ -0,0 +1,107 @@
/**
* @author j433866 [j433866@gmail.com]
* @copyright Crown Copyright 2018
* @license Apache-2.0
*/
import Operation from "../Operation";
import OperationError from "../errors/OperationError";
import Magic from "../lib/Magic";
import jsqr from "jsqr";
import jimp from "jimp";
/**
* Parse QR Code operation
*/
class ParseQRCode extends Operation {
/**
* ParseQRCode constructor
*/
constructor() {
super();
this.name = "Parse QR Code";
this.module = "Image";
this.description = "Reads an image file and attempts to detect and read a Quick Response (QR) code from the image.<br><br><u>Normalise Image</u><br>Attempts to normalise the image before parsing it to improve detection of a QR code.";
this.infoURL = "https://wikipedia.org/wiki/QR_code";
this.inputType = "byteArray";
this.outputType = "string";
this.args = [
{
"name": "Normalise image",
"type": "boolean",
"value": false
}
];
}
/**
* @param {byteArray} input
* @param {Object[]} args
* @returns {string}
*/
async run(input, args) {
const type = Magic.magicFileType(input);
const [normalise] = args;
// Make sure that the input is an image
if (type && type.mime.indexOf("image") === 0) {
let image = input;
if (normalise) {
// Process the image to be easier to read by jsqr
// Disables the alpha channel
// Sets the image default background to white
// Normalises the image colours
// Makes the image greyscale
// Converts image to a JPEG
image = await new Promise((resolve, reject) => {
jimp.read(Buffer.from(input))
.then(image => {
image
.rgba(false)
.background(0xFFFFFFFF)
.normalize()
.greyscale()
.getBuffer(jimp.MIME_JPEG, (error, result) => {
resolve(result);
});
})
.catch(err => {
reject(new OperationError("Error reading the image file."));
});
});
}
if (image instanceof OperationError) {
throw image;
}
return new Promise((resolve, reject) => {
jimp.read(Buffer.from(image))
.then(image => {
if (image.bitmap != null) {
const qrData = jsqr(image.bitmap.data, image.getWidth(), image.getHeight());
if (qrData != null) {
resolve(qrData.data);
} else {
reject(new OperationError("Couldn't read a QR code from the image."));
}
} else {
reject(new OperationError("Error reading the image file."));
}
})
.catch(err => {
reject(new OperationError("Error reading the image file."));
});
});
} else {
throw new OperationError("Invalid file type.");
}
}
}
export default ParseQRCode;

View file

@ -181,8 +181,8 @@ class ParseX509Certificate extends Operation {
Serial number: ${new r.BigInteger(sn, 16).toString()} (0x${sn}) Serial number: ${new r.BigInteger(sn, 16).toString()} (0x${sn})
Algorithm ID: ${cert.getSignatureAlgorithmField()} Algorithm ID: ${cert.getSignatureAlgorithmField()}
Validity Validity
Not Before: ${nbDate} (dd-mm-yy hh:mm:ss) (${cert.getNotBefore()}) Not Before: ${nbDate} (dd-mm-yyyy hh:mm:ss) (${cert.getNotBefore()})
Not After: ${naDate} (dd-mm-yy hh:mm:ss) (${cert.getNotAfter()}) Not After: ${naDate} (dd-mm-yyyy hh:mm:ss) (${cert.getNotAfter()})
Issuer Issuer
${issuerStr} ${issuerStr}
Subject Subject
@ -206,12 +206,15 @@ ${extensions}`;
* @returns {string} * @returns {string}
*/ */
function formatDate (dateStr) { function formatDate (dateStr) {
return dateStr[4] + dateStr[5] + "/" + if (dateStr.length === 13) { // UTC Time
dateStr[2] + dateStr[3] + "/" + dateStr = (dateStr[0] < "5" ? "20" : "19") + dateStr;
dateStr[0] + dateStr[1] + " " + }
dateStr[6] + dateStr[7] + ":" + return dateStr[6] + dateStr[7] + "/" +
dateStr[4] + dateStr[5] + "/" +
dateStr[0] + dateStr[1] + dateStr[2] + dateStr[3] + " " +
dateStr[8] + dateStr[9] + ":" + dateStr[8] + dateStr[9] + ":" +
dateStr[10] + dateStr[11]; dateStr[10] + dateStr[11] + ":" +
dateStr[12] + dateStr[13];
} }
export default ParseX509Certificate; export default ParseX509Certificate;

View file

@ -19,7 +19,7 @@ class RIPEMD extends Operation {
super(); super();
this.name = "RIPEMD"; this.name = "RIPEMD";
this.module = "Hashing"; this.module = "Crypto";
this.description = "RIPEMD (RACE Integrity Primitives Evaluation Message Digest) is a family of cryptographic hash functions developed in Leuven, Belgium, by Hans Dobbertin, Antoon Bosselaers and Bart Preneel at the COSIC research group at the Katholieke Universiteit Leuven, and first published in 1996.<br><br>RIPEMD was based upon the design principles used in MD4, and is similar in performance to the more popular SHA-1.<br><br>"; this.description = "RIPEMD (RACE Integrity Primitives Evaluation Message Digest) is a family of cryptographic hash functions developed in Leuven, Belgium, by Hans Dobbertin, Antoon Bosselaers and Bart Preneel at the COSIC research group at the Katholieke Universiteit Leuven, and first published in 1996.<br><br>RIPEMD was based upon the design principles used in MD4, and is similar in performance to the more popular SHA-1.<br><br>";
this.infoURL = "https://wikipedia.org/wiki/RIPEMD"; this.infoURL = "https://wikipedia.org/wiki/RIPEMD";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class SHA0 extends Operation {
super(); super();
this.name = "SHA0"; this.name = "SHA0";
this.module = "Hashing"; this.module = "Crypto";
this.description = "SHA-0 is a retronym applied to the original version of the 160-bit hash function published in 1993 under the name 'SHA'. It was withdrawn shortly after publication due to an undisclosed 'significant flaw' and replaced by the slightly revised version SHA-1."; this.description = "SHA-0 is a retronym applied to the original version of the 160-bit hash function published in 1993 under the name 'SHA'. It was withdrawn shortly after publication due to an undisclosed 'significant flaw' and replaced by the slightly revised version SHA-1.";
this.infoURL = "https://wikipedia.org/wiki/SHA-1#SHA-0"; this.infoURL = "https://wikipedia.org/wiki/SHA-1#SHA-0";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class SHA1 extends Operation {
super(); super();
this.name = "SHA1"; this.name = "SHA1";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The SHA (Secure Hash Algorithm) hash functions were designed by the NSA. SHA-1 is the most established of the existing SHA hash functions and it is used in a variety of security applications and protocols.<br><br>However, SHA-1's collision resistance has been weakening as new attacks are discovered or improved."; this.description = "The SHA (Secure Hash Algorithm) hash functions were designed by the NSA. SHA-1 is the most established of the existing SHA hash functions and it is used in a variety of security applications and protocols.<br><br>However, SHA-1's collision resistance has been weakening as new attacks are discovered or improved.";
this.infoURL = "https://wikipedia.org/wiki/SHA-1"; this.infoURL = "https://wikipedia.org/wiki/SHA-1";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class SHA2 extends Operation {
super(); super();
this.name = "SHA2"; this.name = "SHA2";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The SHA-2 (Secure Hash Algorithm 2) hash functions were designed by the NSA. SHA-2 includes significant changes from its predecessor, SHA-1. The SHA-2 family consists of hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA224, SHA256, SHA384, SHA512.<br><br><ul><li>SHA-512 operates on 64-bit words.</li><li>SHA-256 operates on 32-bit words.</li><li>SHA-384 is largely identical to SHA-512 but is truncated to 384 bytes.</li><li>SHA-224 is largely identical to SHA-256 but is truncated to 224 bytes.</li><li>SHA-512/224 and SHA-512/256 are truncated versions of SHA-512, but the initial values are generated using the method described in Federal Information Processing Standards (FIPS) PUB 180-4.</li></ul>"; this.description = "The SHA-2 (Secure Hash Algorithm 2) hash functions were designed by the NSA. SHA-2 includes significant changes from its predecessor, SHA-1. The SHA-2 family consists of hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA224, SHA256, SHA384, SHA512.<br><br><ul><li>SHA-512 operates on 64-bit words.</li><li>SHA-256 operates on 32-bit words.</li><li>SHA-384 is largely identical to SHA-512 but is truncated to 384 bytes.</li><li>SHA-224 is largely identical to SHA-256 but is truncated to 224 bytes.</li><li>SHA-512/224 and SHA-512/256 are truncated versions of SHA-512, but the initial values are generated using the method described in Federal Information Processing Standards (FIPS) PUB 180-4.</li></ul>";
this.infoURL = "https://wikipedia.org/wiki/SHA-2"; this.infoURL = "https://wikipedia.org/wiki/SHA-2";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -20,7 +20,7 @@ class SHA3 extends Operation {
super(); super();
this.name = "SHA3"; this.name = "SHA3";
this.module = "Hashing"; this.module = "Crypto";
this.description = "The SHA-3 (Secure Hash Algorithm 3) hash functions were released by NIST on August 5, 2015. Although part of the same series of standards, SHA-3 is internally quite different from the MD5-like structure of SHA-1 and SHA-2.<br><br>SHA-3 is a subset of the broader cryptographic primitive family Keccak designed by Guido Bertoni, Joan Daemen, Micha\xebl Peeters, and Gilles Van Assche, building upon RadioGat\xfan."; this.description = "The SHA-3 (Secure Hash Algorithm 3) hash functions were released by NIST on August 5, 2015. Although part of the same series of standards, SHA-3 is internally quite different from the MD5-like structure of SHA-1 and SHA-2.<br><br>SHA-3 is a subset of the broader cryptographic primitive family Keccak designed by Guido Bertoni, Joan Daemen, Micha\xebl Peeters, and Gilles Van Assche, building upon RadioGat\xfan.";
this.infoURL = "https://wikipedia.org/wiki/SHA-3"; this.infoURL = "https://wikipedia.org/wiki/SHA-3";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class SSDEEP extends Operation {
super(); super();
this.name = "SSDEEP"; this.name = "SSDEEP";
this.module = "Hashing"; this.module = "Crypto";
this.description = "SSDEEP is a program for computing context triggered piecewise hashes (CTPH). Also called fuzzy hashes, CTPH can match inputs that have homologies. Such inputs have sequences of identical bytes in the same order, although bytes in between these sequences may be different in both content and length.<br><br>SSDEEP hashes are now widely used for simple identification purposes (e.g. the 'Basic Properties' section in VirusTotal). Although 'better' fuzzy hashes are available, SSDEEP is still one of the primary choices because of its speed and being a de facto standard.<br><br>This operation is fundamentally the same as the CTPH operation, however their outputs differ in format."; this.description = "SSDEEP is a program for computing context triggered piecewise hashes (CTPH). Also called fuzzy hashes, CTPH can match inputs that have homologies. Such inputs have sequences of identical bytes in the same order, although bytes in between these sequences may be different in both content and length.<br><br>SSDEEP hashes are now widely used for simple identification purposes (e.g. the 'Basic Properties' section in VirusTotal). Although 'better' fuzzy hashes are available, SSDEEP is still one of the primary choices because of its speed and being a de facto standard.<br><br>This operation is fundamentally the same as the CTPH operation, however their outputs differ in format.";
this.infoURL = "https://forensicswiki.org/wiki/Ssdeep"; this.infoURL = "https://forensicswiki.org/wiki/Ssdeep";
this.inputType = "string"; this.inputType = "string";

View file

@ -21,7 +21,7 @@ class Scrypt extends Operation {
super(); super();
this.name = "Scrypt"; this.name = "Scrypt";
this.module = "Hashing"; this.module = "Crypto";
this.description = "scrypt is a password-based key derivation function (PBKDF) created by Colin Percival. The algorithm was specifically designed to make it costly to perform large-scale custom hardware attacks by requiring large amounts of memory. In 2016, the scrypt algorithm was published by IETF as RFC 7914.<br><br>Enter the password in the input to generate its hash."; this.description = "scrypt is a password-based key derivation function (PBKDF) created by Colin Percival. The algorithm was specifically designed to make it costly to perform large-scale custom hardware attacks by requiring large amounts of memory. In 2016, the scrypt algorithm was published by IETF as RFC 7914.<br><br>Enter the password in the input to generate its hash.";
this.infoURL = "https://wikipedia.org/wiki/Scrypt"; this.infoURL = "https://wikipedia.org/wiki/Scrypt";
this.inputType = "string"; this.inputType = "string";

View file

@ -20,7 +20,7 @@ class Shake extends Operation {
super(); super();
this.name = "Shake"; this.name = "Shake";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Shake is an Extendable Output Function (XOF) of the SHA-3 hash algorithm, part of the Keccak family, allowing for variable output length/size."; this.description = "Shake is an Extendable Output Function (XOF) of the SHA-3 hash algorithm, part of the Keccak family, allowing for variable output length/size.";
this.infoURL = "https://wikipedia.org/wiki/SHA-3#Instances"; this.infoURL = "https://wikipedia.org/wiki/SHA-3#Instances";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -19,7 +19,7 @@ class Snefru extends Operation {
super(); super();
this.name = "Snefru"; this.name = "Snefru";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Snefru is a cryptographic hash function invented by Ralph Merkle in 1990 while working at Xerox PARC. The function supports 128-bit and 256-bit output. It was named after the Egyptian Pharaoh Sneferu, continuing the tradition of the Khufu and Khafre block ciphers.<br><br>The original design of Snefru was shown to be insecure by Eli Biham and Adi Shamir who were able to use differential cryptanalysis to find hash collisions. The design was then modified by increasing the number of iterations of the main pass of the algorithm from two to eight."; this.description = "Snefru is a cryptographic hash function invented by Ralph Merkle in 1990 while working at Xerox PARC. The function supports 128-bit and 256-bit output. It was named after the Egyptian Pharaoh Sneferu, continuing the tradition of the Khufu and Khafre block ciphers.<br><br>The original design of Snefru was shown to be insecure by Eli Biham and Adi Shamir who were able to use differential cryptanalysis to find hash collisions. The design was then modified by increasing the number of iterations of the main pass of the algorithm from two to eight.";
this.infoURL = "https://wikipedia.org/wiki/Snefru"; this.infoURL = "https://wikipedia.org/wiki/Snefru";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -26,12 +26,12 @@ class Split extends Operation {
this.args = [ this.args = [
{ {
"name": "Split delimiter", "name": "Split delimiter",
"type": "editableOption", "type": "editableOptionShort",
"value": SPLIT_DELIM_OPTIONS "value": SPLIT_DELIM_OPTIONS
}, },
{ {
"name": "Join delimiter", "name": "Join delimiter",
"type": "editableOption", "type": "editableOptionShort",
"value": JOIN_DELIM_OPTIONS "value": JOIN_DELIM_OPTIONS
} }
]; ];

View file

@ -0,0 +1,105 @@
/**
* @author Matt C [matt@artemisbot.uk]
* @copyright Crown Copyright 2018
* @license Apache-2.0
*/
import Operation from "../Operation";
import OperationError from "../errors/OperationError";
import Utils from "../Utils";
import Magic from "../lib/Magic";
import jimp from "jimp";
/**
* Split Colour Channels operation
*/
class SplitColourChannels extends Operation {
/**
* SplitColourChannels constructor
*/
constructor() {
super();
this.name = "Split Colour Channels";
this.module = "Image";
this.description = "Splits the given image into its red, green and blue colour channels.";
this.infoURL = "https://wikipedia.org/wiki/Channel_(digital_image)";
this.inputType = "byteArray";
this.outputType = "List<File>";
this.presentType = "html";
this.args = [];
}
/**
* @param {byteArray} input
* @param {Object[]} args
* @returns {List<File>}
*/
async run(input, args) {
const type = Magic.magicFileType(input);
// Make sure that the input is an image
if (type && type.mime.indexOf("image") === 0) {
const parsedImage = await jimp.read(Buffer.from(input));
const red = new Promise(async (resolve, reject) => {
try {
const split = parsedImage
.clone()
.color([
{apply: "blue", params: [-255]},
{apply: "green", params: [-255]}
])
.getBufferAsync(jimp.MIME_PNG);
resolve(new File([new Uint8Array((await split).values())], "red.png", {type: "image/png"}));
} catch (err) {
reject(new OperationError(`Could not split red channel: ${err}`));
}
});
const green = new Promise(async (resolve, reject) => {
try {
const split = parsedImage.clone()
.color([
{apply: "red", params: [-255]},
{apply: "blue", params: [-255]},
]).getBufferAsync(jimp.MIME_PNG);
resolve(new File([new Uint8Array((await split).values())], "green.png", {type: "image/png"}));
} catch (err) {
reject(new OperationError(`Could not split green channel: ${err}`));
}
});
const blue = new Promise(async (resolve, reject) => {
try {
const split = parsedImage
.color([
{apply: "red", params: [-255]},
{apply: "green", params: [-255]},
]).getBufferAsync(jimp.MIME_PNG);
resolve(new File([new Uint8Array((await split).values())], "blue.png", {type: "image/png"}));
} catch (err) {
reject(new OperationError(`Could not split blue channel: ${err}`));
}
});
return await Promise.all([red, green, blue]);
} else {
throw new OperationError("Invalid file type.");
}
}
/**
* Displays the files in HTML for web apps.
*
* @param {File[]} files
* @returns {html}
*/
async present(files) {
return await Utils.displayFilesAsHTML(files);
}
}
export default SplitColourChannels;

View file

@ -19,7 +19,7 @@ class TCPIPChecksum extends Operation {
super(); super();
this.name = "TCP/IP Checksum"; this.name = "TCP/IP Checksum";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Calculates the checksum for a TCP (Transport Control Protocol) or IP (Internet Protocol) header from an input of raw bytes."; this.description = "Calculates the checksum for a TCP (Transport Control Protocol) or IP (Internet Protocol) header from an input of raw bytes.";
this.infoURL = "https://wikipedia.org/wiki/IPv4_header_checksum"; this.infoURL = "https://wikipedia.org/wiki/IPv4_header_checksum";
this.inputType = "byteArray"; this.inputType = "byteArray";

View file

@ -22,7 +22,7 @@ class TextEncodingBruteForce extends Operation {
super(); super();
this.name = "Text Encoding Brute Force"; this.name = "Text Encoding Brute Force";
this.module = "CharEnc"; this.module = "Encodings";
this.description = [ this.description = [
"Enumerates all supported text encodings for the input, allowing you to quickly spot the correct one.", "Enumerates all supported text encodings for the input, allowing you to quickly spot the correct one.",
"<br><br>", "<br><br>",

View file

@ -19,7 +19,7 @@ class ToGeohash extends Operation {
super(); super();
this.name = "To Geohash"; this.name = "To Geohash";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Converts Lat/Long coordinates into a Geohash string. For example, <code>37.8324,112.5584</code> becomes <code>ww8p1r4t8</code>."; this.description = "Converts Lat/Long coordinates into a Geohash string. For example, <code>37.8324,112.5584</code> becomes <code>ww8p1r4t8</code>.";
this.infoURL = "https://wikipedia.org/wiki/Geohash"; this.infoURL = "https://wikipedia.org/wiki/Geohash";
this.inputType = "string"; this.inputType = "string";

View file

@ -5,7 +5,7 @@
*/ */
import Operation from "../Operation"; import Operation from "../Operation";
import OperationError from "../errors/OperationError.mjs"; import OperationError from "../errors/OperationError";
import notepack from "notepack.io"; import notepack from "notepack.io";
/** /**
@ -38,7 +38,9 @@ class ToMessagePack extends Operation {
if (ENVIRONMENT_IS_WORKER()) { if (ENVIRONMENT_IS_WORKER()) {
return notepack.encode(input); return notepack.encode(input);
} else { } else {
return notepack.encode(input).buffer; const res = notepack.encode(input);
// Safely convert from Node Buffer to ArrayBuffer using the correct view of the data
return (new Uint8Array(res)).buffer;
} }
} catch (err) { } catch (err) {
throw new OperationError(`Could not encode JSON to MessagePack: ${err}`); throw new OperationError(`Could not encode JSON to MessagePack: ${err}`);

View file

@ -19,7 +19,7 @@ class Whirlpool extends Operation {
super(); super();
this.name = "Whirlpool"; this.name = "Whirlpool";
this.module = "Hashing"; this.module = "Crypto";
this.description = "Whirlpool is a cryptographic hash function designed by Vincent Rijmen (co-creator of AES) and Paulo S. L. M. Barreto, who first described it in 2000.<br><br>Several variants exist:<ul><li>Whirlpool-0 is the original version released in 2000.</li><li>Whirlpool-T is the first revision, released in 2001, improving the generation of the s-box.</li><li>Whirlpool is the latest revision, released in 2003, fixing a flaw in the difusion matrix.</li></ul>"; this.description = "Whirlpool is a cryptographic hash function designed by Vincent Rijmen (co-creator of AES) and Paulo S. L. M. Barreto, who first described it in 2000.<br><br>Several variants exist:<ul><li>Whirlpool-0 is the original version released in 2000.</li><li>Whirlpool-T is the first revision, released in 2001, improving the generation of the s-box.</li><li>Whirlpool is the latest revision, released in 2003, fixing a flaw in the difusion matrix.</li></ul>";
this.infoURL = "https://wikipedia.org/wiki/Whirlpool_(cryptography)"; this.infoURL = "https://wikipedia.org/wiki/Whirlpool_(cryptography)";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";

View file

@ -18,7 +18,7 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE. SOFTWARE.
*/ */
import Utils from "../Utils.mjs"; import Utils from "../Utils";
// Param jpeg should be a binaryArray // Param jpeg should be a binaryArray
export function removeEXIF(jpeg) { export function removeEXIF(jpeg) {

View file

@ -10,6 +10,7 @@ import Manager from "./Manager";
import HTMLCategory from "./HTMLCategory"; import HTMLCategory from "./HTMLCategory";
import HTMLOperation from "./HTMLOperation"; import HTMLOperation from "./HTMLOperation";
import Split from "split.js"; import Split from "split.js";
import moment from "moment-timezone";
/** /**
@ -515,7 +516,8 @@ class App {
setCompileMessage() { setCompileMessage() {
// Display time since last build and compile message // Display time since last build and compile message
const now = new Date(), const now = new Date(),
timeSinceCompile = Utils.fuzzyTime(now.getTime() - window.compileTime); msSinceCompile = now.getTime() - window.compileTime,
timeSinceCompile = moment.duration(msSinceCompile, "milliseconds").humanize();
// Calculate previous version to compare to // Calculate previous version to compare to
const prev = PKG_VERSION.split(".").map(n => { const prev = PKG_VERSION.split(".").map(n => {

View file

@ -26,6 +26,7 @@ class HTMLIngredient {
this.disabled = config.disabled || false; this.disabled = config.disabled || false;
this.hint = config.hint || false; this.hint = config.hint || false;
this.target = config.target; this.target = config.target;
this.defaultIndex = config.defaultIndex || 0;
this.toggleValues = config.toggleValues; this.toggleValues = config.toggleValues;
this.id = "ing-" + this.app.nextIngId(); this.id = "ing-" + this.app.nextIngId();
} }
@ -133,7 +134,7 @@ class HTMLIngredient {
} else if ((m = this.value[i].match(/\[\/([a-z0-9 -()^]+)\]/i))) { } else if ((m = this.value[i].match(/\[\/([a-z0-9 -()^]+)\]/i))) {
html += "</optgroup>"; html += "</optgroup>";
} else { } else {
html += `<option>${this.value[i]}</option>`; html += `<option ${this.defaultIndex === i ? "selected" : ""}>${this.value[i]}</option>`;
} }
} }
html += `</select> html += `</select>
@ -154,7 +155,7 @@ class HTMLIngredient {
} else if ((m = this.value[i].name.match(/\[\/([a-z0-9 -()^]+)\]/i))) { } else if ((m = this.value[i].name.match(/\[\/([a-z0-9 -()^]+)\]/i))) {
html += "</optgroup>"; html += "</optgroup>";
} else { } else {
html += `<option populate-value='${this.value[i].value}'>${this.value[i].name}</option>`; html += `<option populate-value="${this.value[i].value}">${this.value[i].name}</option>`;
} }
} }
html += `</select> html += `</select>
@ -164,13 +165,42 @@ class HTMLIngredient {
this.manager.addDynamicListener("#" + this.id, "change", this.populateOptionChange, this); this.manager.addDynamicListener("#" + this.id, "change", this.populateOptionChange, this);
break; break;
case "editableOption": case "editableOption":
html += `<div class="form-group input-group">
<label for="${this.id}" class="bmd-label-floating">${this.name}</label>
<input type="text"
class="form-control arg"
id="${this.id}"
arg-name="${this.name}"
value="${this.value[this.defaultIndex].value}"
${this.disabled ? "disabled" : ""}>
${this.hint ? "<span class='bmd-help'>" + this.hint + "</span>" : ""}
<div class="input-group-append">
<button type="button"
class="btn btn-secondary dropdown-toggle dropdown-toggle-split"
data-toggle="dropdown"
data-boundary="scrollParent"
aria-haspopup="true"
aria-expanded="false">
<span class="sr-only">Toggle Dropdown</span>
</button>
<div class="dropdown-menu editable-option-menu">`;
for (i = 0; i < this.value.length; i++) {
html += `<a class="dropdown-item" href="#" value="${this.value[i].value}">${this.value[i].name}</a>`;
}
html += `</div>
</div>
</div>`;
this.manager.addDynamicListener(".editable-option-menu a", "click", this.editableOptionClick, this);
break;
case "editableOptionShort":
html += `<div class="form-group input-group inline"> html += `<div class="form-group input-group inline">
<label for="${this.id}" class="bmd-label-floating inline">${this.name}</label> <label for="${this.id}" class="bmd-label-floating inline">${this.name}</label>
<input type="text" <input type="text"
class="form-control arg inline" class="form-control arg inline"
id="${this.id}" id="${this.id}"
arg-name="${this.name}" arg-name="${this.name}"
value="${this.value[0].value}" value="${this.value[this.defaultIndex].value}"
${this.disabled ? "disabled" : ""}> ${this.disabled ? "disabled" : ""}>
${this.hint ? "<span class='bmd-help'>" + this.hint + "</span>" : ""} ${this.hint ? "<span class='bmd-help'>" + this.hint + "</span>" : ""}
<div class="input-group-append inline"> <div class="input-group-append inline">

View file

@ -15,7 +15,7 @@
width: 100%; width: 100%;
height: var(--controls-height); height: var(--controls-height);
bottom: 0; bottom: 0;
padding: 10px; padding: 0;
padding-top: 12px; padding-top: 12px;
border-top: 1px solid var(--primary-border-colour); border-top: 1px solid var(--primary-border-colour);
background-color: var(--secondary-background-colour); background-color: var(--secondary-background-colour);

182
tests/browser/nightwatch.js Normal file
View file

@ -0,0 +1,182 @@
/**
* Tests to ensure that the app loads correctly in a reasonable time and that operations can be run.
*
* @author n1474335 [n1474335@gmail.com]
* @copyright Crown Copyright 2018
* @license Apache-2.0
*/
module.exports = {
before: browser => {
browser
.resizeWindow(1280, 800)
.url(browser.launchUrl);
},
"Loading screen": browser => {
// Check that the loading screen appears and then disappears within a reasonable time
browser
.waitForElementVisible("#preloader", 300)
.waitForElementNotPresent("#preloader", 10000);
},
"App loaded": browser => {
browser.useCss();
// Check that various important elements are loaded
browser.expect.element("#operations").to.be.visible;
browser.expect.element("#recipe").to.be.visible;
browser.expect.element("#input").to.be.present;
browser.expect.element("#output").to.be.present;
browser.expect.element(".op-list").to.be.present;
browser.expect.element("#rec-list").to.be.visible;
browser.expect.element("#controls").to.be.visible;
browser.expect.element("#input-text").to.be.visible;
browser.expect.element("#output-text").to.be.visible;
},
"Operations loaded": browser => {
browser.useXpath();
// Check that an operation in every category has been populated
browser.expect.element("//li[contains(@class, 'operation') and text()='To Base64']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='To Binary']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='AES Decrypt']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='PEM to Hex']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Power Set']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Parse IP range']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Remove Diacritics']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Sort']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='To UNIX Timestamp']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Extract dates']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Gzip']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Keccak']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='JSON Beautify']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Detect File Type']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Play Media']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Disassemble x86']").to.be.present;
browser.expect.element("//li[contains(@class, 'operation') and text()='Register']").to.be.present;
},
"Recipe can be run": browser => {
const toHex = "//li[contains(@class, 'operation') and text()='To Hex']";
const op = "#rec-list .operation .op-title";
// Check that operation is visible
browser
.useXpath()
.expect.element(toHex).to.be.visible;
// Add it to the recipe by double clicking
browser
.useXpath()
.moveToElement(toHex, 10, 10)
.useCss()
.waitForElementVisible(".popover-body", 1000)
.doubleClick();
// Confirm that it has been added to the recipe
browser
.useCss()
.waitForElementVisible(op)
.expect.element(op).text.to.contain("To Hex");
// Enter input
browser
.useCss()
.setValue("#input-text", "Don't Panic.")
.click("#bake");
// Check output
browser
.useCss()
.waitForElementNotVisible("#stale-indicator", 500)
.expect.element("#output-text").to.have.value.that.equals("44 6f 6e 27 74 20 50 61 6e 69 63 2e");
// Clear recipe
browser
.useCss()
.moveToElement(op, 10, 10)
.waitForElementNotPresent(".popover-body", 1000)
.click("#clr-recipe")
.waitForElementNotPresent(op);
},
"Test every module": browser => {
browser.useCss();
// BSON
loadOp("BSON deserialise", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Ciphers
loadOp("AES Encrypt", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Code
loadOp("XPath expression", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Compression
loadOp("Gzip", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Crypto
loadOp("MD5", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Default
loadOp("Fork", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Diff
loadOp("Diff", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Encodings
loadOp("Encode text", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Image
loadOp("Extract EXIF", browser)
.waitForElementNotVisible("#output-loader", 5000);
// PGP
loadOp("PGP Encrypt", browser)
.waitForElementNotVisible("#output-loader", 5000);
// PublicKey
loadOp("Hex to PEM", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Regex
loadOp("Strings", browser)
.waitForElementNotVisible("#output-loader", 5000);
// Shellcode
loadOp("Disassemble x86", browser)
.waitForElementNotVisible("#output-loader", 5000);
// URL
loadOp("URL Encode", browser)
.waitForElementNotVisible("#output-loader", 5000);
// UserAgent
loadOp("Parse User Agent", browser)
.waitForElementNotVisible("#output-loader", 5000);
},
after: browser => {
browser.end();
}
};
/**
* Clears the current recipe and loads a new operation.
*
* @param {string} opName
* @param {Browser} browser
*/
function loadOp(opName, browser) {
return browser
.useCss()
.click("#clr-recipe")
.urlHash("op=" + opName);
}

View file

@ -9,7 +9,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import Chef from "../src/core/Chef"; import Chef from "../../src/core/Chef";
/** /**
* Object to store and run the list of tests. * Object to store and run the list of tests.

View file

@ -24,63 +24,67 @@ global.ENVIRONMENT_IS_WEB = function() {
}; };
import TestRegister from "./TestRegister"; import TestRegister from "./TestRegister";
import "./tests/operations/BCD"; import "./tests/BCD";
import "./tests/operations/BSON"; import "./tests/BSON";
import "./tests/operations/Base58"; import "./tests/Base58";
import "./tests/operations/Base64"; import "./tests/Base64";
import "./tests/operations/Base62"; import "./tests/Base62";
import "./tests/operations/BitwiseOp"; import "./tests/BitwiseOp";
import "./tests/operations/ByteRepr"; import "./tests/ByteRepr";
import "./tests/operations/CartesianProduct"; import "./tests/CartesianProduct";
import "./tests/operations/CharEnc"; import "./tests/CharEnc";
import "./tests/operations/Checksum"; import "./tests/Checksum";
import "./tests/operations/Ciphers"; import "./tests/Ciphers";
import "./tests/operations/Code"; import "./tests/Code";
import "./tests/operations/Comment"; import "./tests/Comment";
import "./tests/operations/Compress"; import "./tests/Compress";
import "./tests/operations/ConditionalJump"; import "./tests/ConditionalJump";
import "./tests/operations/Crypt"; import "./tests/Crypt";
import "./tests/operations/CSV"; import "./tests/CSV";
import "./tests/operations/DateTime"; import "./tests/DateTime";
import "./tests/operations/ExtractEmailAddresses"; import "./tests/ExtractEmailAddresses";
import "./tests/operations/Fork"; import "./tests/Fork";
import "./tests/operations/FromDecimal"; import "./tests/FromDecimal";
import "./tests/operations/FromGeohash"; import "./tests/FromGeohash";
import "./tests/operations/Hash"; import "./tests/Hash";
import "./tests/operations/HaversineDistance"; import "./tests/HaversineDistance";
import "./tests/operations/Hexdump"; import "./tests/Hexdump";
import "./tests/operations/Image"; import "./tests/Image";
import "./tests/operations/Jump"; import "./tests/Jump";
import "./tests/operations/JSONBeautify"; import "./tests/JSONBeautify";
import "./tests/operations/JSONMinify"; import "./tests/JSONMinify";
import "./tests/operations/JWTDecode"; import "./tests/JWTDecode";
import "./tests/operations/JWTSign"; import "./tests/JWTSign";
import "./tests/operations/JWTVerify"; import "./tests/JWTVerify";
import "./tests/operations/MS"; import "./tests/MS";
import "./tests/operations/Magic"; import "./tests/Magic";
import "./tests/operations/MorseCode"; import "./tests/MorseCode";
import "./tests/operations/NetBIOS"; import "./tests/NetBIOS";
import "./tests/operations/OTP"; import "./tests/OTP";
import "./tests/operations/PGP"; import "./tests/PGP";
import "./tests/operations/PHP"; import "./tests/PHP";
import "./tests/operations/ParseIPRange"; import "./tests/ParseIPRange";
import "./tests/operations/PowerSet"; import "./tests/ParseQRCode";
import "./tests/operations/Regex"; import "./tests/PowerSet";
import "./tests/operations/Register"; import "./tests/Regex";
import "./tests/operations/RemoveDiacritics"; import "./tests/Register";
import "./tests/operations/Rotate"; import "./tests/RemoveDiacritics";
import "./tests/operations/SeqUtils"; import "./tests/Rotate";
import "./tests/operations/SetDifference"; import "./tests/SeqUtils";
import "./tests/operations/SetIntersection"; import "./tests/SetDifference";
import "./tests/operations/SetUnion"; import "./tests/SetIntersection";
import "./tests/operations/StrUtils"; import "./tests/SetUnion";
import "./tests/operations/SymmetricDifference"; import "./tests/StrUtils";
import "./tests/operations/TextEncodingBruteForce"; import "./tests/SymmetricDifference";
import "./tests/operations/ToGeohash.mjs"; import "./tests/TextEncodingBruteForce";
import "./tests/operations/TranslateDateTimeFormat"; import "./tests/ToGeohash";
import "./tests/operations/Magic"; import "./tests/TranslateDateTimeFormat";
import "./tests/operations/ParseTLV"; import "./tests/Magic";
import "./tests/operations/Media"; import "./tests/ParseTLV";
import "./tests/Media";
// Cannot test operations that use the File type yet
//import "./tests/SplitColourChannels";
import "./tests/nodeApi/nodeApi"; import "./tests/nodeApi/nodeApi";
import "./tests/nodeApi/ops"; import "./tests/nodeApi/ops";
@ -163,7 +167,8 @@ Promise.all([
} }
if (!allTestsPassing) { if (!allTestsPassing) {
console.log("\nNot all tests are passing"); console.log("\nFailing tests:\n");
results.filter(r => r.status !== "passing").forEach(handleTestResult);
} }
console.log(`Tests took ${(finish - start) / 1000} seconds`); console.log(`Tests took ${(finish - start) / 1000} seconds`);

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -7,7 +7,7 @@
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
const ALL_BYTES = [ const ALL_BYTES = [
"\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f", "\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f",

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
const ALL_BYTES = [ const ALL_BYTES = [
"\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f", "\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f",

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
const EXAMPLE_CSV = `A,B,C,D,E,F\r const EXAMPLE_CSV = `A,B,C,D,E,F\r
1,2,3,4,5,6\r 1,2,3,4,5,6\r

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
const BASIC_STRING = "The ships hung in the sky in much the same way that bricks don't."; const BASIC_STRING = "The ships hung in the sky in much the same way that bricks don't.";
const UTF8_STR = "ნუ პანიკას"; const UTF8_STR = "ნუ პანიკას";

View file

@ -7,7 +7,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([

View file

@ -7,7 +7,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
const JSON_TEST_DATA = { const JSON_TEST_DATA = {
"store": { "store": {
@ -335,15 +335,11 @@ TestRegister.addTests([
{ {
name: "To MessagePack: no content", name: "To MessagePack: no content",
input: "", input: "",
expectedError: true, expectedMatch: /Unexpected end of JSON input/,
recipeConfig: [ recipeConfig: [
{ {
"op": "To MessagePack", "op": "To MessagePack",
"args": [] "args": []
},
{
"op": "To Hex",
"args": ["Space"]
} }
] ]
}, },

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
const ALL_BYTES = [ const ALL_BYTES = [
"\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f", "\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f",

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
/** /**

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @licence Apache-2.0 * @licence Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -5,7 +5,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

View file

@ -6,7 +6,7 @@
* @copyright Crown Copyright 2018 * @copyright Crown Copyright 2018
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
const ALL_BYTES = [ const ALL_BYTES = [
"\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f", "\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f",

View file

@ -7,7 +7,7 @@
* @copyright Crown Copyright 2017 * @copyright Crown Copyright 2017
* @license Apache-2.0 * @license Apache-2.0
*/ */
import TestRegister from "../../TestRegister"; import TestRegister from "../TestRegister";
TestRegister.addTests([ TestRegister.addTests([
{ {

Some files were not shown because too many files have changed in this diff Show more