Running Key Cipher
A book-length key removes short repetition, but keeps language patterns
Source text identification · Statistical analysis
Why This Matters
A running key replaces Vigenère’s short repeating keyword with a long passage. Removing that short period does not make the key random: natural language remains biased and structured. A book passage therefore does not give the perfect secrecy of a one-time pad.
The running key cipher applies Vigenère's arithmetic but replaces the short repeating keyword with a message-length passage from a pre-agreed text — a book, a speech, or a newspaper article. Kasiski's usual search for a repeated keyword period is no longer the same route to an attack. Accidental repetitions can still occur, and the structure of the plaintext and key text remains available to statistical analysis.
A shared book offers an inconspicuous source of key material: both parties need the same edition and an agreed starting position. It does not provide a secret, uniformly random, independent pad, and sharing the book does not remove the need to manage those choices securely.
Plain: ATTACKATDAWN Key: FROMTHISBOOK Cipher: each letter shifted by key letter A+F=F, T+R=K, T+O=H, A+M=M, C+T=V, K+H=R, A+I=I, T+S=L...
An attacker can test guesses for the source passage and starting position. Even without finding the book, statistical attacks can exploit language patterns in both the plaintext and key. Keeping the source unidentified is therefore not a sufficient security condition.
If an attacker identifies the edition and passage used for the key, they can reconstruct that keystream and decrypt the message. A likely book title narrows the search, but the starting position and text preparation still matter.
Even without knowing the source, the key text has English statistical structure. Both the plaintext and key obey English letter frequencies. This creates detectable second-order patterns that sophisticated statistical attacks can exploit — making the running key cipher weaker than a true one-time pad.
| Concept from Running Key Cipher | Modern Evolution |
|---|---|
| Key length = message length | Necessary but not sufficient for a one-time pad: its secret key must also be uniformly random, independent of the message, and used only once |
| Non-repeating key | Modern stream constructions must avoid reusing keystream under their specified key-and-nonce rules |
| Key source = security weakness | True randomness: OTP keys must be random, not drawn from patterned text |
Reading: Joshua Holden, The Mathematics of Secrets: Cryptography from Caesar Ciphers to Digital Encryption (2017), §5.1 on running-key attacks and §5.2 on one-time pads. A long key and a uniformly random key are different requirements.
| Exhibit | 12 of 172 |
| Era | 19th Century |
| Trust | Broken |
| Inventor | No single inventor established here |
| Year | Historical running-key family |
| Key Type | Full-length key text (book or speech) |
| Broken By | Source text identification · Statistical analysis |