Chris Spackman

Glossary

Plain-English definitions of terms used on the math, geometry, cryptography, and codebreaking pages on this site. (The cryptanalysis and early-modern sections used to have glossaries of their own; their terms now live here.) Click a term in the list below to jump to its definition, or use the "Used on:" links to go back to the page where you saw the term.

Quick Navigation

Math

Prime Number

A whole number greater than 1 that can only be divided evenly by 1 and itself. For example, 7 is prime because nothing divides it evenly except 1 and 7. The number 6 is not prime because 2 × 3 = 6.

Used on: Diffie-Hellman, RSA Key Generation

Modular Arithmetic (mod)

"Mod" means "remainder after division." For example, 17 mod 5 = 2, because 17 ÷ 5 = 3 remainder 2. Think of a clock: after 12 comes 1 again, not 13 — that is modular arithmetic with a modulus of 12.

Used on: Diffie-Hellman, RSA Key Generation, Caesar Cipher, Vigenère Cipher, One-Time Pad

Coprime

Two numbers are coprime when they share no common factors other than 1. For example, 8 and 15 are coprime because no number (other than 1) divides both of them evenly. Another way to say this: their GCD is 1.

Used on: RSA Key Generation

Exponent

A small number written above and to the right of another number, telling you how many times to multiply that number by itself. In 53, the exponent is 3, meaning 5 × 5 × 5 = 125.

Used on: Diffie-Hellman, RSA Key Generation

Modulus

The number you divide by when doing modular arithmetic. In "17 mod 5," the modulus is 5. In cryptography, the modulus is usually a very large number that helps keep calculations secure.

Used on: Diffie-Hellman, RSA Key Generation

Totient — phi(φ)

The totient of a number n, written φ(n), counts how many numbers from 1 to n share no common factors with n. In RSA, when n = p × q (two primes), the totient is simply (p−1) × (q−1).

Used on: RSA Key Generation

Modular Inverse (Modular Multiplicative Inverse)

The modular inverse of a number a (mod m) is another number d such that a × d mod m = 1. Think of it as "undoing" multiplication in modular arithmetic, similar to how dividing undoes multiplying with regular numbers.

Used on: RSA Key Generation

Factor / Factoring

A factor is a number that divides evenly into another number. Factoring means breaking a number into the numbers that multiply together to make it. For example, the factors of 12 are 1, 2, 3, 4, 6, and 12. RSA security depends on the fact that factoring very large numbers is extremely hard.

Used on: RSA Key Generation

GCD (Greatest Common Divisor)

The largest number that divides evenly into two or more numbers. For example, the GCD of 12 and 18 is 6. If the GCD of two numbers is 1, they are coprime.

Used on: RSA Key Generation

Geometry & Trigonometry

Vertical Angles

When two straight lines cross, the two angles directly across from each other are called vertical angles. They are always equal. (The word "vertical" here means "sharing a vertex," not "up and down.")

Used on: Geometry Explorer

Supplementary Angles

Two angles that add up to 180°. Angles that sit next to each other along a straight line are always supplementary: if one is 70°, the other must be 110°.

Used on: Geometry Explorer

Complementary Angles

Two angles that add up to 90°. The two sharp angles in a right triangle are always complementary, because all three angles must add up to 180° and the right angle already uses 90° of that.

Used on: Geometry Explorer

Transversal

A line that crosses two or more other lines. When it crosses two parallel lines, it makes eight angles that come in only two sizes, which is why corresponding and alternate interior angles are equal.

Used on: Geometry Explorer

Corresponding Angles

When a transversal crosses two lines, the angles in the same position at each crossing (for example, both above the line and to the left of the transversal) are corresponding angles. If the two lines are parallel, corresponding angles are equal.

Used on: Geometry Explorer

Alternate Interior Angles

When a transversal crosses two lines, the angles between the two lines (interior) and on opposite sides of the transversal (alternate) are alternate interior angles. They are equal when the two lines are parallel.

