vigenere | Tabula recta generator and Vigenère decrypter

I am trying to decode a Vigenere cipher in python knowing the ciphertext and plaintext

I have a string of text in this form 'SDFJNKSJDFOSNFDF'. I want to convert each letter to a number so I'm able to decode the text, i.e. A to 1, B to 2...

The idea I had was to convert this using ascii, checking what the capital letters correspond to would mean I could deduct this, I don't have an example code that hasn't worked, I've written some details that will hopefully make my idea easier to understand:

My string looks like this:

I am working on a program that encrypts a user inputed word and key using the Vingere encryption cipher. The key can be any length and contain repeated letters. Each letter of the user inputted word is encrypted using the row of the table corresponding to the letter of the keyword under it. The encryption works with the following table here:

I have the start of the code programed but I can't figure out how to add the encryption part into my code. Here is the program so far:

Need help on Vigenere cipher to generate the key from the keyword, looking to do this very simply after cyclical rotation to get the keyword the same len as message:

Essentially, I've created a vigenere cipher. Vigenere Cipher matrix

It's a method used for coding messages. I've created the 2D array for the Vigenere cipher array. I receive a message in a form of a .txt file to be encoded. I then convert this into a regular '1D character array'. Essentially reading the text and putting every single character into a new array.

I then also get input from the user for the key, this key is then taken and repeated to match the length of the character array. So now I have a 'key array'.

How a Vingere Cipher works is that the key's first letter and the texts first letter is matched. So on the X-Axis is the 'message' and on the Y-Axis is the 'key'.

For example, if I do key: road

and message: cars

the encrypted message would be: torv,

I would get T, because I started with R on the Y-Axis and matched it to C on the X-axis.

This is how I setup my Vigenere Cipher. where 'alphabet' is this. I'm just having trouble 'matching' the characters of the two arrays (encryption key) and (message) to my Vigenere Cipher, then saving that input as an array inside a method to be used later on. Currently, I'm not too worried about capital letters and so on.

Vigenere cipher code:

I'm trying to write a program which will encrypt a sentence using Vigenere cipher, but only the words starting with consonant letters, and while storing spaces. I'm not very good with Java yet, but I wrote a method which encrypts any given word (all small letters) I had thought using array to print spaces where needed and ignore words starting with vowels would be enough, but doing so is actually giving me wrong output whenver I'm printing the 2nd word or so on of the array. Could someone please guide me what I'm doing wrong? And is there any better way to do this? Here's my code so far:

This is my first time trying something out with eel. I've got a python script with some functions and I'm trying to communicate with them using @eel.expose but it gives me a javascript error - main.html:10 Uncaught TypeError: eel.startEncryption is not a function Here's my code:

I made a program to try and find the length x of a key in a French vigenere ciphered text (should be a random string) by calculating the mean of all the index of coincidence of a text which is cut every x element, basically I'm trying to get the mean value of the IC closest to 0.06/0.07 according to this reference website, but my mean values look wrong.

Note: I'm only working with uppercase strings, and no punctuation at all, no special characters and no spaces.

I have 3 functions, one function gives me a list of occurrence letters in a text.

I've tried implementing Vigenere's Cypher. I found out that it is used with Uppercase letters but I've made it to work for capital and small letters but the characters of a plain or cyphered text must be the same as their corresponding ones in the Key. So I've done this:

I'm working on a program to encrypt / decrypt data using the Vigenère Cipher. All is well except the decrypt part.

The logic behind the encryption and to compute the key is:

• INPUT : "qwerty"

• Key : "asd" = The computed key is "asdasd"

• CIPHER: "catdxn"

• For encrypting I use the following algorithm:

• RESULT[i] = (INPUT[i]+key[i]) % 26

• RESULT[i] += 3dH ; to transform to asci number

• CIPHER[i] += RESULT[i] The problem is at decrypt:

The decrypt algorithm should be

• RESULT[i] = (INPUT[i] - KEY[i]) % 26

• IN CASE INPUT[i] - KEY[i] = NEGATIVE NUMBER = add 26 so the formula changes to

• RESULT[i] = (INPUT[i] - KEY[i] + 26 ) % 26

• RESULT[i] += 3dH

• CIPHER[i] += RESULT[i] ; Get the result String

The expected result should be "qwerty" but I'm getting "usgtrm".

So following the algorithm described above I have the following code: