liveBook · Manning

Caesar cipher

A Caesar cipher is a substitution cipher that shifts each alphabetic letter by a fixed number of positions with wrap-around.

How 2 Manning books explain it

Julia as a Second Language

A Caesar cipher is a substitution cipher that shifts each alphabetic letter by a fixed number of positions with wrap-around.

How it is used
Serves as an interchangeable encryption algorithm in a password-keeping example that contrasts object-oriented and functional designs.
How deep it goes
Works through uppercase character encryption, modulo wrap-around, decryption, whole-message mapping, and two service integrations.
Examples
Uses a full-sentence encryption round trip, a `HELLO` pipeline, and password-vault storage and retrieval.
What you can do after
Build it from scratch in Julia and plug it into either an interface-based or function-based password keeper.

Read how Julia as a Second Language explains Caesar cipher →

Learn Haskell by Example

A Caesar cipher is a substitution cipher that replaces each letter with another letter a fixed distance away in an ordered alphabet.

How it is used
Teaches functional programming through a practical string-transformation and encryption exercise.
How deep it goes
Works from alphabet rotation through character helpers, recursion, map, symmetry, and frequency analysis, while stopping short of secure cryptography.
Examples
Uses substitution wheels, ROT13 messages, digit rotations, GHCi evaluations, and frequency-analysis exercises.
What you can do after
Build a Caesar cipher in Haskell, test reversible rotations, and investigate weak encryption with frequency counts.

Read how Learn Haskell by Example explains Caesar cipher →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.