Used on: Geometry Explorer

Hypotenuse

The longest side of a right triangle, which is always the side across from the right angle. The other two sides are called legs.

Used on: Geometry Explorer

Pythagorean Theorem

In a right triangle, the squares of the two legs add up to the square of the hypotenuse: a² + b² = c². For legs of 3 and 4, the hypotenuse is 5, because 9 + 16 = 25.

Used on: Geometry Explorer

Sine, Cosine, Tangent (sin, cos, tan)

Ratios of the sides of a right triangle, measured from one of its sharp angles: sine = opposite ÷ hypotenuse, cosine = adjacent ÷ hypotenuse, tangent = opposite ÷ adjacent (often remembered as SOH-CAH-TOA). They depend only on the angle, not on how big the triangle is, so a 30° angle always has a sine of 0.5.

Used on: Geometry Explorer

Unit Circle

A circle with radius 1 centered at the origin of a graph. A point on it at angle θ (measured counter-clockwise from the positive x-axis) has coordinates (cos θ, sin θ). This is how sine and cosine are defined for angles bigger than 90°, where a right triangle no longer works.

Used on: Geometry Explorer, Unit Circle Explorer

Radian

A way of measuring angles by distance around a unit circle instead of by degrees. A full turn (360°) is 2π radians, so 180° is π radians and 90° is π/2. One radian is about 57.3°.

Used on: Geometry Explorer, Unit Circle Explorer

Inscribed Angle

An angle whose corner (vertex) is on a circle and whose two sides are chords of that circle. An inscribed angle is always exactly half of the central angle that opens onto the same arc, so every inscribed angle on a given arc has the same size, and an inscribed angle that opens onto a half circle (a diameter) is 90°.

Used on: Geometry Explorer

Central Angle

An angle whose corner is at the center of a circle and whose sides are two radii. It has the same measure as the arc it cuts off; an inscribed angle on that same arc is half as big.

Used on: Geometry Explorer

Similar (Similar Figures)

Two shapes are similar when they have exactly the same shape but not necessarily the same size: the same angles, with every length in one being the same number of times (the scale factor) longer than the matching length in the other. Two triangles are similar as soon as two of their angles match.

Used on: Geometry Explorer

Scale Factor

The number you multiply every length by to turn a shape into a similar copy. A scale factor of 2 doubles every side and the perimeter, but makes the area 4 times bigger (2²), because area is measured in two directions.

Used on: Geometry Explorer

Interior Angle

An angle inside a polygon, between two sides that meet at a corner. The interior angles of a polygon with n sides always add up to (n − 2) × 180°: 180° for a triangle, 360° for a quadrilateral, 540° for a pentagon, and so on.

Used on: Geometry Explorer

Exterior Angle

The angle between one side of a polygon and the next side extended: how far you turn at that corner if you walk around the outside. The exterior angles of any polygon add up to 360°, because walking all the way around is one full turn.

Used on: Geometry Explorer

Perimeter

The distance around the outside of a shape: add up all the sides. A 6 by 4 rectangle has a perimeter of 6 + 4 + 6 + 4 = 20. Measured in plain units (cm, m, inches).

Used on: Geometry Explorer

Area

The amount of space inside a shape, measured in square units (cm², m²). A 6 by 4 rectangle has an area of 6 × 4 = 24 square units: you could fit 24 one-by-one squares inside it. Shapes with the same perimeter can have very different areas.

Used on: Geometry Explorer

Cryptography

Cipher

A method for transforming a message so that only someone with the right key can read it. The original message is called the plaintext, and the scrambled version is called the ciphertext. Examples include the Caesar cipher, substitution cipher, and Vigenère cipher.

Used on: Caesar Cipher, Substitution Cipher, Playfair Cipher, Vigenère Cipher, Rail Fence Cipher, Columnar Transposition, One-Time Pad, Traditional Cryptography

Plaintext

