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!

Tool to encrypt/decrypt by successive shifts of Caesar cipher. The Progressive Caesar code uses the Caesar number with an incremental shift system.

Answers to Questions

How to encrypt using Progressive Shift cipher?

Progressive Caesar's encryption is a variant of the Caesar cipher, thus, it uses the position of the letters in the alphabet and shifts by X a letter in position N. This consists in taking the letter in position 'N + X'. The progressive shift consists of taking successively X, X+1, X+2 etc. as a shift.

Example: AAA is encrypted DDD with a Caesar shift of 3

Example: AAA is encrypted DEF with a progressive Caesar offset of 3 (then 4, 5, ...)

See the shift cipher tool for more options on this type of encryption.

How to decrypt using Shift cipher?

The decryption by Caesar Progressive, requires to know the encryption parameters (progressive or decreasing and the mode of shift change). Decoding consists of shifting the letters of N in the alphabet for the first letter, then N+1, N+2 and so on, for the following letters.

Source code

dCode retains ownership of the source code of the script Progressive Caesar Cipher online. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, Matlab, etc.) which dCode owns rights will not be given for free. To download the online Progressive Caesar Cipher script for offline use on PC, iPhone or Android, ask for price quote on contact page !

> [

News]: Discover the next version of dCode Progressive Caesar Cipher!