“F11.2: the SOE poem code: a double columnar transposition keyed by consecutive words of K1-K3 and the Morse, then or before a repeating key on the sculpture's tables: exact”
F11.2. The poem code (SOE, Second World War): the agent takes words from a memorised text, writes them out as one key, numbers its letters alphabetically (ties left to right) and transposes twice by columns with that number key. Here the memorised texts are the sculpture's own: the plaintexts of K1, K2 and K3 and the Morse. Keys: every run of 1-6 consecutive words, 5-40 letters; used for both transpositions, or split into two keys at every word boundary. Each move and its inverse, then (A) or before (B) a repeating key 1-26 on 8 table classes (F6's compiled tester); K4 against 15 shuffled copies. 0167-era double columnar tests used dictionary keywords, not these phrases.
British agents in the war carried their keys in their heads: a poem. They picked a few words, wrote them out, numbered the letters in alphabetical order, and used the numbers to shuffle the messagethe message The 97 letters of English that Jim Sanborn wrote and enciphered. twice through a grida grid Writing the message into rows of some width and reading it out in another order, column by column for instance, which shuffles the letters without changing them.. Here the 'poem' is the sculpture's own solved text. We try every run of a few consecutive words as the keythe secret word The word or string a cipher needs besides the method., with a repeating secret worda repeating secret word A secret word written under the message again and again. on the sculpture's tables before or after.
Words in the margin are defined on the glossary page.
1.1
The method at work
The carved letters go in at the top; the reading comes out at the bottom.
the idea
SOE agents kept their keys in a memorised poem: a few words written out, their letters numbered alphabetically, used to shuffle the message twice through a grid. The sculpture's solved text is a poem its makers knew by heart.
the check
Every run of 1-6 consecutive words of K1, K2, K3 and the Morse as the key, used twice or split in two, each shuffle undone, then a repeating key of 1-26 on the sculpture's tables before or after; 15 scrambled copies.
the bound
Nothing fits K4 better than the copies. F11.2 closed for consecutive words; free picks of words remain untested.
2
Best candidate against the known letters
This experiment produced no candidate: the search ruled everything out before a full text was built. Its product is the bounded negative in section 7.
3
Walkthrough, by hand
Redo the method on a few letters with pencil and paper.
Take the words SHADOW FORCES from the Morse: SHADOWFORCES, 12 letters.
Number the letters alphabetically, ties left to right: A=1, C=2, D=3, E=4, F=5, H=6, the Os 7 and 8, R=9, the Ss 10 and 11, W=12.
Write the message in rows of 12, read the columns in number order; do it again.
Undo that, and test a repeating key on the sculpture's tables against the 24 known letters.
Every run of words, on K4 and on scrambled copies.
the worksheet: the first steps by hand, on squared paper
4
Worked example, generated
The same steps run by the code on the real letters.
Family, key space, the constraint under test, and the clues it reads.
C5(b) ('key word/s'), A9 (agency hand systems; Scheidt's CIA background), F11; SOE poem code (Marks, Between Silk and Cyanide). Model: c = T(P2(P1(p))) or P2(P1(T(p))), P1, P2 columnar transpositions keyed by the phrase numbers, T a periodic tableau key. Statistic: 0134's fixed statistic and the shortest live period, K4 against copies.
6
Prediction
Written before the run; the result decides it.
No phrase key gives K4 a live period below the copies'; cells where K4 leads stay inside the copies' range. Zero candidates.
7
Method
Word lists of K1, K2, K3 plaintexts and the Morse.
Every run of 1-6 consecutive words of 5-40 letters: its number key; the double columnar move with it twice, and with the run split in two at every word boundary.
Each move and its inverse, deduplicated.
F6's compiled tester: live (order, period) per text; K4 against 15 shuffled copies.
8
Result and bounds
The harness's record: candidates, gates, loss, and the negative result this experiment leaves behind.
0candidates returned
0passed every gate
0/24known letters, best
–lowest loss
nonechampion before
6092 moves; shortest live K4 A 24 B 25 (copies 22, 25); K4 above every copy in 0 of 52 cells (copies 0-1)
What was searched, as the harness recorded it.
family
SOE poem code: double columnar keyed by 1-6 consecutive words of K1-K3 and the Morse (same key twice, or split), then/before a periodic key 1-26, 8 classes, exact