Jump to content

User:Lwile/Books/Cryptography 1

From Wikipedia, the free encyclopedia


Cryptography 1

[edit]

Stanford University

[edit]
Week 1
Symmetric-key algorithm
Substitution cipher
Caesar cipher
Vigenère cipher
Rotor machine
Data Encryption Standard
Advanced Encryption Standard
Probability distribution
Event (probability theory)
Random variable
Randomized algorithm
XOR cipher
One-time pad
Information-theoretic security
Stream cipher
Ciphertext
Week 2
Block cipher
Pseudorandom function family
Pseudorandom number generator
Pseudorandom generator
Pseudorandom permutation
Malleability (cryptography)
Key-recovery attack
Brute-force attack
Boomerang attack
Differential cryptanalysis
RC4
Content Scramble System
Linear-feedback shift register
ESTREAM
Salsa20
Entropy (computing)
Advantage (cryptography)
Semantic security
Most significant bit
Least significant bit
Plaintext
Key space (cryptography)
Adversary (cryptography)
Week 3
Information security
Message authentication code
Key (cryptography)
PRF advantage
Computational complexity theory
Chosen-plaintext attack
Chosen-ciphertext attack
Digital signature forgery
CBC-MAC
Hash-based message authentication code
Triple DES
Padding (cryptography)
PMAC (cryptography)
CWC mode
Collision resistance
Cryptographic hash function
Hash function
Birthday attack
Merkle–Damgård construction
One-way compression function
SHA-1
SHA-2
SHACAL
Timing attack
Side-channel attack
Week 4
Ciphertext indistinguishability
Man-in-the-middle attack
Authenticated encryption
Message authentication
Galois/Counter Mode
CCM mode
Block cipher mode of operation
Initialization vector
EAX mode
Cryptographic nonce
OCB mode
Encryption
Transport Layer Security
Cryptography
Padding oracle attack
Length extension attack
Key derivation function
HKDF
PBKDF2
Salt (cryptography)
Perfect hash function
Deterministic encryption
Key Wrap
Disk encryption theory
Format-preserving encryption
Feistel cipher
Week 5
Trusted third party
Replay attack
Public-key cryptography
Merkle tree
Merkle–Hellman knapsack cryptosystem
Diffie–Hellman key exchange
RSA (cryptosystem)
ID-based encryption
ID-based cryptography
Functional encryption
Prime number
General number field sieve
Elliptic curve cryptography
Number theory
Modulo operation
Modular arithmetic
Multiplicative order
Multiplicative group of integers modulo n
Mod n cryptanalysis
Greatest common divisor
Euclidean algorithm
Fermat's little theorem
Cyclic group
Generating set of a group
Euler's totient function
Lagrange's theorem (number theory)
Modular exponentiation
Quadratic residue
Euler's theorem
Carmichael function
Exponentiation by squaring
Discrete logarithm
Week 6
Trapdoor function
RSA problem
PKCS
Optimal asymmetric encryption padding
PKCS 1
One-way function
Wiener's attack
ElGamal encryption
Differential fault analysis
OpenSSL
ElGamal signature scheme
Computational Diffie–Hellman assumption
Decisional Diffie–Hellman assumption
Diffie–Hellman problem
Cryptographic protocol