Search for a tool
Morbit Cipher

Tool for decoding / encoding with the Morbit number. The Morbit cipher is a variant of the Morse Fractioned code using a key that generates a numeric encryption alphabet.

Results

Morbit Cipher -

Tag(s) : Cryptography, Polygrammic Cipher

dCode and you

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!
You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Team dCode read all messages and answer them if you leave an email (not published). It is thanks to you that dCode has the best Morbit Cipher tool. Thank you.

Morbit Cipher

Morbit Encoder

Tool for decoding / encoding with the Morbit number. The Morbit cipher is a variant of the Morse Fractioned code using a key that generates a numeric encryption alphabet.

How to encrypt using Morbit cipher?

Morbit encryption uses a numeric index associated with pairs of morse characters:

 1 2 3 4 5 6 7 8 9 .. .- ./ -. -- -/ /. /- //

The key is used to mix the index according to the alphabetical order of its letters.

Example: The keyword MORSECODE is associated with the code 568931724 by sorting the letters alphabetically CDEEMOORS and matching them to 1234567879 as:

 Letters M O R S E C O D E Order 5 6 8 9 3 1 7 2 4 Bigrams .. .- ./ -. -- -/ /. /- //

The first step of encryption is to encode the original message in Morse code, the characters are separated by a slash / and the words are separated by double slash //.

Example: The message MORE BITS is encoded --/---/.-././/-.../../-/...

The second part of the encryption consists in splitting the Morse message into couple of characters and to associate the corresponding digit in the numeric index made with the key.

Example:

 -- /- -- /. -. /. // -. .. /. ./ -/ .. ./ 4 2 4 6 9 6 3 9 5 6 8 1 5 8
The encrypted message is therefore 42469639568158.

How to decrypt Morbit cipher?

Morbit decryption requires knowing the key in order to generate the numerical index associated with morse character pairs.

Example: The key ALPHABETS gives the following index:

 Letters A L P H A B E T S Order 1 6 7 5 2 3 4 9 8 Bigrams .. .- ./ -. -- -/ /. /- //

The first step in decryption is to replace each digit with its morse bigram equivalent.

Example: The message 1914592729 corresponds to the morse code --/---/.-./-.../../- :

 1 9 1 4 5 9 2 7 2 9 -- /- -- /. -. /- .. ./ .. /-

The morse code obtained only needs to be translated via the classic Morse code to get the plain message.

Example: -- / --- / .-. / -... / .. / - translates to MORBIT

How to recognize a Morbit ciphertext?

A Morbit encrypted message uses only digits from 1 to 9.

The Morbit message is between 50% and 100% longer (approximately) than the original message.

The presence of a 9-letter word that can serve as a key is an important clue.

How to decipher Morbit without key?

The key is an important element because it allows 9! = 362880 combinations of the numerical index.

There is no real way to reduce this number of combinations except by knowing a part of the plain text in order to deduce the numerical index and the correspondence with the morse bigrams.

What are the variants of the Morbit cipher?

Morbit is closer to the Fractionated Morse Code which is a kind of over-encryption.