Password-Protected Numeric Info Encryptor v1: ~ Use this tool to secure all your confidential info! ~ Only those who know the EXACT password can decrypt the numerical string of an Encrypted Code. ~ Double-encryption (or even more) is possible. You would need to save a code & memorize 2 passwords. ~ Joining different Encrypted Codes that share the same password into one long code is possible. It can still be unencrypted. ~ Please comment any feedback or questions. ~ Inappropriate comments will be deleted/reported. ~ Supports max 68 character-binds in "# key" list. ~ Unfortunately, uppercase letters are not supported & the password input is not case-sensitive. ~ The algorithm, coding, & design are fully original. Last updated: May 10, 2025 ~ Fixed a flaw where Scratch's division block auto-rounded quotients to codes divided by similar passwords to the correct one, allowing those wrong passwords to work. Encryption process brief explanation: 1. Each letter from the text input is converted to a 2-digit number using the character-binds in the "# key". 2. Step 1 is repeated for the password input as well. 3. Each 2-digit number from the text in Step 1 is then multiplied by the entire numerical string of the converted password. 4. Numbers from all Step 3 outputs are strung together in order to produce the finalized Encrypted Code. Decryption process brief explanation: 1. Character-length of both the Encrypted Code and the Password are counted. 2. Code length is divided by the sum of Password length & digit-length per character from "# Key" (which is 2 by default) to figure out the character length of the original text. 3. Same as Step 2 from the Encryption process, the password input is converted into a string of 2-digit numbers. 4. Each number set (with the length the sum of Password length & digit-length) corresponding to each character (in order from the Encrypted Code) is divided by the converted password string (from Step 3) to decrypt back to its original character. 5. Each output from Step 4 is strung together to piece back as the Decoded Text. Math to why a cap of max 68 character-binds exist: 1. Each character, when converted to a string of numbers using the "# Key", must have a length of exactly two digits, thus a max value of 99. 2. Minimum square value of a number to consist of 4 digits is 32, which is 1024, whereas 31-squared is 961. 3. Step 1 max of 99 subtracted by Step 2 min of 32 (inclusive) outputs a possible range of 68. These 68 2-digit values with 4-digit squares of themselves never change their digit length when multiplied by another value of the same range, thus easing algorithm calculations. Math to why a password cap of max 9 characters exist: 1. Scratch's maximum limit for the multiplication block is 21 digits when avoiding automatic rounding. 2. When encrypting, each converted character consists of a 2-digit number. 3. Scratch's max digit limit of 21 (from Step 1) subtracted by converted character digit-length of 2 (from Step 2) outputs 19 digits left for the converted password. 4. However, each of converted password's characters is 2 digits long, thus their entire string always has an even number of digits. 5. Rounding 19 down to 18 as the nearest even number within range then dividing it by 2 (from digit-length of each character's converted password), which outputs the max password character length of 9.
