Search for a tool
Vigenere Multiplicative Cipher

Tool to decrypt/encrypt with Vigenere multiplication. Vigenere Multiplicative Cipher is a Vigenere variant which uses a key, but replaces an addition by a multiplication.

Results

Vigenere Multiplicative Cipher -

Tag(s) : Poly-Alphabetic Cipher

Share
dCode and more

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!

Feedback and suggestions are welcome so that dCode offers the best 'Vigenere Multiplicative Cipher' tool for free! Thank you!

# Vigenere Multiplicative Cipher

## Multiplication Vigenere Encoder

### How to encrypt using Multiplication Vigenere cipher?

Vigenere Multiplication Encryption uses a numeric key (some numbers) and a numeric message (use an alphanumeric substitution A1Z26, or ASCII code for example).

Example: Encode 4,3,15,4,5 (for DCODE) with the key 11,5,25 (for KEY)

Take the first number of the message and the first number of the key and multiply them, the result is the product's value. Same for the next numbers of the message and the key.

If the key length is inferior of the text lenght, start over the key.

Example: Calculate 4*11=44, 3*5=15, 15*25=375, 4*11=44, 5*5=25 to get the cipher message 44,15,375,44,25

 Plain numbers 4 3 15 4 5 Key numbers 11 5 25 11 5 Cipher numbers 44 15 375 44 25

### How to decrypt Multiplication Vigenere cipher?

Decryption requires a key and a numeric text.

Example: The ciphered message is 44,15,375,44,25 and the key 11,5,25 (for KEY)

Divide the first number of the message by the second number of the key. Write the result (which must be integer). Same for the next numbers of the message and the key.

Example: 44/11=4, 15/5=3 etc. The original plain text is 4,3,15,4,5 (DCODE).

### How to recognize Vigenere Multiplication ciphertext?

The message is made of numbers with 1 to 5 digits, none is prime.

### How to decipher Vigenere Multiplication without key?

Vigenere multiplication can be cracked by trying to find the length for which GCD of values are the greatest.

## Source code

dCode retains ownership of the "Vigenere Multiplicative Cipher" source code. Except explicit open source licence (indicated Creative Commons / free), the "Vigenere Multiplicative Cipher" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or the "Vigenere Multiplicative Cipher" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and all data download, script, or API access for "Vigenere Multiplicative Cipher" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!
Reminder : dCode is free to use.

## Cite dCode

The copy-paste of the page "Vigenere Multiplicative Cipher" or any of its results, is allowed (even for commercial purposes) as long as you cite dCode!
Exporting results as a .csv or .txt file is free by clicking on the export icon
Cite as source (bibliography):
Vigenere Multiplicative Cipher on dCode.fr [online website], retrieved on 2023-09-21, https://www.dcode.fr/multiplication-vigenere-cipher

## Need Help ?

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!