Secret Key Cryptography: Ciphers, from simple to unbreakable

Secret Key Cryptography  MEAP V09
Copyright
Welcome
Brief contents
Chapter 1: Introduction
Chapter 2: What is cryptography?
	2.1  Unbreakable Ciphers
	2.2  Types of Cryptography
	2.3  Symmetric vs Asymmetric Cryptography
	2.4  Block Ciphers vs Stream Ciphers
	2.5  Mechanical vs Digital
	2.6  Why Choose Secret Key?
	2.7  Why Build Your Own?
Chapter 3: Preliminary concepts
	3.1  Bits and Bytes
	3.2  Functions and Operators
	3.3  Boolean Operators
	3.4 Number Bases
	3.5  Prime Numbers
	3.6  Modular Arithmetic
Chapter 4: Cryptographer’s toolbox
	4.1  Rating System
	4.2  Substitution
		4.2.1  Huffman Codes
	4.3 Transposition
	4.4  Fractionation
	4.5  Random Number Generators
		4.5.1  Chained Digit Generator
	4.6  Useful Combinations, Wasteful Combinations
		4.6.1 Bazeries Type 4 Cipher
Chapter 5: Substitution ciphers
	5.1  Simple Substitution
	5.2 Mixing the Alphabet
	5.3  Nomenclators
	5.4  Polyalphabetic Substitution
	5.5  The Belaso Cipher
	5.6  The Kasiski Method
	5.7  Index of Coincidence
	5.8 Index of Coincidence, Again
	5.9 Solving a Polyalphabetic Cipher
		5.9.1  Solving a Belaso Cipher
		5.9.2  Solving a Vigenère Cipher
		5.9.3 Solving a General Polyalphabetic Cipher
	5.10  Autokey
	5.11  Running Key
	5.12  Simulated Rotor Machines
		5.12.1 Single Rotor Machine
		5.12.2  Three Rotor Machine
		5.12.3  Eight Rotor Machine
Chapter 6: Countermeasures
	6.1  Double Encipherment
	6.2  Null Characters
	6.3  Interrupted Key
	6.4  Homophonic Substitution
		6.4.1  Cipher 5858
	6.5  Bigram and Trigram Substitution
	6.6  Hiding Messages in Images
	6.7  Adding Null Bits
	6.8  Merging Multiple Messages
	6.9  Embedding a Message in a File
Chapter 7: Transposition
	7.1  Route Transposition
	7.2  Columnar Transposition
		7.2.1  Cysquare
		7.2.2  Word Transposition
	7.3 Double Columnar Transposition
	7.4  Cycling Columnar Transposition
	7.5  Random Number Transposition
	7.6  Selector Transposition
	7.7 Key Transposition
	7.8  Halving Transposition
	7.9  Multiple Anagramming
Chapter 8: Jefferson wheel cypher
	8.1  Known-Word Solution
	8.2  Ciphertext-Only Solution
Chapter 9: Fractionation
	9.1  Polybius Square
	9.2  Playfair
		9.2.1  Solving a Playfair Cipher
		9.2.2  Strengthening a Playfair Cipher
	9.3  Two Square
	9.4  Three Square
	9.5 Four Square
	9.6  Bifid
		9.6.1  Conjugated Matrix Bifid
	9.7  Diagonal Bifid
	9.8  6×6 Squares
	9.9 Trifid
	9.10  Three Cube
	9.11  Rectangular Grids
	9.12 Hexadecimal Fractionation
	9.13  Bitwise Fractionation
		9.13.1  Cyclic 8×N
	9.14  Other Fractionation
	9.15  Stronger Blocks
Chapter 10: Variable-length fractionation
	10.1  Morse3
	10.2  Monom-Binom
	10.3  Periodic Lengths
	10.4  Huffman Substitution
	10.5  Post Tag Systems
		10.5.1  Same-Length Tags
		10.5.2  Different-Length Tags
		10.5.3  Multiple Alphabets
		10.5.4  Short and Long Moves
	10.6  Fractionation in Other Bases
	10.7  Text Compression
		10.7.1 Lempel-Ziv
		10.7.2  Arithmetic Coding
		10.7.3  Adaptive Arithmetic Coding
