Cryptography
- •
Definition
- •
the field concerned with securing information; commonly associated with encryption, but it has two sides
- •
- •
Two sides
- •
Hashing — a one-way process, used to protect integrity
- •
Encryption — a two-way (reversible) process, used to protect confidentiality
- •
- •
Related
- •
In this collection 177
- Additive Group Diffie-Hellman Break (Trivial Discrete Log in Additive Groups)
- AES
- AES CBC Bit-Flipping
- AES-GCM Forbidden Attack (Nonce Reuse Tag Forgery)
- AES-IGE Padding Oracle Attack (CBC-Equivalence)
- Algebraic Attack via Boolean Polynomial Ring (Gröbner Basis Key Recovery)
- Annihilator Attack on Filtered LFSRs (Quadratic Linearization)
- ASCII
- Asymmetric Encryption
- Attack Game
- Baby-Step Giant-Step Algorithm
- Base64
- Batch GCD Attack (Shared RSA Prime Across Keys)
- Berlekamp-Massey Algorithm
- Birthday Attack
- Bit-Guessing Game
- Block Cipher Mode of Operation
- Boneh-Durfee Attack (Lattice Attack on Small RSA Private Exponent)
- Boolean Functions and Algebraic Normal Form (ANF)
- Byte-Integer Encoding (bytes_to_long - long_to_bytes)
- Cayley-Hamilton Reduction of Matrix Exponentiation to Polynomial Coefficients
- CBC Decryption via ECB Oracle
- CBC IV=Key Recovery Attack
- CBC Padding Oracle Attack (Vaudenay)
- Certificate Authority
- Certificate Revocation List (CRL)
- Certificate Signing Request (CSR)
- Certificate Transparency & SPKI Fingerprinting
- Chain of Trust
- Chinese Remainder Theorem
- Code Signing
- Collision (Hashing)
- Complex Multiplication (CM) Prime Factorization Backdoor
- Composite-Modulus Key Exchange Break (CRT Projection Attack)
- Computational Cipher
- Conic-Non-Elliptic Curve DLP Reduction (Fake ECC)
- Coppersmith's Method for Stereotyped-Partially-Known Messages
- Correlation Attack on Filtered LFSRs (Belief Propagation)
- CRIME Attack (Compression Oracle Side-Channel)
- Database Encryption
- DES-3DES Weak Keys
- Diffie-Hellman (Textbook Construction)
- Diffie-Hellman Downgrade Attack (Export-Grade - Weak Group Negotiation)
- Diffie-Hellman Exchange
- Diffie-Hellman Parameter-Public-Value Injection (MITM)
- Digital Certificate
- Digital Signature
- Discrete Log Reduction via Chosen Composite Modulus n=q² (Paillier's Trick)
- Discrete Log Signature Forgery via Smooth-Order Modulus Lifting (n=p², Pohlig-Hellman + Hensel Lift)
- Discrete Logarithm Problem (DLP)
- Domain Keys Identified Mail (DKIM)
- Downgrade Attack
- Dual EC-Style PRNG Backdoor (Chosen Related Points)
- Duplicate Signature Key Selection (DSKS) Attack
- ECB Byte-at-a-Time Decryption Attack
- ecb-cbc-wtf
- ECDH (Elliptic Curve Diffie-Hellman) — Textbook Construction
- ElGamal (Subgroup and Quadratic-Residue Leakage)
- Elliptic Curves (Group Law Basics)
- Encryption
- End-To-End Encryption (E2Ee)
- Exponent Recovery via Repeated Eigenvalue (Logarithmic Derivative Trick)
- Extended Euclidean Algorithm
- FactorDB (Pragmatic Factorization Lookup)
- Factoring Products of Mersenne-Form Numbers (2^a-1)(2^b-1)
- Fermat's Factorization Method (Close Primes)
- Fermat's Little Theorem
- File Encryption
- Finite Fields (Galois Fields: GF(p) and GF(2^n))
- Fooling Fixed-Basis Miller-Rabin (Arnault Strong Pseudoprimes)
- Franklin-Reiter Related Message Attack
- Full-Disk Encryption
- Geffe Generator (Nonlinear LFSR Combination via Multiplexer)
- Groups (Group Theory Basics)
- Hardware Security Module (HSM)
- Hash Digest
- Hashing
- Hashing Algorithms
- Hastad's Broadcast Attack
- Hexadecimal
- Hidden Subset Sum - Knapsack Recovery via Lattice Reduction (LLL)
- In-band Key Exchange
- Integer Factorization via ECM - Sage's factor()
- Invertible Permutation via Missing Feed-Forward (ARX Stream Ciphers)
- Key Exchange
- Key Length
- Key Management
- Key Stretching
- Known-Plaintext Keystream Recovery (Many-Time Pad)
- Known-Plaintext XOR Key Recovery (Crib Dragging)
- Legendre Symbol
- Levels of Encryption
- LFSR State via Companion Matrix (Time-Reversal)
- Linear Congruential Generator (State and Parameter Recovery)
- Linear S-Box Cryptanalysis (Affine Cipher Break)
- LLL Algorithm (Lattice Basis Reduction)
- Low-Exponent Cube-Root Attack (Unpadded RSA)
- Many-Time Pad (Multi-Message Keystream Reuse)
- Matrix Discrete Log via Characteristic Polynomial Factorization (Extension Fields + CRT)
- Matrix Groups & Textbook-RSA-Style Attacks over Matrices
- MD5
- Message Recovery Attack
- Miller-Rabin Primality Test
- Modular Binomial Equation Attack
- Negligible Function
- Noisy Padding Oracle Attack (Statistical Amplification)
- Non-repudiation
- OCSP Stapling
- OFB Mode Encryption-Decryption Symmetry
- One-Time Pad
- Onion Routing
- Online Certificate Status Protocol (OCSP)
- Out-of-band Key Exchange
- Partial-Match RSA Verification Exploit (Suffix Forgery via Small Modulus)
- Partition Encryption
- Password Hashing
- PEM & DER (ASN.1 Encoding)
- Perfect Security
- Plaintext Recovery via Rejection-Sampling Oracle (Process of Elimination)
- Pohlig-Hellman Algorithm
- Point Compression (Elliptic Curve X-Coordinate + Parity Bit)
- Private Certificate Authority
- Private Key
- Public Key
- Public Key Infrastructure (PKI)
- Quadratic Residue
- RC4
- RC4 Weak-IV Key Recovery (FMS Attack)
- Record Encryption
- Recovering an Unknown Modulus via GCD (Successive Powers)
- Recursive RSA-Style Factorization via Known φ(N) (Multi-Prime Moduli)
- ROCA Vulnerability (Infineon RSA Key Generation Weakness)
- Root of Trust
- Roots of Unity mod N (Non-Trivial Roots Reveal Factors)
- ROT13
- Rotor Machine
- RSA (Textbook Construction)
- RSA Blinding Attack (Signature Malleability)
- RSA Factorization from Known (N, e, d)
- RSA Fixed-Point Leakage (Unconcealed Messages) → Factorization
- RSA Padding Schemes (PKCS-1 v1.5 vs OAEP vs Unpadded)
- RSA Sign = Decrypt When Keys Are Shared (Unrestricted Signing Oracle)
- RSA with Non-Coprime Exponent (e Shares a Factor with φ(N))
- RSA with p = q (Repeated Prime Factor)
- Salting
- Secure Enclave
- Secure Protocol
- Security Reduction
- Self-Signed Certificate
- Semantic Security
- Sequential Confidence Amplification for Noisy Binary Oracles (SPRT-style)
- Session Key
- SHA-256
- SHA-512
- Shannon Cipher
- Shannon's Theorem
- Small-Subgroup - Smooth-Prime Static-Key Extraction Attack (Diffie-Hellman)
- Smooth Numbers & Constructing Smooth Primes
- SSH Public-Private Key Format
- Static-Key Generator Substitution Attack (Diffie-Hellman)
- Stream Cipher
- Subject Alternative Name (SAN)
- Substitution Cipher
- Symmetric Encryption
- Third-Party Certificate Authority
- Time-Seeded Encryption Key Weakness (Coarse Timestamp-Derived Keys)
- Timing Side-Channel Attack (Computational Cost as an Oracle)
- Tonelli-Shanks Algorithm
- Transport Encryption
- Trusted Platform Module (TPM)
- Two-Time Pad (XOR Key Reuse)
- Volume Encryption
- Wiener's Attack (Continued Fractions, Small Private Exponent)
- Wildcard Certificate
- X.509 Certificate
- XOR-Instead-of-Exponentiation Notation Bug (Diffie-Hellman)
- Zerologon (AES-CFB8 Zero-State Keystream Collision)