Metraipolis › archive › dc_2659dcddbc9d

Running key cipher — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Running_key_cipher
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T16:04:08.818Z
SHA-256 of the archived text
334aed33a4bed50ee593518909490ae03ae24e07d8a3efdc160b0074c2eddc40
Stable URL of this page
https://metraipolis.com/documento/dc_2659dcddbc9d

How to cite

Running key cipher — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Running_key_cipher (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_2659dcddbc9d (Metraipolis archive dc_2659dcddbc9d, sha256 334aed33a4bed50ee593518909490ae03ae24e07d8a3efdc160b0074c2eddc40)
BibTeX
@misc{dc2659dcddbc9d,
  title = {Running key cipher — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Running_key_cipher},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_2659dcddbc9d; sha256 334aed33a4bed50ee593518909490ae03ae24e07d8a3efdc160b0074c2eddc40},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Running_key_cipher. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In classical cryptography, the running key cipher is a type of polyalphabetic substitution cipher in which a text, typically from a book, is used to provide a very long keystream. The earliest description of such a cipher was given in 1892 by French mathematician Arthur Joseph Hermann (better known for founding Éditions Hermann). Usually, the book to be used would be agreed ahead of time, while the passage to be used would be chosen randomly for each message and secretly indicated somewhere in the message. The term running key was introduced by William F. Friedman; it is distinct from progressive key (David Kahn's term for systems such as that of Trithemius, which cycle through every alphabet in a fixed order before repeating) or progressing key (Gaines' term for the same concept). An early cryptanalysis of a running-text key was carried out by Étienne Bazeries in 1899, when he read the enciphered dispatches of the conspirators around the Duke of Orléans. The dispatches were written in four-figure groups, each pair of digits standing for a letter through a Beaufort table, and the key was a continuous text: successive lines of Alfred de Musset's poem La Nuit de décembre, or a written-out date, selected according to the calendar date. Because the key did not repeat over the short telegrams, their apparent periodicity was a chance effect, and Bazeries recovered the messages by guessing probable words.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «public-key cryptography»).
Fonte: Wikipedia in inglese, voce «Running key cipher» — https://en.wikipedia.org/wiki/Running_key_cipher
Wikidata Q7380031 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7380031
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Running_key_cipher?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1357682815, consultata il 2026-10-15T15:34:16.743Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: da6170ce21ce07e4f65e0b019f2e7d1552dc19f80565ade4e4e0d96cc9cebe51