The original, readable message before it has been encrypted. After encryption, it becomes ciphertext. The goal of decryption is to turn ciphertext back into plaintext.

Used on: Caesar Cipher, Substitution Cipher, Playfair Cipher, Vigenère Cipher, Rail Fence Cipher, Columnar Transposition, One-Time Pad

Ciphertext

The scrambled, unreadable version of a message after it has been encrypted. Without the correct key, ciphertext looks like random letters. Decrypting it with the right key turns it back into the original plaintext.

Used on: Vigenère Cipher, Rail Fence Cipher, Columnar Transposition, One-Time Pad

Key (Cipher Key)

A piece of information that controls how a cipher encrypts and decrypts messages. For a Caesar cipher, the key is the shift number. For a substitution cipher, the key is the scrambled alphabet. Without the correct key, you cannot decrypt the message.

Used on: Caesar Cipher, Substitution Cipher, Playfair Cipher, Vigenère Cipher, Columnar Transposition, One-Time Pad

Key Space

The total number of possible keys for a cipher. A larger key space means more keys an attacker would have to try in a brute-force attack. The Caesar cipher has a key space of only 26. The substitution cipher has a key space of 26! (about 4 × 1026).

Used on: Caesar Cipher, Substitution Cipher, Traditional Cryptography

Frequency Analysis

A method for breaking ciphers by studying how often each letter appears. In English, "E" is the most common letter (about 13% of all letters). If a ciphertext has one letter appearing much more than others, it is likely "E" in disguise. Combined with digraph and trigraph analysis, this technique breaks any simple substitution cipher despite its huge key space.

Used on: Substitution Cipher, Playfair Cipher, Vigenère Cipher, Rail Fence Cipher, Columnar Transposition, Traditional Cryptography, Breaking Substitution Ciphers, Breaking Vigenère, CODEX Codebook Suite

Substitution Cipher

A cipher that replaces each letter with a different letter. In a simple substitution cipher, each letter always maps to the same replacement letter. The Caesar cipher is a special case where the mapping is a simple shift. Substitution ciphers are vulnerable to frequency analysis.

Used on: Substitution Cipher, Playfair Cipher, Rail Fence Cipher, Traditional Cryptography, Breaking Substitution Ciphers, CODEX Codebook Suite

Transposition Cipher

A cipher that rearranges the positions of letters without changing the letters themselves. The rail fence cipher is a transposition cipher: the letters in the ciphertext are exactly the same as in the plaintext, just in a different order. This means frequency analysis is useless against it.

Used on: Rail Fence Cipher, Columnar Transposition, Traditional Cryptography, Breaking Transposition, CODEX Codebook Suite

Monoalphabetic Cipher

A cipher that uses a single, fixed substitution alphabet: every time a given plaintext letter appears, it is always replaced by the same ciphertext letter. The simple substitution cipher and the Caesar cipher are both monoalphabetic. Because each letter keeps a one-to-one disguise, the plaintext's letter pattern shows through and these ciphers fall quickly to frequency analysis. The opposite is a polyalphabetic cipher, which switches between several alphabets.

Used on: Substitution Cipher, Cryptanalysis, Breaking Substitution Ciphers, Breaking Vigenère, Breaking Transposition

Polyalphabetic Cipher

A cipher that uses multiple different substitution alphabets, switching between them as it encrypts. The Vigenère cipher is the most famous example: each letter of the keyword selects a different Caesar shift. This makes simple frequency analysis much harder because the same plaintext letter can encrypt to different ciphertext letters.

Used on: Vigenère Cipher, Breaking Vigenère, CODEX Codebook Suite

Digraph

A pair of two letters, used as the basic unit of encryption in the Playfair cipher. Instead of encrypting one letter at a time, the Playfair cipher splits the message into digraphs and transforms each pair together. This makes the cipher harder to break with simple frequency analysis. In cryptanalysis, digraph analysis counts the letter pairs of a ciphertext: in English TH, HE, IN, ER and AN are the commonest, so a pair that keeps recurring in a substitution cipher is probably one of them.

Used on: Playfair Cipher, Breaking Substitution Ciphers, Breaking Transposition

One-Time Pad

A cipher that uses a truly random key that is as long as the message and is used only once. When used correctly, it is the only cipher that is mathematically proven to be unbreakable. The practical challenge is that you need a secure way to share the key, which is as long as the message itself.

Used on: One-Time Pad

Symmetric Encryption

Encryption where the same key is used to both encrypt and decrypt the message. All five traditional ciphers on this site are symmetric: if you know the key used to encrypt, you can decrypt. The opposite is asymmetric encryption (like RSA), where different keys are used for encrypting and decrypting.

Used on: One-Time Pad

Asymmetric Encryption

Encryption that uses a pair of different keys instead of one shared key: a public key that anyone can use to encrypt a message, and a matching private key that only the owner has and can use to decrypt it. Because the two keys are different, you can share the public key openly without giving away the secret one. RSA is the best-known example. This is the opposite of symmetric encryption, where the same key both encrypts and decrypts.

Used on: RSA Key Generation

Public Key

A key that you share openly with everyone. Other people use your public key to encrypt messages that only you can read, or to verify your digital signature. It is safe for anyone to see your public key.

Used on: Diffie-Hellman, RSA Key Generation

Private Key

A secret key that only you know. You use it to decrypt messages that were encrypted with your public key, or to create a digital signature. If someone else gets your private key, they can read your messages and pretend to be you.

Used on: Diffie-Hellman, RSA Key Generation

Key Exchange

A method for two people to agree on a secret key without ever sending that key directly. Even if someone is listening to every message they send, they still cannot figure out the secret key.

Used on: Diffie-Hellman, One-Time Pad, Traditional Cryptography

Shared Secret

A secret value that two people both know, but nobody else does. In Diffie-Hellman, Alice and Bob each calculate the same secret number independently, without ever sending it to each other.

Used on: Diffie-Hellman

Encrypt / Decrypt

To encrypt means to scramble a message so that only someone with the right key can read it. To decrypt means to unscramble an encrypted message back into readable text. Think of it as locking and unlocking a message.

Used on: Diffie-Hellman, RSA Key Generation, Caesar Cipher, Substitution Cipher, Playfair Cipher, Vigenère Cipher, Rail Fence Cipher, Columnar Transposition, One-Time Pad, Traditional Cryptography

Digital Signature

A way to prove that a message really came from a specific person and has not been changed. The sender uses their private key to "sign" the message, and anyone can use the sender's public key to check that the signature is real.

Used on: RSA Key Generation

Discrete Logarithm Problem

A math problem that is easy to do in one direction but extremely hard to reverse. It is easy to calculate ga mod p, but given the result, it is nearly impossible to figure out what a was. This one-way difficulty is what makes Diffie-Hellman secure.

Used on: Diffie-Hellman

Brute Force

Trying every possible combination until you find the right one. For example, trying every possible password one by one. With large enough numbers, brute force would take millions of years even on the fastest computers.

Used on: RSA Key Generation, Caesar Cipher, Substitution Cipher, Breaking Transposition

Eavesdropper

Someone who secretly listens to or watches a conversation between other people. In cryptography, an eavesdropper is anyone trying to intercept and read messages that are not meant for them.

Used on: Diffie-Hellman

HTTPS

The secure version of HTTP, the protocol your browser uses to load web pages. When you see a lock icon in your browser's address bar, that means HTTPS is being used. HTTPS uses key exchange and encryption (like Diffie-Hellman) to keep your data private as it travels over the internet.

Used on: Diffie-Hellman

Codes & Codebooks

Code

A system that replaces whole words or phrases with arbitrary symbols (usually numbers). Unlike a cipher, which transforms individual letters according to a rule, a code has no mathematical relationship between the original word and its replacement. "ATTACK" might be code 7392 while "RETREAT" is 5023 — there is no pattern you can use to predict one from the other.

Used on: Codebooks, Zimmermann Telegram, Black Chamber, CODEX Codebook Suite

Codebook

A book (or document) that lists the correspondence between words/phrases and their code numbers. Both the sender and receiver must have a copy. A codebook typically has two sections: an encoding section (sorted by word) for the sender, and a decoding section (sorted by number) for the receiver. Diplomatic codebooks could contain tens of thousands of entries.

Used on: Codebooks, Zimmermann Telegram, Black Chamber, CODEX Codebook Suite

Code Group

A single unit in a coded message — typically a four- or five-digit number that represents one word or phrase from the codebook. The Zimmermann Telegram, for example, was transmitted as a series of code groups like "13042 13401 8501."

Used on: Codebooks, Zimmermann Telegram, CODEX Codebook Suite

Nomenclator

A hybrid system combining a small codebook (for important words and names) with a substitution cipher (for everything else). Nomenclators were the standard tool of European diplomatic communication from the 1400s through the 1800s. They were more secure than pure ciphers, but the cipher portion was still vulnerable to frequency analysis.

Used on: Codebooks

Homophone

In a codebook or cipher, a homophone is one of several different code groups that all mean the same thing. For example, a codebook might give the common word “the” twelve different codes, picked at random each time it appears. This is called homophonic substitution. It is the single most effective defense against simple frequency analysis: because the most common plaintext words now produce many different code groups instead of just one, no code group stands out as obviously meaning “the” or “and.” The defender pays for this in book size — the codebook has to be much larger — and the attacker responds with techniques like distributional clustering that try to group the homophones back together.

Used on: CODEX Codebook Suite

Null

A meaningless symbol inserted into a coded or enciphered message to confuse cryptanalysts. A null adds no information to the message — the receiver simply ignores it. Nulls make it harder to analyze the real content by disrupting patterns and inflating the apparent number of different code groups.

Used on: Codebooks, CODEX Codebook Suite

Superencipherment

A second layer of encryption applied on top of a code. After encoding a message with a codebook, the code numbers are then modified using a cipher (for example, adding a secret number sequence to each code group). This means that even if an enemy has captured the codebook, they still cannot read the message without also knowing the superencipherment key.

Used on: Codebooks, Zimmermann Telegram, CODEX Codebook Suite

Plaincode

A coded message that has not been superenciphered — the code groups are transmitted exactly as they appear in the codebook. A plaincode message is easier to break than a superenciphered one, because the same word always produces the same code number, allowing pattern analysis over time.

Used on: Codebooks

Cryptanalysis

Cryptanalysis

The study and practice of breaking codes and ciphers — reading secret messages without having the key. Cryptanalysis encompasses everything from simple frequency analysis to sophisticated statistical methods like the Index of Coincidence. William Friedman transformed it from a craft into a branch of applied mathematics.

Used on: Early Modern Cryptanalysis, Codebooks, Zimmermann Telegram, Black Chamber, Friedman

Cryptanalyst

A person who practices cryptanalysis — someone who breaks codes and ciphers. In the early 20th century, cryptanalysts were often linguists, classicists, or mathematicians recruited for their pattern-recognition skills. Friedman's innovation was to make cryptanalysis more systematic and less dependent on individual brilliance.

Used on: Codebooks, Zimmermann Telegram, Black Chamber, Friedman

Ciphertext-Only Attack

An attack where the analyst has only the encrypted message — no known plaintext, no cribs, no other information. This is the hardest type of attack and the most realistic: in practice, you usually start with nothing but the intercepted message. All the techniques on these pages work in the ciphertext-only scenario.

Used on: Breaking Substitution Ciphers, Breaking Vigenère, Breaking Transposition

Known-Plaintext Attack

An attack where the analyst knows (or can guess) some of the original plaintext. For example, if a military message always starts with "REPORT FROM" or a letter always ends with "SINCERELY," that known text (called a crib) can be used to deduce parts of the key. Known-plaintext attacks are much easier than ciphertext-only attacks.

