What's changed: Initial version
4.1Security Fundamentals, Cryptography, and Authentication (PKI, Digital Signatures)
Building on the CIA triad (confidentiality, integrity, availability) and its complements (authenticity, accountability, non-repudiation), this section covers, at level-3 depth, how key usage differs across symmetric-key, public-key, and hybrid cryptography, the properties of hash functions, digital signatures signed with a private key and verified with a public key, the PKI and certificate authorities (CAs) that guarantee a public key's validity, multi-factor and biometric authentication, and SSL/TLS for securing web communications.
In AP-level questions on cryptography, the differentiator is precisely stating which direction a key is used in. Depending on who encrypts with which key and who decrypts with which key, public-key cryptography can deliver either confidentiality or authenticity. This section first organizes the CIA evaluation axis, then dives into how the differing mathematical properties of symmetric-key cryptography, public-key cryptography, and hash functions translate into practical usage.
4.1.1CIA and complementary properties
- Confidentiality means only authorized parties can access information; integrity means information stays accurate, free of unauthorized tampering; availability means it can be used whenever needed. Complementary properties include authenticity (assurance that a party genuinely is who it claims), accountability (tracing who did what), non-repudiation (preventing later denial of an action), and reliability (consistent intended behavior).
- Which CIA element is affected depends on the situation, even for similar incidents (e.g., a leaked customer list = confidentiality; a defaced website = integrity; a DoS-caused outage = availability). A digital signature is an application of encryption yet delivers authenticity, integrity, and non-repudiation rather than confidentiality — a key reason to avoid equating "encryption" with "confidentiality."
4.1.2Symmetric-key, public-key, and hybrid cryptography
- In symmetric-key cryptography, encryption and decryption use the same key (e.g. AES). It is fast, but sharing a key securely with each partner is the key distribution problem (n people communicating pairwise need n(n-1)/2 keys). In public-key cryptography, a paired public key and private key are used (e.g. RSA). For confidentiality, the direction is "sender encrypts with the recipient's public key -> recipient decrypts with their own private key," which solves key distribution but is much slower than symmetric-key cryptography.
- Public-key cryptography also has an opposite usage: if the sender encrypts (signs) with their own private key, the fact that the corresponding public key can decrypt it proves only that private key's holder could have produced it, delivering authenticity and non-repudiation — the principle behind digital signatures. Not confusing the two directions is critical: "public key encrypts, private key decrypts" = confidentiality; "private key encrypts (signs), public key verifies" = authenticity.
- Hybrid cryptography is the mainstream approach: the bulk data is encrypted with fast symmetric-key cryptography, while only the symmetric (session) key is encrypted with the recipient's public key for transport, gaining both the key-distribution benefit and the speed of symmetric-key cryptography. SSL/TLS key exchange is based on this scheme.
4.1.3Hash functions, digital signatures, PKI, and multi-factor authentication
- A hash function produces a fixed-length hash from input of any length, as a one-way function. Recovering the original data from the hash is computationally infeasible (irreversible), and the same input always yields the same hash. Security requires a low probability of a collision (different inputs producing the same hash). Used for tamper detection by comparing data against its hash.
- A digital signature is the hash of the sent data, encrypted with the sender's private key. The recipient decrypts the signature with the sender's public key to obtain a hash, and compares it against a hash it computes itself from the received data; a match verifies both authenticity (created by the claimed sender) and integrity (untampered) at once. Do not reverse the direction: signing uses the private key; verification uses the public key.
- The PKI (public-key infrastructure) is the overall system guaranteeing that a public key genuinely belongs to its claimed owner. A certificate authority (CA) is a trusted third party that verifies identity and issues a digital certificate binding a public key to its owner. A public key alone cannot prove its true owner, so a CA-signed certificate is what guarantees authenticity. SSL/TLS verifies the server's authenticity via a server certificate, then exchanges a session key using hybrid cryptography.
- Multi-factor authentication (MFA) combines two or more different types from knowledge factors (passwords), possession factors (IC cards, smartphones), and biometric factors (fingerprint, iris). Biometric authentication involves a tradeoff between the false rejection rate (FRR) and false acceptance rate (FAR) (a stricter threshold lowers FAR but raises FRR). In challenge-response authentication, the server sends a different challenge each time, and the client returns only a computed response combining it with the password, so the password itself never crosses the wire, defeating eavesdropping and replay attacks.
The staples: distinguishing "public key encrypts, private key decrypts" (confidentiality) from "private key encrypts (signs), public key verifies" (authenticity). Also frequent: hash functions are irreversible and collision-resistant; symmetric-key is fast but has the key-distribution problem, public-key solves it but is slow, so hybrid cryptography combines both; a CA guarantees a public key's validity (PKI); MFA requires combining different factor types; and computing the number of symmetric keys needed (n(n-1)/2).
Let us confirm two calculation/judgment patterns that appear frequently on the AP morning exam. (1) Number of distributed keys: if 10 people communicate pairwise using symmetric-key cryptography alone, each pair needs a dedicated key, so 10x9/2 = 45 keys are required. With public-key cryptography, each person needs only one public/private key pair (just 10 public keys to distribute) — the calculation itself confirms how key distribution is solved. (2) The digital-signature verification process: sending a contract, the sender first computes a hash of the contract, encrypts it with their own private key to form a signature, and attaches it to the contract. The recipient recomputes a hash from the received contract while separately decrypting the attached signature with the sender's public key to recover the original hash, then compares the two. A match proves both "not tampered with (integrity)" and "created by the private key's actual holder (authenticity/non-repudiation)" simultaneously. Note that if the sender had instead encrypted with a public key, the corresponding private key would belong to the recipient, so it would prove nothing about who sent it. This verification also presupposes a guarantee that the public key really belongs to the claimed sender — provided by a digital certificate issued by a certificate authority (CA). The certificate itself is signed with the CA's private key, and a verifier checks the certificate's authenticity using the CA's public key (typically pre-installed as a trusted root certificate in the OS/browser) — this chain of trust is the essence of PKI.
| Scheme / purpose | How keys are used | Property achieved |
|---|---|---|
| Public-key (confidentiality) | Encrypt with recipient's public key -> decrypt with recipient's private key | Confidentiality |
| Digital signature (authenticity) | Encrypt/sign with sender's private key -> verify with sender's public key | Authenticity, integrity, non-repudiation |
| Symmetric-key | Same key for encryption and decryption | Fast, but has the key-distribution problem |
Trap: "A digital signature is created by encrypting with the sender's public key" is wrong. Signing uses the sender's private key; verification uses the sender's public key — both the actor and direction are the reverse of confidentiality-purpose encryption (which encrypts with the recipient's public key). Also, "a hash function lets you recover the original data from the hash" is wrong — hash functions are irreversible (one-way functions). And "public-key cryptography is more secure than symmetric-key, so you should always use only public-key cryptography" is imprecise — because of the speed difference, hybrid cryptography is the practical standard.
4.1.4Section summary
- CIA = confidentiality, integrity, availability. Complements: authenticity, accountability, non-repudiation, reliability
- "Public key encrypts -> private key decrypts" = confidentiality; "private key encrypts (signs) -> public key verifies" = authenticity. Never reverse the direction
- Symmetric-key = fast but n(n-1)/2 keys needed; public-key = solves distribution but slow. Practice uses hybrid cryptography. CA/PKI guarantees a public key's validity
Sign in to track progress — Log in.
Quick check
(just a quick review)Q1. If 10 people communicate pairwise using only symmetric-key cryptography, with a dedicated key for each pair, how many keys in total are required?
Q2. A message was sent with a digital signature attached. Which is the most appropriate pairing of the key the recipient uses to verify the signature and the property that verification confirms?
Q3. A web service's login was strengthened to require, in addition to a password, authentication using the user's fingerprint. What kind of factor combination does this correspond to?
Keep track of your progress
The full study guide is free to read. Sign up free to practice with the question bank, track what you have read, review your mistakes, and highlight passages.

