Tool to decrypt/encrypt with ADFGVX. ADFGVX is a German encryption system invented by Fritz Nebel in 1917. ADFGVX uses a 6x6 square grid to replace the plaintext by pairs of letters among A,D,F,G,V,X and then this ciphertext get a permutation of its letters (transposition).

ADFGVX Cipher - dCode

Tag(s) : Substitution Cipher, Transposition Cipher

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!

You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? *Contact-me*!

dCode is experiencing slowdowns again... Please be patient.

Sponsored ads

Tool to decrypt/encrypt with ADFGVX. ADFGVX is a German encryption system invented by Fritz Nebel in 1917. ADFGVX uses a 6x6 square grid to replace the plaintext by pairs of letters among A,D,F,G,V,X and then this ciphertext get a permutation of its letters (transposition).

The encryption uses a 6x6 square grid of 36 distinct characters (usually the latin alphabet and the 10 figures).

Lines and columns named, from top to bottom and from left to right, by the letters A, D, F, G, V and X

Example: A grid filled with AZERTYUIOPQSDFGHJKLMWXCVBN0123456789:

\ | A | D | F | G | V | X |
---|---|---|---|---|---|---|

A | A | Z | E | R | T | Y |

D | U | I | O | P | Q | S |

F | D | F | G | H | J | K |

G | L | M | W | X | C | V |

V | B | N | 0 | 1 | 2 | 3 |

X | 4 | 5 | 6 | 7 | 8 | 9 |

Each character of the plain text must exist in the grid in order to be localized by a coordinate (line, column).

Example: A = (A,A), B = (V,A), C = (G,V), D = (F,A) etc.

By replacing each letter of the message with the pair of coordinates, the intermediate ciphered message is then a substitution with bigrams.

Example: DCODE becomes FA,GV,DF,FA,AF.

This message will get another encryption by columnar transposition. The transposition uses a permutation key, usually based on a keyword. One can find it by rearranging the letters in alphabetic order.

Example: KEY => K(1),E(2),Y(3) => E(2),K(1),Y(3) => 2,1,3

The message is written in a table whose width is the key size. Empty box are filled with X (or another letter).

Example:

K(1) | E(2) | Y(3) |
---|---|---|

F | A | G |

V | D | F |

F | A | A |

F | x | x |

Columns are rearranged such as the permutation key.

Example: Column 1 (K) switches with column 2 (E)

E(2) | K(1) | Y(3) |
---|---|---|

A | F | G |

D | V | F |

A | F | A |

x | F | x |

The final ciphertext is created by reading the letters of the table by columns starting from top to bottom and from left to right.

Example: Final encrypted message is ADAXFVFFGFAX (message often transmitted in Morse code)

The ADFGVX decryption process requires a key and a grid.

Example: The cipher text is AD,AX,FV,FF,GF,AX and the keyword is KEY (that correspond to permutation K(1),E(2),Y(3) => E(2),K(1),Y(3) => 2,1,3)

The ciphered message is then written from top to bottom and from left to right in a table with \( n \) columns where \( n \) is the length of the key. Columns are named according to the letters of the key, rearranged in alphabetic order.

Example:

E(2) | K(1) | Y(3) |
---|---|---|

A | F | G |

D | V | F |

A | F | A |

X | F |

The table gets a permutation of its columns according to the permutation key in order to get back the original order of the keyword's letters.

Example:

K(1) | E(2) | Y(3) |
---|---|---|

F | A | G |

V | D | F |

F | A | A |

F |

Reading the table by row gives the intermediate message.

Example: FAGVDFFAAFXX.

For each bigrams, replace it with the corresponding letter with coordinates (line, column) in the grid to get the plain text message.

Example:

\ | A | D | F | G | V | X |
---|---|---|---|---|---|---|

A | A | Z | E | R | T | Y |

D | U | I | O | P | Q | S |

F | D | F | G | H | J | K |

G | L | M | W | X | C | V |

V | B | N | 0 | 1 | 2 | 3 |

X | 4 | 5 | 6 | 7 | 8 | 9 |

Example: FA = line F, column A = D then GV = C, etc. The original plain text is DCODE.

The ciphertext must contain only 6 distinct characters: A, D, F, G, V and X.

(Optional) The ciphered message must have number of character divisible by the permutation length.

If the ciphertext hasn't be permuted, the text is a bigrammic substitution. After a substitution by a random alphabet, the text should have a correct index of coincidence.

One can crack ADFGVX and find the permutation order without knowing the key by bruteforcing all possible permutation. Use the Permutation Brute-force button.

One can crack ADFGVX and find the substitution grid by making a alphanumeric replacement of the bigrams resulting from the permutations. Use dCode's tool for mono-alphabetic substitution.

One can crack ADFGVX without the key nor the grid by finding first the permutation (see below) and then do an alphabetical substitution.

The letters A, D, F, G, V and X have been selected because their equivalent in morse code are very distinguishable, his prevent transmission error by radio

ADFGVX cipher have been introduced at the end of the First World War (from 1917) by Fritz Nebel. He have been used on the 5th of March 1918 during the german attack of Paris, it was using an ADFGX version (with the letters A, D, F, G and X only).

GEDEFU 18 for GEheimschrift DEr FUnker 18, which can be translated in radio-operators' cipher 18 is the old name of ADFGVX cipher.

ADFGX is an ancestor of ADFGVX, a variant using a 5x5 square, on the base of the Polybius square cipher.

The crack is attributed to Georges-Jean Painvin. Among the deciphered messages, one text was nicknamed *The radiogram of the victory* because it allowed France to win a battle in June 1918.

George-Jean Painvin deciphered a first message in June 1918.

The theorem of Roitelet is a novel by Frédéric Cathala here which has as protagonist a spy during the first world war having messages encrypted with ADFGVX.

dCode retains ownership of the source code of the script ADFGVX 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 ADFGVX Cipher script for offline use on PC, iPhone or Android, ask for price quote on contact page !

- How to encrypt using ADFGVX cipher
- How to decrypt ADFGVX cipher
- How to recognize an ADFGVX ciphertext?
- How to recognize a non-permuted text?
- How to decipher ADFGVX without key for permutation?
- How to decipher ADFGVX without grid
- How to decipher ADFGVX without key nor grid?
- Why the letters ADFGVX?
- When ADFGVX have been used?
- What is the GEDEFU 18?
- What is ADFGX?
- Who did crack ADFGVX cipher?
- When ADFGVX have been cracked?
- What is the Roitelet Theorem?

adfgvx,adfgx,georges,jean,painvin,radiogram,victory,gedefu,18,nebel,fritz,polybe,square,grid,theorem,roitelet,german

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

© 2018 dCode — The ultimate 'toolkit' to solve every games / riddles / geocaches. dCode

Feedback