Deep dive into cryptographic vocabulary, mathematical models of encryptions, and basic shift operations.

1. Core Vocabulary & Concepts

• Plaintext (P): The original, readable message string or byte buffer before being processed by a cipher. E.g., "HELLO".
• Ciphertext (C): The scrambled, unreadable output of an encryption algorithm. To unauthorized parties, it should appear as cryptographically random noise.
• Encryption (E): The mathematical operation mapping plaintext and a key to ciphertext: E(P, K) = C.
• Decryption (D): The process of reconstructing plaintext from ciphertext using a key: D(C, K) = P. For a correct cipher, D(E(P, K), K) == P holds true.
• Cipher: The mechanical, electrical, or mathematical algorithm containing the logical steps for encryption and decryption.
• Cryptographic Key (K): A variable parameter (usually a string of random bits) that alters the cipher output. Its secrecy is the sole guarantor of confidentiality (Kerckhoffs's Principle).
• Cryptanalysis: The science of hacking or reverse engineering, cracking, or decyphering ciphertext without authorization or prior possession of the correct keys.
• Cryptology: The overarching discipline combining both cryptography (designing ciphers) and cryptanalysis (breaking ciphers).

2. Mathematical Models & Kerckhoffs's Principle

Modern systems assume the algorithm is public. The security of the system rests entirely on keeping the key secret.

Symmetric Cipher Equation: C = E_K(P) <=> P = D_K(C)

If the key is chosen from a key space of size 2^N (where N is the key length in bits), an attacker performing a brute-force search must search through 2^N combinations. A key size of 128 bits yields a key space of 3.4 x 10³⁸ combinations, making brute force physically impossible with current computing boundaries.

3. Detailed Step-by-Step Example: Caesar Cipher

The simplest substitution cipher: shifting letters along the modulo circle.