Skip to main content
Cipher Visualizers home

Tag

#Brute Force

6 articles with this tag.

A visual representation of breaking DES by exhaustive key search
Modern & Applied Cryptography Breakers Intermediate

Breaking DES with Brute-Force Key Search

DES never fell to clever math. It fell to a loop: try a key, encrypt a known block, compare, repeat. This post runs that exact loop against real DES, the same one EFF's Deep Crack ran over all 2⁵⁶ keys in 1998.

18 min read

A visual representation of breaking the Autokey Cipher
Basic Classic Symmetric Breakers Intermediate

Breaking the Autokey Cipher

The Autokey cipher defeats Kasiski examination and the Index of Coincidence by never repeating its key. But the short priming key that starts everything off is still just a handful of letters, and one wrong guess collapses the entire decryption for you.

34 min read

A visual representation of breaking the Rail Fence Cipher
Basic Classic Symmetric Breakers Beginner

Breaking the Rail Fence Cipher

Every other transposition breaker on this site has to search over orderings. Columnar Transposition alone hides a factorial number of column arrangements behind its key. Rail Fence has no such trapdoor: the entire key is a single small number, so brute force checks every possibility outright.

14 min read

A visual representation of breaking the Affine Cipher
Basic Classic Symmetric Breakers Beginner

Breaking the Affine Cipher

Learn how to break the Affine cipher by brute-forcing its entire 312-key keyspace and scoring each decryption with a common-word heuristic. It's the same strategy that cracks Caesar, just applied to a slightly bigger lock.

15 min read

A visual representation of breaking the Columnar Transposition Cipher
Basic Classic Symmetric Breakers Intermediate

Breaking the Columnar Transposition Cipher

Columnar transposition doesn't hide letters. It just rearranges them, so frequency analysis finds nothing wrong. Learn the attack that actually works: brute-forcing every column order for each candidate key length, scored by common English substrings.

18 min read

A visual representation of breaking a simplified Enigma machine
Basic Classic Symmetric Breakers Advanced

Breaking a Simplified Enigma Machine

The real wartime Enigma resisted brute force because of two unknowns stacked on top of its rotor positions: which three rotors were chosen and in what order, and how the plugboard was wired. Together these push the key space past 10^20. Strip those two unknowns away and only 17,576 rotor positions are left, small enough for a modern computer to brute-force outright.

27 min read

← All tags