There is a newer version of the record available.

Published June 29, 2026 | Version v1

On Heuristic Structure Extraction in Under-Specified Transposition Ciphers: A Case Study on the Diagapeyev Cipher

Authors/Creators

  • 1. Independent Researcher

Description

This study investigates a heuristic optimization framework applied to the Diagapeyev Cipher, modeled as an under-specified transposition cipher with unknown structural parameters, including grid size and permutation rules. We formulate the problem as a combinatorial optimization over permutation matrices and apply large-scale stochastic search guided by a trigram-based statistical language model. To evaluate the scoring function, an empirical null distribution is constructed using randomly permuted configurations under identical structural constraints. A 6x6 permutation state with a log-score of 15.84 is observed from the heuristic search procedure. Importantly, this result does not imply recovery of a unique historical plaintext. Instead, it reflects the behavior of a statistical scoring function over a high-dimensional combinatorial search space. These results suggest that structured linguistic patterns may emerge as an interaction effect between the scoring model and search dynamics in permutation space, rather than as evidence of successful decryption.

Files

my_paper.pdf

Files (405.4 kB)

Name Size
md5:fe71ac86f4cc08f2b98c05ea4ae5fe9f
405.4 kB Preview Download

Additional details