mirror of
https://github.com/gchq/CyberChef.git
synced 2025-04-24 16:56:15 -04:00
Added 'Pseudo-Random Number Generator' operation.
This commit is contained in:
parent
f52f5a0edb
commit
a3f58fb831
4 changed files with 70 additions and 1 deletions
|
@ -99,6 +99,7 @@ const Categories = [
|
|||
"Substitute",
|
||||
"Derive PBKDF2 key",
|
||||
"Derive EVP key",
|
||||
"Pseudo-Random Number Generator",
|
||||
]
|
||||
},
|
||||
{
|
||||
|
@ -198,6 +199,7 @@ const Categories = [
|
|||
"Parse colour code",
|
||||
"Escape string",
|
||||
"Unescape string",
|
||||
"Pseudo-Random Number Generator",
|
||||
]
|
||||
},
|
||||
{
|
||||
|
@ -313,6 +315,7 @@ const Categories = [
|
|||
"Detect File Type",
|
||||
"Scan for Embedded Files",
|
||||
"Disassemble x86",
|
||||
"Pseudo-Random Number Generator",
|
||||
"Generate UUID",
|
||||
"Generate TOTP",
|
||||
"Generate HOTP",
|
||||
|
|
|
@ -1503,6 +1503,24 @@ const OperationConfig = {
|
|||
},
|
||||
]
|
||||
},
|
||||
"Pseudo-Random Number Generator": {
|
||||
module: "Ciphers",
|
||||
description: "A cryptographically-secure pseudo-random number generator (PRNG).<br><br>This operation uses the browser's built-in <code>crypto.getRandomValues()</code> method if available. If this cannot be found, it falls back to a Fortuna-based PRNG algorithm.",
|
||||
inputType: "string",
|
||||
outputType: "string",
|
||||
args: [
|
||||
{
|
||||
name: "Number of bytes",
|
||||
type: "number",
|
||||
value: Cipher.PRNG_BYTES
|
||||
},
|
||||
{
|
||||
name: "Output as",
|
||||
type: "option",
|
||||
value: Cipher.PRNG_OUTPUT
|
||||
}
|
||||
]
|
||||
},
|
||||
"Derive PBKDF2 key": {
|
||||
module: "Ciphers",
|
||||
description: "PBKDF2 is a password-based key derivation function. It is part of RSA Laboratories' Public-Key Cryptography Standards (PKCS) series, specifically PKCS #5 v2.0, also published as Internet Engineering Task Force's RFC 2898.<br><br>In many applications of cryptography, user security is ultimately dependent on a password, and because a password usually can't be used directly as a cryptographic key, some processing is required.<br><br>A salt provides a large set of keys for any given password, and an iteration count increases the cost of producing keys from a password, thereby also increasing the difficulty of attack.<br><br>If you leave the salt argument empty, a random salt will be generated.",
|
||||
|
|
|
@ -38,6 +38,7 @@ OpModules.Ciphers = {
|
|||
"Affine Cipher Decode": Cipher.runAffineDec,
|
||||
"Atbash Cipher": Cipher.runAtbash,
|
||||
"Substitute": Cipher.runSubstitute,
|
||||
"Pseudo-Random Number Generator": Cipher.runPRNG,
|
||||
};
|
||||
|
||||
export default OpModules;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue