1/56
Looks like no tags are added yet.
Symmetric Cipher
A cipher system where communicating parties must share a single secret key to encrypt and recover exchanged messages.
Block Cipher
A cryptographic cipher that transforms fixed-size blocks of plaintext into ciphertext using a secret key, requiring a one-to-one mapping for fixed keys to ensure unambiguous decryption.
Diffusion
A cryptographic design goal where changing a single plaintext bit influences many ciphertext bits, spreading the statistical structure of plaintext across the ciphertext.
Confusion
A cryptographic design goal that obscures the relationship between the key and the ciphertext to make cryptanalysis difficult.
Kerckhoffs’s Principle
The design principle stating that a cryptographic system should remain secure even if its algorithm is made public, provided the key remains secret.
Permutation
A cryptographic transformation that reorders the positions of input elements without altering their underlying values.
Substitution
A cryptographic transformation that systematically replaces input elements with other values.
Feistel Cipher
A symmetric block cipher structure that splits data into two halves and supports decryption using the identical round structure by applying round subkeys in reverse order, without requiring the round function itself to be invertible.
Data Encryption Standard (DES)
A Feistel-based block cipher that processes 64-bit plaintext blocks using a nominal 64-bit key, which yields 56 effective key bits due to 8 bits being used for parity.
DES S-Box
A substitution box in DES that provides nonlinear substitution by mapping a 6-bit input to a 4-bit output.
Timing Side-Channel Attack
A cryptanalytic attack where an adversary measures differences in execution and decryption runtimes across various inputs to infer secret cryptographic information.
Meet-in-the-Middle Attack
A cryptanalytic attack that matches intermediate encryption and decryption states, which prevents Double DES from providing the expected doubling of effective security strength.
Triple DES (3DES)
A cipher construction that repeatedly applies DES operations using an Encrypt-Decrypt-Encrypt sequence to enhance protection over single DES.
Abelian Group
A mathematical group whose binary operation satisfies commutativity in addition to standard group properties.
Cyclic Group
A group in which every element can be generated by repeatedly applying the group operation to a single generator element.
Field
An algebraic structure with addition, subtraction, multiplication, and division operations, in which every nonzero element possesses a unique multiplicative inverse.
Finite Field Order
The total number of elements contained within a finite field, which must be a prime or prime power.
GF(2) Arithmetic
Arithmetic over the Galois Field of two elements, where addition and subtraction are identical operations equivalent to bitwise XOR, resulting in 1+1=0.
Irreducible Polynomial
A polynomial over GF(2) that cannot be factored into lower-degree polynomials, utilized to define multiplication modulo that polynomial in GF(2n).
Advanced Encryption Standard (AES)
A non-Feistel symmetric block cipher operating on a fixed 128-bit block size represented as a 4×4 array of bytes, supporting key lengths of 128, 192, and 256 bits.
SubBytes
An AES round transformation that applies an S-box nonlinear substitution independently to each byte of the state to provide confusion.
ShiftRows
An AES transformation that cyclically shifts the bytes within each row of the state array by specific offsets to support diffusion.
MixColumns
An AES transformation that mixes the four bytes within each column of the state matrix using modular polynomial arithmetic, which is omitted in the final encryption round.
AddRoundKey
The AES operation that combines the current state array with a derived round key using bitwise XOR, performed at the start and in each round.
Key Whitening
The technique of XORing data with additional secret key material prior to the first round and/or after the final round of a cipher, as seen in DES-X.
Electronic Codebook (ECB)
A block cipher operating mode that encrypts each plaintext block independently under the same key, revealing patterns because identical plaintext blocks produce identical ciphertext blocks.
Cipher Block Chaining (CBC)
A block cipher mode where each plaintext block is XORed with the previous ciphertext block (or an unpredictable initialization vector for the first block) before encryption.
Initialization Vector (IV)
A non-secret data block used to randomize the initial stage of modes like CBC, which must be unpredictable when the associated plaintext is selected.
Cipher Feedback (CFB)
A mode of operation that feeds ciphertext segments back into a shift register, utilizing the block cipher's encryption primitive during both encryption and decryption.
Output Feedback (OFB)
A stream-like mode where the block cipher's output is fed back to produce a keystream independently of plaintext, causing a single transmitted ciphertext bit flip to flip only the corresponding recovered plaintext bit.
Counter Mode (CTR)
A mode that produces keystream blocks by encrypting a key, nonce, and incrementing counter block, enabling parallel block processing, random access, and plaintext-independent precomputation without using the block cipher decryption primitive.
Entropy
A mathematical measure of uncertainty or randomness in a probability distribution, which is maximized across a fixed set of outcomes by a uniform distribution.
Monobit Frequency Test
A statistical randomness test that checks whether the proportions of ones and zeros in a bit sequence are approximately equal.
RC4
A stream cipher that uses an evolving internal state built around a 256-byte permutation array S.
ChaCha20
A stream cipher that utilizes a 256-bit key, a 96-bit nonce, and a 32-bit counter, built around basic operations of addition, rotation, and XOR (ARX).
Cryptographic Hash Function
A deterministic mathematical algorithm that maps arbitrary variable-length input data to a fixed-size digest while providing preimage resistance, second-preimage resistance, and collision resistance.
Preimage Resistance
The hash property establishing that given a target digest h, it is computationally infeasible to find any input m such that H(m)=h.
Second-Preimage Resistance
The hash property establishing that given a specific input m1, it is computationally infeasible to find a distinct input m2=m1 such that H(m1)=H(m2).
Collision Resistance
The hash property establishing that it is computationally infeasible to locate any two distinct messages m1=m2 such that H(m1)=H(m2).
Fuzzy Hashing
A non-cryptographic hashing technique designed to identify files that are similar despite minor edits or changes, commonly used in malware analysis.
Davies-Meyer
A hash compression construction that feeds a chaining value into a block cipher and XORs the resulting cipher output with that input chaining value.
SHA-512
A cryptographic hash function operating on 1024-bit message blocks to generate a fixed 512-bit digest, maintained internally as an array of eight 64-bit words.
Sponge Construction
A cryptographic hash framework used in SHA-3 consisting of an absorbing phase where padded message blocks are absorbed into a state divided into rate and capacity, followed by a squeezing phase where output bits are extracted.
Relatively Prime (Coprime)
A mathematical relationship between two positive integers indicating that their greatest common divisor is one (gcd(a,b)=1).
Fundamental Theorem of Arithmetic
The theorem establishing that every positive integer greater than one can be uniquely factored into a product of prime numbers, up to the order of factors.
Euler's Totient Function (ϕ(n))
An arithmetic function that counts the number of positive integers up to n that are relatively prime to n.
Public-Key Encryption
An asymmetric cryptographic scheme where the sender encrypts a message with the recipient's public key, allowing only the recipient to decrypt using their matching private key.
RSA Algorithm
A public-key cryptosystem where the public modulus is n=p×q (the product of two primes), the public exponent e satisfies gcd(e,ϕ(n))=1, and the secret private exponent d satisfies d×emodϕ(n)=1.
Diffie-Hellman Key Exchange
A cryptographic protocol enabling two parties to establish a shared secret over an insecure channel by exchanging public values derived from a shared base and modular exponentiation.
Discrete Logarithm Problem
The difficult mathematical problem of determining an unknown exponent x given a base g, modulus p, and the value y=gxmodp.
ElGamal Encryption
A probabilistic public-key encryption scheme based on discrete logarithms in which the sender chooses a fresh random value k per message, yielding a two-component ciphertext.
Traffic Analysis
A passive monitoring technique where an observer inspects patterns, timing, volume, and frequency of message transmissions without necessarily decrypting the contents.
Message Authentication Code (MAC)
A short authentication tag generated from a message using a shared secret key, allowing holders of that shared key to verify message integrity and authenticity.
HMAC
A keyed hash construction that utilizes an underlying cryptographic hash function along with two distinct constants, the inner pad (ipad) and outer pad (opad), to authenticate data.
Cipher-Based Message Authentication Code (CMAC)
A block-cipher MAC mode that applies different derived subkeys depending on whether the final message block is complete or padded, mitigating variable-length CBC-MAC weaknesses.
Counter with CBC-MAC (CCM)
An authenticated encryption mode that combines Counter (CTR) mode encryption with CBC-MAC to provide both confidentiality and authenticity, supporting authenticated unencrypted associated data.
Associated Data
Metadata or