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.

Converted string: Copy output from conversion to Input.

Text Analysis

Morse Code

NB: The decode function needs to have the proper spaces between letters in the input string to work.

If a letter group cannot be correctly solved, a red X will show up in its place in the output.

Encoded / Decoded string:

Decoded from inverted dots/dashes:

Polybius Square Decoder

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:

Letter Skipper

The run button should be clicked before any changes are made.
Run 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 output format:

Encoded / Decoded string:

Bacon Cipher

In DECODE mode, the tool assumes that the cipher text being input is in the general format: ABBAB AABAA BABAB AABAA BAAAB AAAAA AABBA AAAAA ABAAA ABBAB ( 'never again' ), however 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.

Combined deciphering tool

Currently supports Caesar shift, Vigenere and Railfence ciphers

Decoded string:

Railfence Transposition Cipher

Encode Railfence Decode Railfence Guess and decode Railfence

Number of rails:

Offset:

Maximum number of rails for guessing:

Encoded / Decoded string:

Caesar Shift

Decode Caesar Code Caesar Guess shift and decode Caesar

Shift:

Decoded string:

Vigenère Cipher

Beale or Book Ciphers

NOTES:

- The scripts currently work on LINES and not on SENTENCES in a body of text. If a sentence (or question) ends before a line break, and then other words follow it, the script will not detect the sentence as a stand alone item to be evaluated. Although the ability to process sentences is in work, these scripts only work as if you were processing a printed book or poem.

- 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: Prepare Text)

- 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)

Number String:

If using simple letter counter, line/letter or sequential line/letter, choose whether spaces are to be included in the count.
Count spaces and non-letter characters.

Output:

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 something like a 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.

Reset All Outputs

Playfair Cipher

*** Not thouroughly tested. ***

Copy output to clipboard

Substitution Cipher - Text

Substitution Cipher - Images

Reset All Outputs

Encode

Decode

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. In cases where the reduction of the decimal precision produces two values (208.9 or 247.0) both outputs are shown ("Bi (or Po)" or "Cm (or Bk)").

NB: If using atomic weight, you must include the first decimal place. ie: 58.6-12.0-207.2

Values taken from here: https://pubchem.ncbi.nlm.nih.gov/periodic-table/

Decode By Atomic Number

Decode By Atomic Weight

Reset All Outputs

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 can be selected from the dictionaries below the input box and will automatically update the results.

- Words may "wrap" back around the grid. I am trying to solve that.

Adjust the offset (a number between 0 and 25) to apply the Caesar shift cipher to the puzzle:

Ignore words shorter than this length:

Words found in output table:

Clicking on words in this list will highlight them in the output table.

Reset All Page Elements

Letter Bag Word Finder

Paste letters as a single line, or as a grid / multiple lines into the common input area. Non-letters are ignored. The tool returns all dictionary words that can be formed from the any of the available letters. The letters need not be contiguous as in a word search.

Compatible words