Tool to decrypt/encrypt Trithemius. The Trithemius cipher is a polyalphabetic encryption method invented by the German abbot Trithemius. This code is a sequence of shifts from 0 to N shift in the alphabet.
Trithemius 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!
The Trithemian cipher, also known as the Trithemian cipher, is an encryption method based on the principle of substitution according to successive shifts.
The Trithemius code is a successive shift cipher, using positive and ascending (ie. to the right) shifts in the alphabet from 0 to N where N is the length of the text. If the end of the alphabet is reached, start from the beginning.
Example: To code DCODE shift D from +0 an get D, shift C by +1 and get D, shift O by +2 and get Q, shift D by +3 and get G, and shift E by +4 and get I. The coded message is DDQGI.
Another method, more visual, consists of using the following grid, selecting the column whose name is the plain letter at the top, and for row the number of the letter on the right (arrived at 27, start again at 1), the intersection is the encrypted letter.
Trithemius decryption requires successively shifting in the other direction in the alphabet: shifting $ N $ to the left (or negatively to the right, adding $ -N $).
Example: To decode TSKWLJSPCB shift T by 0 and get T, shift S by -1 and get R, shift K by -2 and get I, etc. The plain message is TRITHEMIUS.
— The shift may be ascending/increasing or descending/decreasing.
— By default, the offset starts at 0, but it is conceivable to start it at 1 or any other number.
— The alphabet used can be a deranged alphabet or a completely personalized alphabet.
— Other types of shift sequences may be imagined (see shift ciphers).
With a classical alphabet ABCDEFGHIJKLMNOPQRSTUVWXYZ, Trithemius cipher is equivalent to a Vigenere cipher with ABCDEFGHIJKLMNOPQRSTUVWXYZ.
Trithemius cipher is a variant to a Caesar cipher with a shift that increases by 1 by each letter starting at 0.
The ciphered message has a low index of coincidence (0.04-0.05).
A Vigenère-like key length analysis will return a likely size of 26.
Trithème (a German abbot) would have described it during the Renaissance, around 1480.
dCode retains ownership of the "Trithemius Cipher" source code. Any algorithm for the "Trithemius Cipher" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Trithemius Cipher" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Trithemius Cipher" or any other element are not public (except explicit open source licence like Creative Commons). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.
The content of the page "Trithemius Cipher" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source.
Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link:
In a scientific article or book, the recommended bibliographic citation is: Trithemius Cipher on dCode.fr [online website], retrieved on 2025-04-16,