Skip to content

Graph Chaining

Lymm edited this page Nov 5, 2025 · 4 revisions

One way of doing alphabet chaining is to build up a directed graph where the nodes are the ciphertext symbols. The edges are colored, with a different color for each pair of isomorphs in a set. The edges are added for each substitution between that pair of isomorphs, so the ciphertext symbols in the same relative position within the isomorph. For GAK ciphers, this is equivalent to building a subgraph of the Schrier Coset Graph.

Clone this wiki locally