Tool to decrypt/encrypt with Bellaso. Bellaso cipher created by Giovanni Battista Bellaso is a cryptographic poly-alphabetic process using one or two keys and adapted to the italian alphabet

Bellaso Cipher - dCode

Tag(s) : Poly-Alphabetic Cipher

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*!

**Bellaso** encryption uses an alphabet, a key to generate N alphabets from the first one and a cipher key.

The original author used the latin alphabet with 20 letters ABCDEFGHILMNOPQRSTVX

__Example:__ Encrypt DCODE ME with the alphabet ABCDEFGHILMNOPQRSTVX, the generation key CHIAVEALPHABET for 5 alphabets and CHIAVE the ciphering key.

The message is split into words. For the nth word of the message, get the nth letter of the key (modulo key length) and substitute using the alphabet for the nth letter.

__Example:__ Word 1 : DCODE, Word 2 = ME

1st letter of the key : C, alphabet for C = CHIAVDFGMN/ELPBTOQRSX, DCODE becomes OEDOC

2nd letter of the key : H, alphabet for H = CHIAVDFGMN/XELPBTOQRS, ME becomes RH

The message is encrypted OEDOC RH

**Bellaso** decryption is identical to encryption.

To decrypt, take distinct letters of the generating key and split it in half

__Example:__ CHIAVEALPHABET becomes CHIAVELPBT so CHIAV and ELPBT

The two parts are filled with remaining letters in order to make it reversible

__Example:__ CHIAVDFGMN/ELPBTOQRSX

To generate the next N-1 alphabets, keep the first part but make a rotation of i times n characters of the second part.

__Example:__ i=1, n=1, ELPBTOQRSX becomes XELPBTOQRS

i=2, n=1, ELPBTOQRSX becomes SXELPBTOQR

For each letter of the alphabet 1 is associated one of the N generated alphabet, in order, ie, the first letter is associated to the first alphabet, the second letter to the second alphabet, etc.

__Example:__ For N=5 alphabets, C,H,I,A,V,D,F,G,M,N,E,L,P,etc. are associated, respectively to alphabets 1,2,3,4,5,1,2,3,4,5,1,2,3,etc.

The ciphered message has a smaller index of coincidence than to the language of the plaintext.

In its original version, only 20 characters are used (latin alphabet, U=V)

In its original version, the message use a word-separator (space).

Clues on Italy or Vigenere are not to be neglected.

It is hard. However it is possible to find the number N of alphabet by analyzing frequency of one word out of N.

A book from Giovanni Battista **Bellaso** describing the process is dated 1553.

dCode retains ownership of the online 'Bellaso Cipher' tool source code. Except explicit open source licence (indicated CC / Creative Commons / free), any 'Bellaso Cipher' algorithm, applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any 'Bellaso Cipher' function (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and no data download, script, copy-paste, or API access for 'Bellaso Cipher' will be for free, same for offline use on PC, tablet, iPhone or Android ! dCode is free and online.

Please, check our dCode Discord community for help requests!

NB: for encrypted messages, test our automatic cipher identifier!

bellaso,giovanni,giovan,battista,alphabet,italy

Source : https://www.dcode.fr/bellaso-cipher

© 2021 dCode — The ultimate 'toolkit' to solve every games / riddles / geocaching / CTF.

Feedback

▲
Thanks to your feedback and relevant comments, dCode has developed the best 'Bellaso Cipher' tool, so feel free to write! Thank you!