Chapter 11: Block ciphers
	11.1  Substitution-Permutation Network
	11.2  DES Data Encryption Standard
		11.2.1  Double DES
		11.2.2  Triple DES
		11.2.3  Fast Bit Transposition
		11.2.4  Short Blocks
	11.3  Matrix Multiplication
	11.4  Matrix Multiplication
	11.5  AES Advanced Encryption Standard
	11.6  Fixed vs Keyed Substitution
	11.7  Involutory Ciphers
		11.7.1  Involutory Substitution
		11.7.2  Involutory Polyalphabetic Substitution
		11.7.3  Involutory Transposition
		11.7.4  Involutory Block Cipher
		11.7.5  Example, Poly Triple Flip
	11.8  Variable-Length Substitutions
	11.9  Ripple Ciphers
	11.10  Block Chaining
		11.10.1 Polyalphabetic Chaining
		11.10.2  Enciphered Chaining
		11.10.3  Lagged Chaining
		11.10.4  Interior Taps
		11.10.5  Key Chaining
		11.10.6  Chaining Summary
		11.10.7  Chaining Short Blocks
		11.10.8  Chaining Variable-length Blocks
	11.11  Strengthening a Block Cipher
Chapter 12: Principles for secure encryption
	12.1 Large Blocks
	12.2 Long Keys
		12.2.1  Redundant Keys
	12.3 Confusion
		12.3.1  Correlation Coefficient
		12.3.2 Base 26 Linearity
		12.3.3  Base 256 Linearity
		12.3.4  Adding a Backdoor
		12.3.5  Condensed Linearity
		12.3.6  Hybrid Linearity
		12.3.7  Constructing an S-Box
		12.3.8  S-Box with Key
	12.4 Diffusion
	12.5 Saturation
	12.6 Summary
Chapter 13: Stream ciphers
	13.1  Combining Functions
	13.2  Random Numbers
	13.3 Multiplicative Congruential Generator
	13.4  Linear Congruential Generator
	13.5  Chained Exclusive-OR Generator
	13.6  Chained Addition Generator
	13.7  Shift and XOR Generator
	13.8  FRand
	13.9  Mersenne Twister
	13.10  Linear Feedback Shift Registers
	13.11  Estimating the Period
	13.12  Strengthening a Generator
	13.13  Combining Generators
	13.14  True Random Numbers
		13.14.1 Lagged Linear Addition
		13.14.2  Layering Images
	13.15  Refreshing the Random Bytes
	13.16  Synchronized Key Streams
	13.17  Hash Functions
Chapter 14: One-time pad
	14.1  The Vernam Cipher
	14.2  Key Supply
		14.2.1  Circulating Key
		14.2.2  Combined Key
		14.2.3  Selection Key
	14.3  Indicators
	14.4  Diffie-Hellman Key Exchange
		14.4.1   Constructing Large Primes, Old
		14.4.2  Constructing Large Primes, New
Chapter 15: Matrix methods
	15.1  Inverting a Matrix
	15.2  Transposition Matrix
	15.3 The Hill Cipher
	15.4  Hill Cipher, Computer Versions
	15.5  Large Integer Multiplication
		15.5.1  Multiplying and Dividing Congruences
	15.6  Solving a Linear Congruence
		15.6.1  Reducing a Congruence
		15.6.2  Half and Half Rule
		15.6.3  Laddering
		15.6.4  Continued Fractions
	15.7  Large Integer Ciphers
	15.8  Small Integer Multiplication
	15.9  Multiplication Modulo P
	15.10  Change of Base
	15.11  Rings
	15.12  Matrices Over a Ring
	15.13 Constructing a Ring
		15.13.1 Gaussian Integers
		15.13.2 Quaternions
	15.14  Finding an Invertible Matrix
Chapter 16: Three pass protocol
	16.1  Shamir’s Method
	16.2  Massey-Omura
	16.3  Discrete Logarithm
	16.4  Matrix Three Pass Protocol
		16.4.1  Commutative Family of Matrices
		16.4.2  Multiplicative Order
		16.4.3  Maximum Order
		16.4.4  Emily Attacks
		16.4.5  Non-commutative Ring
		16.4.6  Solving Bilinear Equations
		16.4.7  Weaklings
		16.4.8  Making it Fast
	16.5 2-Sided 3-Pass Protocol
Chapter 17: Codes
	17.1  The Joker
Chapter 18: Quantum computers
	18.1 Superposition
	18.2 Entanglement
	18.3 Error Correction
	18.4 Measurement
	18.5 Quantum 3-Stage Protocol
	18.6 Quantum Key Exchange
	18.7 Grover’s Algorithm
	18.8 Equations
	18.9  Minimization
	18.10 Quantum Simulated Annealing
	18.11 Quantum Factoring
	18.12 Ultracomputers
Chapter 19: Epilogue
Chapter 20: Fun pages