Used on: Breaking Substitution Ciphers

Crib

A piece of known or guessed plaintext that the analyst believes appears somewhere in the encrypted message. Cribs are enormously helpful: if you know the message starts with "DEAR SIR" or contains "ATTACK AT DAWN," you can use that knowledge to work out parts of the key. Military messages were often vulnerable to cribs because of standard formatting (headers, signatures, weather reports with predictable content).

Used on: Breaking Substitution Ciphers

Pattern Analysis

Looking for structural patterns in the ciphertext that reveal information about the plaintext. This includes finding single-letter words (probably A or I in English), repeated sequences, and word-length patterns. In a substitution cipher, the structure of the plaintext is fully preserved — only the letters change — so pattern analysis is very powerful.

Used on: Breaking Substitution Ciphers

Trigraph Analysis

Studying triples of adjacent letters (trigraphs) in the ciphertext. THE is by far the most common English trigraph, followed by AND, ING, HER, and HAT. Finding a repeated trigraph in a polyalphabetic cipher is the basis of the Kasiski examination.

Used on: Breaking Substitution Ciphers, Breaking Vigenère

Anagramming (Column Anagramming)

A technique for breaking transposition ciphers, particularly columnar transposition. The ciphertext is arranged into columns, and the analyst tries rearranging the column order until the text reads as meaningful English. The correct arrangement is identified by looking for common English digraphs between adjacent columns.

Used on: Breaking Transposition

Polyalphabetic Detection

Determining whether a ciphertext was produced by a polyalphabetic cipher (like Vigenère) rather than a monoalphabetic one. The primary tool is the Index of Coincidence: monoalphabetic ciphers have an IC near 0.067 (same as English), while polyalphabetic ciphers push the IC toward 0.038 (random). This distinction is the first step in any attack.

Used on: Breaking Vigenère

Index of Coincidence (IC)

A statistical measure developed by William Friedman that calculates the probability that two randomly chosen letters from a text are the same. English text has an IC of about 0.0667 (because common letters like E and T appear often). Random text has an IC of about 0.0385 (exactly 1/26). The IC can reveal what type of cipher was used: a monoalphabetic cipher preserves the English IC, while a polyalphabetic cipher pushes it toward the random value. The IC can also be used to estimate key length.

Used on: Friedman, Breaking Vigenère, Breaking Transposition

Kasiski Examination

A method for finding the key length of a polyalphabetic cipher (like Vigenère). It works by finding repeated sequences of letters in the ciphertext. The distance between repetitions is always a multiple of the key length. By finding the greatest common divisor (GCD) of all these distances, you can determine the most likely key length. Named after Friedrich Kasiski, who published the method in 1863.

Used on: Friedman, CODEX Codebook Suite, Breaking Vigenère

Chi-Squared Test (χ2)

A statistical test that measures how well an observed distribution matches an expected distribution. In cryptanalysis, it is used to compare the letter frequencies in a ciphertext to the expected frequencies of English. A low χ2 value means the text closely matches English; a high value means it does not. This is useful for breaking Caesar ciphers: try all 26 shifts and pick the one with the lowest χ2.

Used on: Friedman, Breaking Vigenère

Traffic Analysis

Gathering intelligence from the patterns of communication rather than its content. Even without reading the messages, an analyst can learn a great deal from who is communicating with whom, how often, and when. A sudden increase in radio traffic between a military headquarters and front-line units might signal an upcoming attack, even if the messages themselves are unreadable.

Used on: Black Chamber

Strip Cipher

A cipher device consisting of a set of alphabet strips — each with the 26 letters in a different scrambled order — mounted on a cylinder or frame. To encrypt, the user arranges strips so one row spells out the plaintext, then reads off a different row as ciphertext. Parker Hitt designed the first American strip cipher around 1914. His design evolved into the U.S. Army's M-138 strip cipher, used through World War II. Strip ciphers were a stepping stone between manual ciphers and electromechanical cipher machines like Enigma.

