Search for a tool
Gromark Cipher

Tool to encode and decode text using the Gromark cipher, a substitution cipher that uses a numeric key and a sequence of digits to transform message letters.

Results

Gromark Cipher -

Tag(s) : Poly-Alphabetic Cipher

Share
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 'Gromark Cipher' tool for free! Thank you!

Gromark Cipher

Gromark Decoder

 



 

Gromark Encoder

 



 

Transposed Keyed Alphabet Calculator



Transposed Keyed Alphabet Calculator



Answers to Questions (FAQ)

What is the Gromark cipher? (Definition)

The Gromark cipher is a polyalphabetic substitution cipher system, derived from the Gronsfeld cipher. It uses a keyword to build a mixed alphabet and a number, called a primer, to generate a long numeric key, called the running key.

How to encrypt a plaintext message with Gromark?

To encrypt a message with Gromark, follow these steps:

— Build the mixed cipher alphabet by transposition from a keyword (see section below).

Example: The keyword ALPHABET generates the mixed alphabet ACMVBIRZEJSHGQYLDNWPFOXTKU

— Choose a sequence of digits (called a primer) and generate a running key as long as the plaintext using the Fibonacci sequence principle (see section below).

Example: The digit sequence 54321 generates the sequence 5432197530628..

— For each plaintext letter, determine its position $ P $ in the standard alphabet, with $ A=0, B=1, \dots Z=25 $

— Add the corresponding digit of the running key $ K $ to this position, modulo 26: $ Q = (P+K) \mod 26 $

— Replace the letter at position $ Q $ in the standard alphabet with the letter at the same position in the mixed alphabet (index 0).

Example:

Plaintext letterGROMARK
Position P=617141201710
Running key K=5432197
Sum %26 Q=112117141017
Cipher letterHONYCAN

How to decrypt a Gromark-encrypted message?

Decryption requires knowing the keyword used to build the mixed alphabet and the numeric key (primer).

— Regenerate the running key from the primer (see below).

Example: The digit sequence 54321 generates the sequence 5432197530628..

— For each cipher letter, find its position $ Q $ in the mixed cipher alphabet.

— Subtract the corresponding digit of the running key, modulo 26, to recover the plaintext letter position: $ P = (Q-K) \mod 26 $

— Convert this position to a letter of the standard alphabet, with $ A=0, B=1, \dots Z=25 $

Example:

Cipher letterHONYCAN
Position Q=112117141017
Running key K=5432197
Subtraction %26 P=617141201710
Plaintext letterGROMARK

How to build the mixed alphabet?

The mixed alphabet used in Gromark is of type K2M:

— Choose a keyword and remove repeated letters, keeping their first occurrence

Example: ALPHABET becomes ALPHBET

— Complete this keyword with the letters of the alphabet not present in it, in alphabetical order, to obtain a sequence of 26 letters.

Example: ALPHBET becomes ALPHBETCDFGIJKMNOQRSUVWXYZ

— Write this sequence in a table with as many columns as there are letters in the deduplicated keyword

Example:

ALPHBET
CDFGIJK
MNOQRSU
VWXYZ

— Assign to each column the alphabetical rank of the corresponding letter of the keyword

Example:

1564237
ALPHBET
CDFGIJK
MNOQRSU
VWXYZ

— Read the columns in increasing order of these ranks to form the mixed cipher alphabet

Example: ACMVBIRZEJSHGQYLDNWPFOXTKU

How to generate the running key from the primer?

The running key is built by successively adding the first two digits (as in the Fibonacci sequence) and keeping only the units digit of the result, which is equivalent to calculating modulo 10. This new digit is added to the end of the primer, and the calculation continues with the next 2 digits.

If the first five digits are $ K_1, K_2, K_3, K_4, K_5 $, the recurrence is: $ K_{n+5}=(K_n+K_{n+1})\bmod 10 $

Example: The numeric key 54321 continues with 97530 because $ 5+4=9 $, $ 4+3=7 $, $ 3+2=5 $, $ 2+1=3 $, $ 1+9=10 \equiv 0 \mod 10 $

Continue until having as many digits as the message has letters.

Where does the name Gromark come from?

The name Gromark stands for 'GRONsfeld with Mixed Alphabet and Running Key'. The system was published in 1969 in the journal The Cryptogram of the American Cryptogram Association (ACA), by an author using the pseudonym DUMBO.

How to recognize a Gromark-encrypted message?

Several clues may suggest that a message was encrypted with Gromark:

— The presence of a 5-digit number, potentially corresponding to the primer.

— Sometimes a single isolated digit at the end of the message, which can serve as a check digit (the value of the running key for the last letter, allowing verification of the calculations).

— The system is sometimes referred to as Gromark K2.

Does the running key always end up repeating?

Yes. The generation of the running key is deterministic and depends on the two previous digits. Each digit belongs to the set $ [0,1,\dots,9] $

There are therefore only $ 10 \times 10 = 100 $ possible states. The key thus eventually becomes periodic for a long message.

The length of the period depends on the initial primer.

Source code

dCode retains ownership of the "Gromark Cipher" source code. Any algorithm for the "Gromark Cipher" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Gromark 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 "Gromark Cipher" or any other element are not public (except explicit open source licence). 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.

Cite dCode

The content of the page "Gromark Cipher" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source (Creative Commons CC-BY free distribution license).

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: https://www.dcode.fr/gromark-cipher

In a scientific article or book, the recommended bibliographic citation is: Gromark Cipher on dCode.fr [online website], retrieved on 2026-11-19, https://www.dcode.fr/gromark-cipher

Need Help ?

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

Questions / Comments

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


https://www.dcode.fr/gromark-cipher
© 2026 dCode — The ultimate collection of tools for games, math, and puzzles.
â–˛  
Feedback