Voynich Morse Code Steganography Cipher

The process for “Voynich Morse code Steganography Cipher”:

By

Thomas E. O’Neil

This is from the cipher wheel, folio 57v

1. The glyphs from a vord which are summed up to the associated Morse code in my cipher I produced as dots and dashes. For instance VMS vord (oe = 3 dots and 2 dashes) so the Italian word is equal to, “ce -.-. .” which translates to “there, here or us” in English

2) Take the sum of the Morse code and look for meanings from Italian words. This is tricky, but you will only find a small amount of Italian words per vord unless their size is longer, but it’s better than a substitution cipher which I no longer believe it to be, because the dots and dashes sum must fit the Italian word. Here is the code in Python for translating Morse to any language as anagrams. Yes the code has a built in anagram solver. You do need to cherry pick Italian words to the narrative albeit if a 1000 programmers and would be decoders used this process some of the output would be the same, but I don’t know the stats for this to occur. As it stands it’s all about the input from the totals of dots and dashes. I don’t know how many runs humans could do to get similar sentences. This is better suited for hard coded computers to run grammar checks in Italian for computations from the Morse code cipher arrangements using my python code and an upgrade someday.

1. I envision the VMS to have for vords like “9″ to be set like this ( .- or – .) in the VMS for analysis among all the vords represented as code. That is equal to (a, or te). Then let the computer process the VMS document and see if it outputs a high quality transcription to the Italian language not only using “9″, but all the vords.

Here is a translation of folio 1r

https://www.youtube.com/watch?v=563D3HUNg0I

Python Code used to decode Voynich:

print(“Author Thomas O’Neil, copyright ver 0.1,VMS Italian Steganography Morse Code to Anagrams, August 8, 2019″)

# Python program to implement Morse Code Translator 

”’ 

VARIABLE KEY 

‘cipher’ -> ‘stores the morse translated form of the english string’ 

‘decipher’ -> ‘stores the english translated form of the morse string’ 

‘citext’ -> ‘stores morse code of a single character’ 

‘i’ -> ‘keeps count of the spaces between morse characters’ 

‘message’ -> ‘stores the string to be encoded or decoded’ 

”’

# Dictionary representing the morse code chart 

MORSE_CODE_DICT = { ‘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’:'–..’, 

’1′:’.—-’, ’2′:’..—’, ’3′:’…–’, 

’4′:’….-’, ’5′:’…..’, ’6′:’-….’, 

’7′:’–…’, ’8′:’—..’, ’9′:’—-.’, 

’0′:’—–’, ‘, ‘:’–..–’, ‘.’:’.-.-.-’, 

‘?’:’..–..’, ‘/’:'-..-.’, ‘-’:'-….-’, 

‘(‘:’-.–.’, ‘)’:'-.–.-’,} 

# Function to encrypt the string 

# according to the morse code chart 

def encrypt(message): 

cipher = ” 

for letter in message: 

if letter != ‘ ‘: 

# Looks up the dictionary and adds the 

# correspponding morse code 

# along with a space to separate 

# morse codes for different characters 

cipher += MORSE_CODE_DICT[letter] + ‘ ‘

else: 

# 1 space indicates different characters 

# and 2 indicates different words 

cipher += ‘ ‘

return cipher 

# Function to decrypt the string 

# from morse to english 

def decrypt(message): 

# extra space added at the end to access the 

# last morse code 

message += ‘ ‘

decipher = ” 

citext = ” 

for letter in message: 

# checks for space 

if (letter != ‘ ‘): 

# counter to keep track of space 

i = 0

# storing morse code of a single character 

citext += letter 

# in case of space 

else: 

# if i = 1 that indicates a new character 

i += 1

# if i = 2 that indicates a new word 

if i == 2 : 

# adding space to separate words 

decipher += ‘ ‘

else: 

# accessing the keys using their values (reverse of encryption) 

decipher += list(MORSE_CODE_DICT.keys())[list(MORSE_CODE_DICT 

.values()).index(citext)] 

citext = ” 

return decipher 

def anagrams(word):

    “”" Generate all of the anagrams of a word. “”" 

    if len(word) < 2:

        yield word

    else:

        for z, letter in enumerate(word):

            if not letter in word[:z]: #avoid duplicating earlier words

                for j in anagrams(word[:z]+word[z+1:]):

                    yield j+letter

# Hard-coded driver function to run the program

while True:

        def main(): 

            message = input (“Type in Morse Code to output anagrams!: “)

            result = decrypt(message) 

            print (result)

            return result # return result

        for i in anagrams(main()):

            print (i)

# Executes the main function 

if __name__ == ‘__main__’: 

main()