mirror of
https://github.com/gchq/CyberChef.git
synced 2024-11-02 14:11:02 +01:00
Generates both the checksum and checkdigit.
This commit is contained in:
parent
940b56ba5f
commit
0e40daecb6
@ -23,18 +23,19 @@ class LuhnChecksum extends Operation {
|
||||
this.description = "The Luhn algorithm, also known as the modulus 10 or mod 10 algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, Canadian Social Insurance Numbers.";
|
||||
this.infoURL = "https://wikipedia.org/wiki/Luhn_algorithm";
|
||||
this.inputType = "string";
|
||||
this.outputType = "number";
|
||||
this.outputType = "string";
|
||||
this.args = [];
|
||||
}
|
||||
|
||||
/**
|
||||
* @param {string} input
|
||||
* @param {Object[]} args
|
||||
* Generates the Luhn Checksum from the input.
|
||||
*
|
||||
* @param {string} inputStr
|
||||
* @returns {number}
|
||||
*/
|
||||
run(input, args) {
|
||||
checksum(inputStr) {
|
||||
let even = false;
|
||||
return input.split("").reverse().reduce((acc, elem) => {
|
||||
return inputStr.split("").reverse().reduce((acc, elem) => {
|
||||
|
||||
// Convert element to integer.
|
||||
let temp = parseInt(elem, 10);
|
||||
@ -57,6 +58,18 @@ class LuhnChecksum extends Operation {
|
||||
}, 0) % 10;
|
||||
}
|
||||
|
||||
/**
|
||||
* @param {string} input
|
||||
* @param {Object[]} args
|
||||
* @returns {string}
|
||||
*/
|
||||
run(input, args) {
|
||||
const checkSum = this.checksum(input).toString();
|
||||
let checkDigit = this.checksum(input+"0");
|
||||
checkDigit = (checkDigit === 0 ? 0 : (10-checkDigit)).toString();
|
||||
return "Checksum: " + checkSum + "\n\nCheckdigit: " + checkDigit + "\n\nLuhn Validated String: "+ input + checkDigit;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
export default LuhnChecksum;
|
||||
|
Loading…
Reference in New Issue
Block a user