Cryptography
Algorithms that protect data and communication.
Cryptographic algorithms help encrypt data, exchange keys, verify integrity, and support secure systems.
RSA
Uses modular arithmetic with a public key and private key for encryption or signatures.
Diffie-Hellman Key Exchange
Lets two parties derive a shared secret over an insecure channel.
AES
Encrypts fixed-size blocks with a symmetric key using repeated substitution and permutation rounds.
SHA-256
Computes a fixed 256-bit cryptographic hash of an input message.
Argon2
Hashes passwords with tunable memory and time cost.
ChaCha20
Encrypts data with a fast stream cipher built from add-rotate-xor rounds.
EdDSA
Creates deterministic elliptic-curve signatures on Edwards curves.
Elliptic Curve Diffie-Hellman
Establishes a shared secret using elliptic-curve key exchange.
Elliptic Curve Digital Signature Algorithm
Creates digital signatures with elliptic-curve keys.
HMAC
Authenticates messages by combining a hash function with a shared secret key.
BLAKE3
Computes a fast cryptographic hash using a tree structure that can run in parallel.
HKDF
Derives strong key material from shared secrets using HMAC-based extract and expand steps.
Shamir's Secret Sharing
Splits a secret into shares so only a threshold number of shares can reconstruct it.
PBKDF2
Derives keys from passwords by iterating a pseudorandom function with a salt.
Scrypt
Derives password keys with intentionally high memory use to resist hardware guessing.
SipHash
Computes a fast keyed hash for short messages and hash-table protection.
Feistel Network
Builds an invertible block cipher structure from repeated round functions.
Merkle-Damgard Construction
Builds a hash function by chaining a compression function over message blocks.
One-Time Pad
Encrypts a message by combining it with a truly random key used exactly once.
Zero-Knowledge Proof
Lets one party prove a statement without revealing the secret that makes it true.
Merkle Tree
Builds a tree of hashes so large datasets can be checked with small proofs.
AES-GCM
AES-GCM encrypts data with a defined symmetric construction.
AES-CTR Mode
AES-CTR Mode encrypts data with a defined symmetric construction.
AES-CBC Mode
AES-CBC Mode encrypts data with a defined symmetric construction.
AES-XTS Mode
AES-XTS Mode encrypts data with a defined symmetric construction.
ChaCha20-Poly1305
ChaCha20-Poly1305 encrypts data with a defined symmetric construction.
CMAC
CMAC protects secrecy, integrity, or authenticity with a named cryptographic primitive.
Poly1305-AES
Poly1305-AES encrypts data with a defined symmetric construction.
Bcrypt
Bcrypt protects secrecy, integrity, or authenticity with a named cryptographic primitive.
PSS Signature Padding
PSS Signature Padding proves message authenticity with public-key verification.
OAEP Padding
OAEP Padding adapts public-key encryption or signatures to safer randomized encodings.
ElGamal Encryption
ElGamal Encryption protects secrecy, integrity, or authenticity with a named cryptographic primitive.
Schnorr Signature
Schnorr Signature proves message authenticity with public-key verification.
Pedersen Commitment
Pedersen Commitment binds a value while hiding it until it is opened.
Commit-Reveal Scheme
Commit-Reveal Scheme binds a value while hiding it until it is opened.
Threshold Signature Scheme
Threshold Signature Scheme proves message authenticity with public-key verification.
BLS Signature
BLS Signature proves message authenticity with public-key verification.
Miller-Rabin Primality Test
Tests whether an integer is probably prime by looking for modular witnesses of compositeness.
Pollard's Rho Factorization
Finds a nontrivial factor by searching for cycles in a pseudorandom modular sequence.
AKS Primality Test
AKS Primality Test addresses deterministic primality testing by checking polynomial congruences that characterize prime numbers.
Fermat Primality Test
Checks probable primality using Fermat's congruence for selected bases.
Montgomery Multiplication
Multiplies numbers modulo n without trial division by working in Montgomery form.
Barrett Reduction
Reduces large integers modulo a fixed n using a precomputed reciprocal approximation.
Modular Exponentiation
Computes large powers modulo an integer without constructing the full power.
HMAC-DRBG
Generates deterministic random bits by updating HMAC-based internal state.
CTR-DRBG
Generates deterministic random bits with a block-cipher counter construction.
Hash-DRBG
Generates deterministic random bits by iterating a cryptographic hash over internal state.
Fortuna PRNG
Fortuna PRNG addresses cryptographic random generation by collecting entropy pools and reseeding a generator conservatively.
Fiat-Shamir Transform
Turns some interactive public-coin proofs into noninteractive proofs by hashing the transcript.
Lamport One-Time Signature
Signs one message by revealing selected one-time secret values for its digest bits.
Merkle Signature Scheme
Merkle Signature Scheme addresses hash-based signatures by authenticating many one-time public keys with a Merkle tree.
DSA
Signs message digests with modular arithmetic over a subgroup and a per-signature nonce.
ElGamal Signature
Signs messages with a discrete-log construction using a fresh random nonce.