Caesar cipher
Enable an agent to recognise a Caesar cipher, determine whether its alphabet and shift are sufficiently specified, and choose valid transformation, recovery or replacement actions.
Research draft, second pass
A second pass drafted this model: the structure a model of this thing needs, and what is known about it in the world. The line under this one says how the second half was obtained - researched against sources, or recalled without web access, in which case nothing here was read anywhere and every claim is a lead to verify. Unreviewed either way.
Researched by: Codex + Grok
Purpose and description
Enable an agent to recognise a Caesar cipher, determine whether its alphabet and shift are sufficiently specified, and choose valid transformation, recovery or replacement actions.
A Caesar cipher is a monoalphabetic substitution on a cyclic alphabet in which every letter is replaced by the letter a fixed number of positions away, equivalently c ≡ p + k (mod n) for alphabet size n and constant shift k.
It can be Encode supported text using a declared alphabet, shift and character policy.; Decode text by applying the inverse of the declared encryption shift.; Enumerate candidate shifts and retain ambiguity where evidence does not select one.; Test paired samples for a constant modular offset and identify contradictions.; Compare configurations for equivalent mappings, including shifts differing by a multiple of the alphabet size.; Flag confidentiality requirements that require a different encryption mechanism..
Distinguishing features
For an explicitly ordered alphabet of size N, every supported symbol maps to the symbol at index (i + k) mod N for one constant k.
Repeated occurrences of a supported symbol receive the same substitution regardless of position or neighbouring symbols.
The substitution preserves cyclic alphabet order; an arbitrary substitution permutation generally does not.
Supported symbols retain their positions rather than being rearranged, distinguishing the cipher from transposition.
ROT13 is the specific shift-13 case on a 26-letter alphabet; a Caesar cipher need not use either that shift or that alphabet.
Scope
+ The ordered alphabet and its cyclic indexing
+ The constant shift, direction convention and inverse transformation
+ Treatment of case, unsupported characters and text normalization
+ Plaintext-ciphertext relationships and evidence supporting candidate shifts
+ Completeness, consistency and security suitability of a Caesar-cipher configuration
- Arbitrary monoalphabetic substitution mappings
- Position-dependent or repeating-key shifts such as Vigenère
- General affine ciphers whose multiplier is not one
- Transposition ciphers that rearrange character positions
- Modern encryption protocols, key management and access control
- Historical attribution, biographies and transmission of particular documents
Characteristics
- Ordered alphabet
- Explicit finite sequence of distinct symbols The same numerical shift produces different substitutions when alphabet membership or order changes.
- Alphabet size
- N distinct symbols Determines wraparound, the number of distinct shifts and the size of exhaustive recovery.
- Canonical encryption shift
- Integer k in 0 through N−1, with encryption defined as i ↦ (i + k) mod N Makes equivalent shift descriptions comparable and fixes the direction of the transformation.
- Shift knowledge
- Unspecified | candidate set | uniquely supported | contradicted Separates an executable configuration from an inference that still requires evidence.
- Case treatment
- Separate aligned alphabets | case normalization | case included in alphabet | other explicitly defined policy Controls whether uppercase and lowercase characters transform alike and whether original case can be recovered.
- Unsupported-symbol treatment
- Preserve | reject | remove | explicitly defined preprocessing Determines the handling of spaces, punctuation, digits and symbols outside the alphabet.
- Paired-text evidence
- Links to plaintext-ciphertext pairs with alignment and provenance Allows the agent to test whether observed substitutions support one constant shift.
- Exact recovery status
- Original input recoverable | normalized input only recoverable | unresolved The substitution is reversible, but normalization or symbol removal can discard information.
- Intended use
- Teaching | puzzle | reversible obfuscation | claimed confidentiality | unspecified Distinguishes appropriate illustrative uses from security requirements the cipher cannot meet.
Also called
Where this came from
wikidata · CC0 1.0
Drafted structure
Bundle to layer to finding to question, as the second pass will find it: 6 bundles · 11 layers · 18 findings · 28 questions.
Cyclic substitution identity Establishes whether the proposed transformation is a Caesar cipher over a declared alphabet.
A constant numerical shift is meaningful only relative to a fixed alphabet order and must be distinguished from other substitution rules.
Alphabet basis
Records the symbols and order that define the substitution cycle.
Explicit alphabet cycle
Recognition requires a finite ordered alphabet with distinct symbols and a defined indexing convention.
- Which distinct symbols form the alphabet, and in what exact order? definition
- Is that order supplied by the configuration, established by a source, or assumed during analysis? provenance
Constant offset test
Tests whether the mapping is one rotation of that alphabet.
Uniform modular displacement
Every supported substitution must have the same modular displacement; variation by position or symbol contradicts the declared Caesar rule.
- Does every observed supported substitution satisfy (ciphertext index − plaintext index) mod N = k for the same k? measurement
- Does any observed mapping require an arbitrary permutation, a changing shift or a rearrangement of positions? boundary
Shift and inverse Makes the transformation executable and its parameter descriptions comparable.
A shift value without direction and modulus can produce the wrong result even when the cipher family is correctly identified.
Encryption parameter
Expresses the shift under one explicit encryption convention.
Canonical shift
Represent encryption as addition of k modulo N and reduce equivalent signed or oversized shifts to the same canonical value.
- What value of k represents encryption under the declared positive alphabet direction? definition
- What canonical value results when the supplied shift is reduced modulo N? measurement
Inverse and special cases
Determines the reverse operation and identifies identity or self-inverse rotations.
Inverse shift behaviour
Decoding uses −k modulo N; k = 0 is the identity, and a rotation is self-inverse when 2k is divisible by N.
- Which inverse shift restores supported input symbols after encryption? action
- Does this configuration produce an identity mapping or a self-inverse rotation? measurement
Text handling contract Defines how actual text is converted into cipher symbols and reconstructed.
Unstated case, punctuation or normalization rules can prevent reproducibility and exact recovery.
Symbol interpretation
Establishes the units shifted and how textual variants enter the alphabet.
Case and normalization policy
The agent needs explicit rules for case and normalization rather than assuming that all visually similar text denotes identical cipher symbols.
- What constitutes one cipher symbol, and how are uppercase, lowercase and accented forms handled? definition
- If case uses separate alphabets, do they apply the same shift under aligned alphabet orders? boundary
Preservation and loss
Separates reversible substitution from information lost through text preparation.
Unsupported symbols and round-trip recovery
Preservation, rejection or removal of unsupported symbols must be recorded, together with any effect on recovering the original input.
- Are spaces, punctuation, digits and other unsupported symbols preserved, rejected or removed? definition
- Does decoding an encoded sample reproduce the original input exactly or only its normalized form? measurement
Identification and recovery Tracks evidence for recognizing the cipher and recovering its shift.
Plausible decoded text alone does not establish a unique shift or prove that an unknown text uses this cipher.
Paired evidence
Uses aligned plaintext and ciphertext to support or contradict a candidate configuration.
Sample consistency
An aligned supported symbol pair determines a candidate offset for a fixed alphabet; additional pairs test whether that offset remains consistent.
- Where did the paired samples come from, and is their alignment established? provenance
- Which pairs support the candidate shift, and which contradict it after the declared preprocessing? measurement
Ciphertext-only candidates
Manages candidate rotations when the plaintext or shift is unknown.
Candidate set and ambiguity
A fixed alphabet permits enumeration of N distinct shift mappings, including the identity; language expectations can rank outputs without guaranteeing a unique answer.
- Which shifts remain plausible after enumeration, and what evidence supports their ranking? measurement
- What additional known text, language information or external clue would distinguish the remaining candidates? action
Use and exposure Connects the cipher's limited concealment properties to decisions about its use.
Successful encoding must not be mistaken for adequate protection of confidential information.
Observable patterns
Records information retained by the substitution and character-handling policy.
Pattern preservation
Within each shifted alphabet, the substitution preserves symbol-frequency counts up to relabelling and repeated-symbol patterns; preserved separators also expose text structure.
- Which repeated-symbol patterns, frequency counts and separators remain observable after transformation? measurement
- How many distinct shift mappings must be tried for the declared alphabet? measurement
Fitness for intent
Determines whether to apply the cipher or direct the task to another mechanism.
Concealment and confidentiality requirements
A Caesar cipher can serve teaching, puzzles and reversible obfuscation, but its small enumerable shift space makes it unsuitable for modern confidentiality requirements.
- Is the requested outcome demonstration, puzzle solving, casual concealment or protection against an adversary? boundary
- Should the agent perform the declared transformation or route a confidentiality requirement to a suitable encryption model? action
Evidence and external alignment What the world already says about this thing, gathered so the model can be checked against it.
A model that cannot be lined up against existing standards, identifiers and practice cannot be adopted by anyone who already uses them.
Reported evidence
Findings from the breadth pass, kept separate from the structural claims.
Kinds and varieties
Reported by the breadth pass; each item needs checking against its source before it becomes normative.
- Classical Caesar (k = 3 on the Latin alphabet, the form Suetonius attributes to Julius Caesar)
- Augustan shift (k = 1, the form Suetonius attributes to Augustus)
- General shift/additive cipher (arbitrary k, usually 1-25 on a 26-letter alphabet)
- ROT13 (k = 13 on 26 letters; an involution, widely used as a distinct named convention)
- ROT5 / ROT18 / ROT47 (digit-only, alphanumeric, and printable-ASCII shift variants used in puzzles and light obfuscation)
- Non-Latin modular Caesar (same additive rule on other cyclic alphabets, e.g. 32- or 33-letter Cyrillic)
- Which of these kinds and varieties hold for the sense of Caesar cipher this model covers, and on what evidence? provenance
Identifiers and schemes
Reported by the breadth pass; each item needs checking against its source before it becomes normative.
- Wikidata item - Q190234 - Item for the Caesar cipher as a cipher type.
- Wikidata item - Q541169 - Item for ROT13, the k = 13 special case treated as a named convention of its own.
- Which of these identifiers and schemes hold for the sense of Caesar cipher this model covers, and on what evidence? provenance
Standards and regulation
Reported by the breadth pass; each item needs checking against its source before it becomes normative.
- Not an approved cryptographic algorithm under NIST FIPS 140-3 or in the NSA Commercial National Security Algorithm (CNSA) suite; those regimes require modern, specified primitives rather than classical shifts.
- Taught as an insecure classical cipher in several national secondary-computing specifications (notably UK GCSE Computer Science papers such as OCR and AQA), which is curricular description, not an operational crypto standard.
- ROT13 is a community convention of Netnews/Usenet and later forums for hiding spoilers, not a standardised encryption algorithm in the IETF sense.
- Which of these standards and regulation hold for the sense of Caesar cipher this model covers, and on what evidence? provenance
Real-world use
Reported by the breadth pass; each item needs checking against its source before it becomes normative.
- Classroom and textbook introduction to substitution, modular arithmetic, and why key space and frequency statistics matter.
- ROT13 (and ROT47) to hide spoilers, punchlines, and puzzle solutions on Usenet, mailing lists, and forums.
- Puzzle hunts, escape rooms, geocaching listings, and CTF warm-up challenges.
- Toy or legacy obfuscation in source comments and config values; not relied on for actual secrecy.
- Historical reconstruction of Roman military correspondence as reported by Suetonius, not as a living field cipher.
- Which of these real-world use hold for the sense of Caesar cipher this model covers, and on what evidence? provenance
Typical measurements
Reported by the breadth pass; each item needs checking against its source before it becomes normative.
- Shift key k - 0-25 (often 1-25; 0 is the identity) - alphabet positions
- Alphabet size n - 26 for English Latin; 27 if Ñ is included; ~32-33 for Russian Cyrillic - letters
- Keyspace size - n distinct shifts, n−1 non-trivial - keys
- Nominal key entropy (English 26-letter case) - about 4.7 - bits
- Trials for exhaustive search - 25 for a 26-letter alphabet - decryptions
- Which of these typical measurements hold for the sense of Caesar cipher this model covers, and on what evidence? provenance
Failure modes and hazards
Reported by the breadth pass; each item needs checking against its source before it becomes normative.
- Exhaustive search over 25 keys recovers English plaintext immediately.
- Letter-frequency analysis identifies k because each plaintext letter has a single ciphertext image.
- A single known plaintext-ciphertext letter pair determines k.
- Using it as if it provided confidentiality (passwords, exam answers, 'encrypted' backups) yields a false sense of security.
- Implementations disagree on case, diacritics, digits, and whether non-letters are passed through, so interoperable decrypt often fails.
- Ciphertext is malleably additive: an attacker who knows the scheme can apply a further shift without the key.
- Which of these failure modes and hazards hold for the sense of Caesar cipher this model covers, and on what evidence? provenance
Regional variation
Reported by the breadth pass; each item needs checking against its source before it becomes normative.
- English usage splits between 'Caesar cipher' for any constant shift and a stricter use that reserves 'Caesar' for k = 3 and calls the rest a shift cipher.
- French chiffre de César, German Cäsar-Chiffre / Cäsar-Verschlüsselung, and Russian шифр Цезаря are the ordinary textbook names.
- ROT13 is a named everyday practice mainly in English-language internet culture; it is less often treated as a separate object in non-English school syllabi.
- Alphabet size and wrap-around follow the local orthographic alphabet, so a 'Caesar' tool built for A-Z mis-handles Ñ, Ä/Ö/Ü, or Cyrillic unless n is changed.
- Which of these regional variation hold for the sense of Caesar cipher this model covers, and on what evidence? provenance
Neighbouring kinds and how to tell them apart
Reported by the breadth pass; each item needs checking against its source before it becomes normative.
- Vigenère cipher - Vigenère applies a repeating sequence of Caesar shifts keyed by a word, so the same plaintext letter can map to different ciphertext letters; a true Caesar map is one shift for the whole text.
- Affine cipher - Affine encryption is c ≡ ap + b (mod n) with gcd(a, n) = 1; Caesar is the special case a = 1. Presence of a multiplier other than 1 separates them.
- Atbash - Atbash reflects the alphabet (A↔Z, B↔Y, …), which is not a rotation; the mapping is an involution whose pairs sit at complementary positions, not a constant offset.
- General monoalphabetic substitution - A mixed-alphabet cipher uses an arbitrary permutation of the alphabet. Caesar is only the n rotations; if the permutation is not a cyclic shift, it is not Caesar.
- Transposition ciphers (e.g. rail fence, columnar) - Those rearrange letter order and leave the letters themselves unchanged; Caesar changes identities and leaves order unchanged.
- Which of these neighbouring kinds and how to tell them apart hold for the sense of Caesar cipher this model covers, and on what evidence? provenance
Sources
- Caesar cipher - Wikipedia, Wikimedia Foundation - Definition as a constant-shift substitution, relation to ROT13, brute-force and frequency-analysis weakness, and the Suetonius attribution of k = 3 and k = 1.
- Suetonius, De vita Caesarum (Divus Iulius 56; Divus Augustus 88) - Loeb Classical Library, Harvard University Press - Primary historical witness that Julius Caesar wrote with a three-letter shift and that Augustus used a one-letter shift.
- David Kahn, The Codebreakers - Scribner (1967; revised 1996) - Placement of the Caesar shift among classical substitution ciphers and its status as a teaching example rather than a practical secrecy system.
- ROT13 - Wikipedia, Wikimedia Foundation - ROT13 as the self-inverse Caesar special case and its real-world use for Usenet/forum spoiler hiding rather than confidentiality.
What the second pass must settle
- Should the registry explicitly include Caesar rotations over arbitrary finite ordered symbol sets, or reserve the unqualified name for conventional letter alphabets?
- Should zero-shift identity configurations be recognized as degenerate Caesar ciphers or recorded as outside the registry entry's accepted boundary?
- Which case and normalization conventions should the model recognize as named profiles, and which must always be specified explicitly?
- What evidence standard should distinguish a plausible Caesar decoding from a confirmed identification when only a short ciphertext is available?