mirror of
https://github.com/gchq/CyberChef.git
synced 2025-04-26 01:36:17 -04:00
Added Fletcher-8, -32 and -64 checksum operations. Closes #51.
This commit is contained in:
parent
cddd349090
commit
3c3f5d9dcd
9 changed files with 120 additions and 45 deletions
|
@ -226,7 +226,10 @@ var Categories = [
|
|||
"SHA3",
|
||||
"RIPEMD-160",
|
||||
"HMAC",
|
||||
"Fletcher-8 Checksum",
|
||||
"Fletcher-16 Checksum",
|
||||
"Fletcher-32 Checksum",
|
||||
"Fletcher-64 Checksum",
|
||||
"Adler-32 Checksum",
|
||||
"CRC-32 Checksum",
|
||||
"TCP/IP Checksum",
|
||||
|
|
|
@ -2642,6 +2642,13 @@ var OperationConfig = {
|
|||
},
|
||||
]
|
||||
},
|
||||
"Fletcher-8 Checksum": {
|
||||
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.",
|
||||
run: Checksum.run_fletcher8,
|
||||
input_type: "byte_array",
|
||||
output_type: "string",
|
||||
args: []
|
||||
},
|
||||
"Fletcher-16 Checksum": {
|
||||
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.",
|
||||
run: Checksum.run_fletcher16,
|
||||
|
@ -2649,6 +2656,20 @@ var OperationConfig = {
|
|||
output_type: "string",
|
||||
args: []
|
||||
},
|
||||
"Fletcher-32 Checksum": {
|
||||
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.",
|
||||
run: Checksum.run_fletcher32,
|
||||
input_type: "byte_array",
|
||||
output_type: "string",
|
||||
args: []
|
||||
},
|
||||
"Fletcher-64 Checksum": {
|
||||
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.",
|
||||
run: Checksum.run_fletcher64,
|
||||
input_type: "byte_array",
|
||||
output_type: "string",
|
||||
args: []
|
||||
},
|
||||
"Adler-32 Checksum": {
|
||||
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.",
|
||||
run: Checksum.run_adler32,
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue