Vocabulary flashcards covering core cryptography concepts, PKI infrastructure, hash properties, key pairs, certificates, and distinction pairs for OPIM 3207 Unit 5.
90 Terms
1
New cards
Plaintext
The original readable data before encryption.
2
New cards
Ciphertext
The unreadable output produced when plaintext is encrypted.
3
New cards
Cipher
An algorithm used to encrypt or decrypt data using a key.
4
New cards
Key
A value used by a cryptographic algorithm to control encryption, decryption, signing, or other cryptographic operations.
5
New cards
Public Key
The shareable half of an asymmetric key pair. It can encrypt data for the private-key owner or verify signatures made with the matching private key.
6
New cards
Private Key
The secret half of an asymmetric key pair. It can decrypt data encrypted with the matching public key or create digital signatures.
7
New cards
Strong Cryptographic Key
A strong key has sufficient length, high randomness, and an appropriate cryptoperiod.
8
New cards
Key Length
The size of a cryptographic key. Longer keys generally make brute-force attacks harder when the key is also unpredictable.
9
New cards
Key Randomness
How unpredictable a cryptographic key is. A long but predictable key can still be weak.
10
New cards
Cryptoperiod
The amount of time a cryptographic key should remain in use before being replaced.
11
New cards
Trapdoor Function
A mathematical function that is easy to perform in one direction but extremely difficult to reverse without special information.
12
New cards
Hash
A one-way function that produces a fixed-length digest and is commonly used for integrity checking and password verification.
13
New cards
Hash Digest (Message Digest)
The fixed-length output produced by a hash function. The same input produces the same digest, while even a small input change should produce a very different result.
14
New cards
Collision
A situation where two different inputs produce the same hash digest.
15
New cards
Collision Resistance
The property that makes it computationally impractical to find two different inputs that produce the same hash digest.
16
New cards
MD5 (Message-Digest Algorithm 5)
A 128-bit hash algorithm that is cryptographically broken and should not be trusted for modern cryptographic security.
17
New cards
SHA-1 (Secure Hash Algorithm 1)
A 160-bit hash algorithm that is no longer approved for modern cryptographic use.
18
New cards
SHA-2 (Secure Hash Algorithm 2)
A widely used hash family that includes SHA-256 and SHA-512.
19
New cards
SHA-3 (Secure Hash Algorithm 3)
A newer hash family with a different internal design from SHA-2.
20
New cards
Hash input variation
A small change to the input produces a very different digest while the output length remains fixed. SHA-1, for example, always produces a 160-bit digest.
21
New cards
Hashing vs. Encryption
Hashing is designed to be one-way and supports integrity or password verification. Encryption is reversible with a key and protects confidentiality.
22
New cards
Can a hash normally be decrypted?
No. A hash is designed to be one-way. An attacker instead guesses an input, hashes it, and compares the resulting digest.
23
New cards
Salt
A unique random value added to a password before hashing and stored with the resulting hash. It causes identical passwords to produce different stored hashes.
24
New cards
Pepper
A secret value added before password hashing but stored separately from the password database.
25
New cards
Salt vs. Pepper
A salt is unique random data stored with the hash. A pepper is secret and stored separately from the database.
26
New cards
Rainbow Table
A precomputed collection of password hashes used to quickly match hashes to likely passwords.
27
New cards
How does a salt help against rainbow tables?
A unique salt changes the hash calculation for each password, making precomputed hash tables far less useful.
28
New cards
Dictionary Attack
A password attack that hashes likely passwords or dictionary words and compares them with a stolen password hash.
29
New cards
Why can a weak password still be cracked if it is hashed?
An attacker can guess likely passwords, hash each guess, and compare the results with the stored hash.
30
New cards
Slow Password-Hashing Function
A password-specific hashing method intentionally designed to make each password guess computationally expensive.
31
New cards
Why use a slow password-hashing function?
Slowing each hash calculation increases the cost of large-scale password guessing attacks.
32
New cards
Symmetric Encryption
Encryption that uses the same shared secret key for encryption and decryption.
33
New cards
Asymmetric Encryption
Cryptography that uses a mathematically related public key and private key.
34
New cards
Symmetric vs. Asymmetric Encryption
Symmetric encryption uses one shared secret and is fast for bulk data. Asymmetric cryptography uses a public/private key pair and is useful for trust, signatures, and key establishment.
35
New cards
AES (Advanced Encryption Standard)
A widely used symmetric block cipher that operates on 128-bit blocks and is efficient for encrypting large amounts of data.
36
New cards
RSA (Rivest-Shamir-Adleman)
An asymmetric cryptographic system based on the difficulty of factoring large numbers. It can support encryption and digital signatures.
37
New cards
ECC (Elliptic-Curve Cryptography)
Asymmetric cryptography based on elliptic curves that can provide strong security with smaller keys than many traditional asymmetric systems.
38
New cards
Diffie-Hellman Key Exchange
A key-agreement method that allows two parties to derive a shared secret over an untrusted network without directly transmitting that secret.
39
New cards
Hybrid Encryption
Uses asymmetric cryptography or key agreement to establish secret key material, then uses faster symmetric encryption such as AES for the bulk data.
40
New cards
What should establish a session and then encrypt large amounts of data?
Use asymmetric cryptography or Diffie-Hellman to establish shared secret material, then use symmetric encryption such as AES for the bulk data.
41
New cards
Why use AES after asymmetric key establishment?
Symmetric encryption such as AES is much faster and more efficient for encrypting large amounts of data.
42
New cards
Block Cipher
A cipher that encrypts data in fixed-size blocks.
43
New cards
Stream Cipher
A cipher that processes data one symbol or small unit at a time rather than in fixed-size blocks.
44
New cards
Block Cipher vs. Stream Cipher
A block cipher encrypts fixed-size blocks of data. A stream cipher processes data continuously one unit at a time.
45
New cards
ECB (Electronic Codebook)
A block cipher mode that encrypts each block independently. Identical plaintext blocks produce identical ciphertext blocks, so patterns can remain visible.
46
New cards
CBC (Cipher Block Chaining)
A block cipher mode that chains each plaintext block to the previous ciphertext block and uses an initialization vector for the first block.
47
New cards
CTR (Counter Mode)
A block cipher mode that combines a nonce with a changing counter and supports parallel processing.
48
New cards
GCM (Galois/Counter Mode)
A block cipher mode that provides encryption for confidentiality plus authentication for integrity.
49
New cards
IV (Initialization Vector)
A value used to initialize certain encryption modes so identical plaintext does not repeatedly produce the same ciphertext pattern.
50
New cards
Nonce (Number Used Once)
A value intended to be unique for a cryptographic operation, commonly used with modes such as CTR and GCM.
51
New cards
IV vs. Nonce
Both help prevent repeated encryption patterns, but their exact requirements depend on the encryption mode. CTR and GCM require unique nonces.
52
New cards
ECB vs. CBC
ECB encrypts blocks independently and leaks repeated patterns. CBC chains blocks together and uses an IV to hide those patterns.
53
New cards
CBC vs. CTR
CBC chains blocks sequentially. CTR uses a nonce and counter and can be processed in parallel.
54
New cards
Which block cipher mode leaks repeated patterns?
ECB, because identical plaintext blocks produce identical ciphertext blocks.
55
New cards
Which block cipher mode chains blocks together?
CBC.
56
New cards
Which block cipher mode uses a nonce and counter and can parallelize?
CTR.
57
New cards
Which block cipher mode provides authenticated encryption?
GCM.
58
New cards
Digital Signature
A cryptographic signature created using a private key that allows others to verify authenticity, integrity, and nonrepudiation using the matching public key.
59
New cards
Nonrepudiation
Provides evidence linking an action or digital signature to its origin so the sender cannot easily deny performing it.
60
New cards
Encryption vs. Digital Signature
Encryption primarily protects confidentiality for the recipient. A digital signature provides authenticity, integrity, and nonrepudiation for the sender.
61
New cards
Public-Key Encryption Flow
Encrypt with the recipient's public key → decrypt with the recipient's private key.
62
New cards
Digital Signature Flow
Sign with the sender's private key → verify with the sender's public key.
63
New cards
Sign-then-Encrypt Flow
Alice signs the message using her private key, then encrypts the message and signature using Bob's public key. Bob decrypts with his private key, then verifies Alice's signature using Alice's public key.
64
New cards
What does signing provide?
Authenticity, integrity, and nonrepudiation. Signing does not by itself provide confidentiality.
65
New cards
What does encryption provide?
Confidentiality by preventing unauthorized parties from reading the protected data.
66
New cards
PKI (Public Key Infrastructure)
The system of certificates, certificate authorities, trust anchors, policies, and processes used to establish trust in public keys.
67
New cards
Certificate
A digitally signed record that binds an identity, such as a website or organization, to a public key. Certificates commonly use the X.509 format.
68
New cards
CA (Certificate Authority)
A trusted organization or system that issues and signs digital certificates.
69
New cards
CSR (Certificate Signing Request)
A request sent to a CA containing identity information and a public key so a certificate can be issued.
70
New cards
RA (Registration Authority)
An optional PKI role that verifies an applicant's identity or information before a CA issues a certificate.
71
New cards
Root CA (Root Certificate Authority)
A top-level CA whose certificate acts as a trusted starting point, or trust anchor, for certificate validation.
72
New cards
Intermediate CA (Intermediate Certificate Authority)
A CA trusted by a higher-level CA and authorized to issue certificates below it in the certificate chain.
73
New cards
Leaf Certificate
An end-entity certificate belonging to a website, user, device, or service rather than another issuing CA.
74
New cards
Trust Store
A collection of trusted CA certificates maintained by an operating system, browser, or application.
75
New cards
Trust Anchor
A root certificate or public key that is already trusted and serves as the starting point for certificate-chain validation.
76
New cards
Certificate Chain
The path from a leaf certificate through one or more intermediate CAs to a trusted root CA.
77
New cards
PKI chain of trust
Leaf certificate → Intermediate CA → Root CA.
78
New cards
Why does a browser trust a website certificate?
The website certificate chains through a trusted intermediate CA to a root CA already accepted by the browser or operating system.
79
New cards
Self-Signed Certificate
A certificate signed using its own private key instead of a trusted external CA.
80
New cards
Why does a self-signed certificate cause a browser warning?
The browser cannot build the normal chain of trust from the certificate to a trusted root CA.
81
New cards
Certificate Revocation
The process of invalidating a certificate before its normal expiration date, often because its private key was compromised.
82
New cards
CRL (Certificate Revocation List)
A signed list published by a CA containing the serial numbers of certificates that have been revoked.
83
New cards
OCSP (Online Certificate Status Protocol)
A protocol used to request the current status of a certificate, such as good, revoked, or unknown.
84
New cards
RSA modulus calculation
In simplified RSA, multiply the two prime numbers: N = p × q.
85
New cards
RSA phi calculation
For two prime numbers p and q, phi(N) = (p - 1)(q - 1).
86
New cards
RSA public key notation
A simplified RSA public key is represented as (N, e).
87
New cards
RSA private key notation
A simplified RSA private key is represented as (N, d).
88
New cards
If RSA uses p = 7 and q = 13, what is N?
N = 7 × 13 = 91.
89
New cards
If RSA uses p = 7 and q = 13, what is phi(N)?
phi(N) = (7 - 1)(13 - 1) = 6 × 12 = 72.
90
New cards
Why is RSA difficult to reverse?
Multiplying large prime numbers is easy, but factoring a sufficiently large product back into its original primes is computationally difficult.