Used on: Hitt, Friedman, and Scientific Cryptanalysis

Manual for the Solution of Military Ciphers

The first American military textbook on cryptanalysis, written by Parker Hitt and published in 1916. It covered practical techniques for breaking substitution and transposition ciphers, including frequency analysis, digraph and trigraph analysis, and methods for attacking polyalphabetic ciphers like Vigenère. The Manual trained a generation of American military cryptanalysts and was among the texts William Friedman studied as he developed his own methods.

Used on: Hitt, Friedman, and Scientific Cryptanalysis, Early Modern Cryptanalysis

Codebreakers & Organizations

Room 40

The British Admiralty's codebreaking unit during World War I, named after its office number in the Old Admiralty Building. Room 40 was responsible for decoding the Zimmermann Telegram and reading German naval communications throughout the war. Its staff included linguists, classicists, and crossword enthusiasts — foreshadowing the diverse mix of talent at Bletchley Park in World War II.

Used on: Zimmermann Telegram

MI-8

Military Intelligence, Section 8 — the US Army's codebreaking unit during World War I, created in 1917 under Herbert O. Yardley. MI-8 broke enemy codes and developed secure American code systems. After the war, it evolved into the Cipher Bureau (the Black Chamber).

Used on: Black Chamber

Black Chamber (Cipher Bureau)

The informal name for the American Cipher Bureau, the US government's peacetime codebreaking organization from 1919 to 1929. Jointly funded by the War Department and State Department, it operated in secret from New York City under Herbert Yardley. Its greatest success was breaking Japanese diplomatic codes before the Washington Naval Conference. It was shut down by Secretary of State Henry Stimson in 1929.

Used on: Black Chamber, Friedman

Signal Intelligence Service (SIS)

The US Army's codebreaking organization founded in 1929 under William Friedman, after the Black Chamber was shut down. The SIS brought a more scientific and mathematical approach to cryptanalysis. Friedman's team at SIS broke the Japanese PURPLE cipher machine in 1940. The SIS eventually evolved into the Army Security Agency and then the National Security Agency (NSA).

Used on: Friedman

SIGINT (Signals Intelligence)

Intelligence gathered from intercepted communications and electronic signals. SIGINT includes both cryptanalysis (breaking the codes) and traffic analysis (studying the patterns of communication). The organizations discussed on these pages — Room 40, MI-8, the Black Chamber, and the SIS — were all SIGINT organizations.

Used on: Early Modern Cryptanalysis

Probability & Statistics

Probability

How likely something is to happen, expressed as a number between 0 (impossible) and 1 (certain), or as a percentage between 0% and 100%. A fair coin has a probability of 0.5 (50%) of landing on heads.

Used on: Coin Flip Simulator

Law of Large Numbers

A rule in probability that says the more times you repeat an experiment (like flipping a coin), the closer your results will get to the expected value. With 10 flips you might get 70% heads, but with 10,000 flips you will almost certainly be very close to 50%.

Used on: Coin Flip Simulator

Cumulative

Adding up all the results so far, not just the most recent ones. Cumulative statistics combine everything from the beginning up to now. For example, if you flip a coin three separate times and get 3 heads, then 2 heads, then 4 heads, your cumulative total is 9 heads.

Used on: Coin Flip Simulator

Simulation

Using a computer to imitate a real-world process. Instead of actually flipping a coin 1,000 times, a simulation uses random numbers to produce the same kind of results much faster.

Used on: Coin Flip Simulator

Disclaimer: these pages are educational demos provided as-is, with no warranty of any kind. The author is not responsible for any consequences arising from their use.

Send comments and bug reports to chris@chrisspackman.com.

Version 1.2 — Last updated: 2026-10-31

This page is Copyright © 2025 – 2026 Chris Spackman.
This web site developed entirely on GNU/Linux with Free / Open Source Software.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Creative Commons License