String Manipulation
This section is intended to allow various manipulations to be applied to the input text before the cipher tools are applied. There are also some tools below the break, that are intended to be used if we are trying to encode a string, although some of them may also be useful in actual hunts.
Result:
String Conversion
This section is a series of functions that are better described as conversions of an input string, rather than an encoding or decoding process. The output of each function can be copy/pasted into the input text area, if desired, for further processing.
Text Analysis
Combined deciphering tool
Makes an attempt to figure out which cipher is used and then tries to crack it using the dictionary words as keys. Currently supports Atbash, Caesar shift, Vigenere, ROT13 and Railfence
Decoded string:
Database Lookup
This section is intended to allow search various publicly available databases for the input string.
Enter a suspected ISBN in the input, and this section will attempt to recover the Book Name, Author, Date Published and the cover image.
Result:
Morse Code
NB: The decode function needs to have the proper spaces in the input string to work.
Encoded / Decoded string:
Atbash
NB: Encoding and decoding an atbash cipher is symetrical and results in the same output string. The difference is whether the input string is in plaintext or not.
Encoded / Decoded string:
ROT13
NB: Encoding and decoding a ROT13 cipher is symmetrical and results in the same output string. The difference is whether the input string is in plaintext or in cipher.
Encoded / Decoded string:
Letter Skipper
Number of letters to skip at the beginning of string:
Number of letters to skip repeatedly:
Shift the entire skip sequence deeper into the string.:
Result:
Letters / Numbers
Select alphabet:
Select output format:
Encoded / Decoded string:
Bacon Cipher
In DECODE mode, the tool assumes that the cipher text being input is in the general format of 5 letter groups, using A amd B.The example: ABBAB AABAA BABAB AABAA BAAAB AAAAA AABBA AAAAA ABAAA ABBAB produces the cleartext 'never again'. Having no spaces or too many spaces is acceptable and will not affect the output.
NB: in the 24 letter version, J and V have been removed. Therefore I/J and U/V are interchangable.
Railfence Transposition Cipher
Number of rails:
Offset:
Maximum number of rails for guessing:
Encoded / Decoded string:
Caesar Shift
Shift:
Decoded string:
Vigenère Cipher
Beale or Book Ciphers
NOTES:
- The scripts currently work if there is a line break after each sentence. (One sentence per line) (NB: The line may wrap the input window. It doesn't matter.)
- Input text must have punctuation at the end of each sentence. ( . ? ! )
(If the text does not already have proper punctuation and should be prepared by adding periods at the end of every line, click here: ) - In situations where the cipher is invalid such as not enough words on a line, or not enough letters in a word, the script should display a # character to indicate the invalid paragraph/line/word or letter.
- Different formats of the cipher require different input formatting for the number string that
represents the ciphertext. The formatting is as follows:
simple letter/word counters are in the format 'A-B-C-D-E'.
sequential line / letter is in the format 'A-B-C-D-E' (assumes that the line order is 1,2,3,4...)
sequential line / word is in the format 'A-B-C-D-E' (assumes that the line order is 1,2,3,4...)
line / letter is in the format 'A/B-C/D-E/F-G/H' (processes line and letter)
word / letter is in the format 'A/B-C/D-E/F-G/H' (processes word and letter)
line / word is in the format 'A/B-C/D-E/F-G/H' (processes line and word)
line / word / letter is in the format 'A/B/C-D/E/F-H/I/J' (processes line order as well as word then letter)
Source Text Analyzer and Beale Decoder
Text In Text
This section will search a body of text for an input string and display all of the words found, as well
as the longest chain of words in the correct order. It will take a something like paragraph or page (or
more) of text as a SEARCH FOR input and a URL
or several hundred page input as the text TO BE SEARCHED.
Then it will break the first input down, word by word and search for it in the body of the
second. If words are found, it will then begin appending array elements to each other and search for the
phrases, until it finds the longest
possible phrase in the body.
NB: long texts take longer to process, of course. I am tring to implement a progress bar. Also,
reverse searches are considerably slower than forward searches. (Check the console for progress.)
This section is not linked to the normal text input, and both inputs should be done here.
Playfair Cipher
*** Not thoroughly tested. ***
Image Substitution Cipher
Encode
Decode
Substitution Cipher Solver
Enter letters to use in the substitution, and they will automatically be changed in the output and
removed from the list of available letters.
You can clear individual entries or all of them at once.
Unused Letters:
| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Output Text:
Periodic Table
This section will take an input in the format 22-7-39-5-92-7-28-99 as atomic numbers of elements and return: 'TiNYBUNNiEs' as an output.
Additionally, it will take an atomic weight input such as 69.7-114.8-32.0 and return GaInS. All decimal places after the 1st one should be dropped (not rounded). For example, 18.99840316 should be reduced to 18.9. In cases where the reduction of the decimal precision produces two values (208.98040 and 208.98243 become 208.9 or 247.07035 and 247.07031 become 247.0) both outputs are shown ("Bi (or Po)" or "Cm (or Bk)" in these cases). Note: The first decimal place must be included, even if it is 0. The input must be 12.0 or 14.0, not 12 and 14.
Values taken from here: https://pubchem.ncbi.nlm.nih.gov/periodic-table/
Decode
Caesared Word Search
Enter letters for the puzzle's wordsearch in the normal input area to the left. Letters should be entered
with no spaces or punctuation as follows:
ABCD
EFGH
IJKL
MNOP
When you have entered the entire wordsearch as an input, press the POPULATE button and they
will import into the input table area and autofill the output table. As the offset is adjusted, the
output table will automatically update
all of its letters to be a caesaered version of the original input table. Additionaly, all of the words
that can be made using normal wordsearch rules will be displayed below the tables. Words can be forward
or reversed in horizontal,
vertical or diagonal orientation.
NOTES:
- If non-alphabetic characters are entered into the grid, the caesar results will be unpredictable for that character.
- The grid will accept non-square arrangements, but the word detection function will not work.
- The dictionary used for this function is always the 63kEnglish dictionary. It has a very large amount of "odd" data in it such as words like CU or RAB and these results will show up in the words found list. Its a necessary evil until I get the dictionaries completely sorted out.
- Words may "wrap" back around the grid. I am trying to solve that.
Input Table
Output Table
Adjust the offset (a number between 0 and 25) to apply the Caesar shift cipher to the puzzle: