You're among CyopScape's first visitors — share your feedback and help us improve.


CyopScape | Professional Development Cert Prep
← Back to Security+ Study Guide
Cert Prep Security+ SY0-701 Domain 1 of 5

D1: General Security Concepts

Security controls, the CIA triad, zero trust, cryptography, PKI, and change management — the foundational vocabulary the rest of the exam builds on

5 modules
1.1 Security Control Categories and Types

Security controls are safeguards or countermeasures that reduce risk. The exam separates them into two dimensions: what they are made of (category) and what they do (type). A single control can belong to one category and multiple types simultaneously.

Control Categories

A category describes how the control is implemented.

Category What it means Examples
Technical (Logical) Implemented through technology and software Firewalls, encryption, MFA, IDS/IPS, access control lists
Managerial (Administrative) Governance, policies, and documented procedures Security policies, risk assessments, background checks, acceptable use policy
Operational People-driven processes and day-to-day practices Security awareness training, guard patrols, incident response drills
Physical Tangible hardware and environmental controls Door locks, fencing, badge readers, security cameras, bollards

Control Types

A type describes the function the control performs in the security lifecycle.

Type What it does Examples
Preventive Stops incidents before they occur Firewall rules, encryption, MFA, locked server room doors
Deterrent Discourages attackers — may not stop them, but raises the perceived cost Warning signs, visible security cameras, login banners ("Authorized users only")
Detective Identifies incidents that have occurred or are in progress IDS alerts, audit logs, SIEM, motion sensors, video surveillance
Corrective Fixes damage or restores normal operations after an incident Patch management, backups, antivirus quarantine, incident response procedures
Compensating Alternative control used when the primary control is not feasible Extra monitoring for a system that cannot be patched; network segmentation around a legacy device
Directive Instructs people to behave in a specific way through policy or legal requirement Acceptable use policy, mandatory security training, "No photography" signs, data classification labels

Mapped Examples

Control Category Type(s)
Firewall Technical Preventive
Security camera Physical Detective, Deterrent
IDS Technical Detective
IPS Technical Preventive
Acceptable use policy Managerial Directive
Security awareness training Operational Preventive, Directive
Backups Operational / Technical Corrective
Login banner Technical Deterrent, Directive
Background checks Managerial Preventive
Network monitoring for unpatched system Technical Compensating
1.2 Fundamental Security Concepts

The CIA Triad

The CIA triad is the foundational model of information security. Every security control maps to one or more of these three properties. When a security decision needs justification, you trace it back here.

Property What it means What breaks it Controls that protect it
Confidentiality Only authorized parties can read or access information Unauthorized disclosure, data theft, eavesdropping Encryption, access controls, MFA, data classification, need-to-know
Integrity Data is accurate and has not been altered without authorization Unauthorized modification, corruption, man-in-the-middle tampering Hashing, digital signatures, checksums, version control, write protection
Availability Systems and data are accessible when needed by authorized users DoS/DDoS, hardware failure, ransomware, natural disaster Redundancy, load balancing, backups, failover, DDoS mitigation, UPS

These properties can work against each other. Maximizing confidentiality (encrypting everything with strict key management) can hurt availability if a user loses their key. Security architecture means balancing all three based on what a particular asset or system needs most.

Non-repudiation

Non-repudiation ensures that a party cannot deny having performed an action. If you send a digitally signed document, the signature is proof it came from you. You cannot credibly claim later that you did not send it, because only you have the private key that produced the signature.

Technical controls that support non-repudiation: digital signatures, audit logs, timestamping, access records. Non-repudiation is closely tied to integrity and authentication — but it adds the legal and evidentiary dimension of proving who did what.

Authentication, Authorization, and Accounting (AAA)

AAA describes the three phases of access control in a system.

Component Question it answers Examples
Authentication Who are you? Username/password, MFA, biometrics, smart cards, certificates, tokens
Authorization What are you allowed to do? RBAC (role-based), DAC (discretionary), MAC (mandatory), ABAC (attribute-based)
Accounting (Auditing) What did you actually do? Audit logs, SIEM events, session recordings, access records

In enterprise networks, AAA is often implemented through RADIUS or TACACS+. RADIUS is widely used for wireless and VPN authentication. TACACS+ is more common for network device administration because it separates authentication, authorization, and accounting into independent sessions, allowing more granular control.

Authentication Factors

Authentication relies on proving identity through one or more of these factor types:

Factor What it is Examples
Something you know Knowledge-based Password, PIN, security question answer, passphrase
Something you have Possession-based Smart card, hardware token (YubiKey), mobile authenticator app, OTP via SMS
Something you are Inherence-based (biometrics) Fingerprint, face recognition, iris scan, voice pattern, retina scan
Somewhere you are Location-based GPS location, IP geolocation, trusted network (used as additional factor)
Something you do Behavioral biometrics Typing cadence, mouse movement patterns, gait analysis

Multi-factor authentication (MFA) requires two or more different factor types. A password plus a security question is two knowledge factors — that is single-factor authentication repeated twice, not MFA. A password plus a hardware token is a password (something you know) plus a physical device (something you have): that is genuine MFA.

Gap Analysis

Gap analysis compares an organization's current security posture against a desired target state: a regulatory requirement, an industry framework like NIST CSF or ISO 27001, or an internally defined baseline. The output is a list of gaps where controls are missing, insufficient, or not aligned to the standard.

Gap analysis answers the question: "Where are we vulnerable relative to where we need to be?" It is a structured way to prioritize security investment rather than reacting to incidents.

Zero Trust Architecture

Zero Trust is an architectural principle: no user, device, or network connection should be trusted by default, regardless of where it is coming from — including inside the corporate network. Every access request is evaluated explicitly based on identity, device health, location, and behavior.

The traditional security model assumed that everything inside the network perimeter was safe and everything outside was hostile. That assumption is broken by remote work, cloud services, and BYOD. Zero Trust replaces "trust the network" with "verify every access."

Three guiding principles:

  • Verify explicitly: Always authenticate and authorize using all available signals (identity, location, device posture, service requested).
  • Use least privilege: Grant access only to what is needed for the specific task, and no more. Just-in-time (JIT) and just-enough-access (JEA) are implementations of this.
  • Assume breach: Design as if an attacker is already inside. Limit blast radius through microsegmentation, encrypt data in transit and at rest, and monitor everything.

Physical Security

Domain 1 requires specific knowledge of physical security controls and what each one does. Physical security is not just about keeping people out — it is about controlling access, detecting unauthorized presence, and reducing the effectiveness of physical attacks.

Control What it does Type(s)
Bollards Short, sturdy posts set into the ground to stop vehicles from ramming buildings or restricted areas. Often seen in front of government buildings or data centers. Preventive
Access control vestibule (mantrap) A small interlocking room with two doors. A person enters through the first, is authenticated, and only then does the second door open. Prevents tailgating. The second door cannot open until the first has closed. Preventive
Fencing Defines a physical perimeter. Deters casual intruders and forces potential attackers to a controlled entry point where they can be observed. Deterrent, Preventive
Video surveillance (CCTV) Monitors areas in real time and records footage for later review. Deters behavior when visible. Provides forensic evidence after an incident. Detective, Deterrent
Security guards Can exercise judgment that cameras cannot: challenge unfamiliar individuals, verify credentials, respond to alarms, and intercept tailgaters. Preventive, Detective, Deterrent
Lighting Reduces shadow cover that attackers rely on for concealment. Improves the effectiveness of surveillance cameras. Deters behavior in visible areas. Deterrent, Detective (supports cameras)
Sensors (motion, IR, contact) Motion sensors, door/window contact sensors, and infrared sensors detect unauthorized presence or movement and trigger alerts or automatic responses (lights, alarms). Detective

Deception and Disruption Technology

Deception technology creates fake assets that look real to an attacker. The key property is that legitimate users have no reason to touch these resources. Any interaction with them is an indicator of compromise.

Technology What it is Primary value
Honeypot A fake system or server with no legitimate users. Designed to look like a valuable target (database server, file share, domain controller). Any interaction with it is suspicious by definition. Early warning; captures attacker TTPs (tools, techniques, procedures)
Honeynet A full fake network of honeypots. Allows researchers or defenders to observe an attacker's behavior across an entire simulated environment — including lateral movement, privilege escalation, and data exfiltration attempts. Threat intelligence; deep behavioral observation
Honeyfile A file with a compelling name placed where an attacker is likely to look ("passwords.xlsx", "Q4-executive-salaries.csv"). Any access triggers an alert. Real users have no reason to open it. Detects insider threats and external attackers who have breached the perimeter
Honeytoken A fake credential, API key, database record, or cloud access key embedded within a real dataset. When it is used in any system, you know your data was accessed by an unauthorized party. Data exfiltration detection; confirms a breach has occurred
1.3 Change Management and Security

Change management is a formal process for controlling modifications to systems, networks, and applications. Its security function is to prevent changes from introducing new vulnerabilities, creating outages, or bypassing existing controls. Poorly managed changes are a common root cause of both security incidents and unplanned downtime.

Business Process Controls

Element Purpose
Approval process Changes require authorization — typically from a Change Advisory Board (CAB) or designated approver — before they are implemented. Prevents unauthorized or impulsive modifications.
Ownership Each system or service has a designated owner accountable for its security posture. Ownership ensures someone is responsible for reviewing and approving changes to that system.
Stakeholders All parties affected by a change are identified and consulted. A firewall rule change may affect network operations, application teams, and compliance — all should review it.
Impact analysis Before a change is approved, its potential effects are evaluated: what could go wrong? Which dependent systems might be affected? What is the worst-case scenario if the change fails mid-deployment?
Test results Changes should be validated in a non-production environment (dev, staging, QA) before deployment. Test results are documented as evidence the change was vetted.
Backout plan A documented procedure to revert the change if it causes problems. Having this plan reduces the pressure to "push through" a failing deployment. Without it, a team may improvise under pressure and make things worse.
Maintenance window Scheduled time slots for changes, usually during low-traffic periods. Minimizes user impact from planned downtime and ensures changes are not rushed.
Standard operating procedure (SOP) Documented step-by-step instructions for performing the change. Reduces human error, ensures repeatability, and provides an audit trail of what was done.

Technical Implications of Change

Changes to systems have downstream security effects that must be planned for.

  • Allow lists and deny lists: A new application or process may need to be explicitly permitted (added to an allow list) or blocked. An application change may require updating which executables or IP ranges are permitted in firewall or endpoint policies.
  • Restricted activities: Certain changes trigger additional security review before they can proceed: installing new software, opening inbound firewall ports, creating administrative accounts, or modifying encryption settings.
  • Downtime: Planned downtime must be communicated and scheduled. Unplanned downtime during a change is a finding that reflects poor change planning.
  • Service and application restarts: Some configuration changes require restarting services. This can cascade to dependent systems and must be accounted for in the impact analysis.
  • Legacy applications: Older systems may not support modern controls (newer TLS versions, MFA integration, current cipher suites). Changes that assume modern capabilities may break or expose legacy components.
  • Dependencies: A change to one system can break another that relies on it. Dependency mapping is part of impact analysis — changes to a core authentication service can cascade to every application that uses it.

Documentation Requirements

  • Updating diagrams: Network diagrams, data flow diagrams, and system architecture diagrams must be updated after changes to reflect the new actual state. Stale diagrams mislead incident responders and auditors.
  • Updating policies and procedures: If a change alters how something is done, the written procedures must be updated. Undocumented changes create institutional knowledge gaps.
  • Version control: Configuration files, scripts, and documentation should be stored in a version control system. Version history provides an auditable record of what changed, when, and who authorized it.
1.4 Cryptographic Solutions

Cryptography is the practice of securing information through mathematical transformations. Domain 1 covers the core building blocks: symmetric and asymmetric encryption, hashing, digital signatures, key exchange, and the controls built on top of them.

Symmetric Encryption

Symmetric encryption uses the same key for both encrypting and decrypting data. Both the sender and receiver must possess the same secret key. This approach is fast and efficient for large data volumes, but it creates a key distribution problem: how do you securely share the key with the other party in the first place?

Algorithm Key length(s) Status Common use cases
AES 128, 192, 256-bit Current standard — widely deployed TLS session encryption, BitLocker, FileVault, WPA2/WPA3, database encryption
3DES (Triple DES) 112 or 168-bit effective Legacy — being phased out Some older financial systems and protocols; deprecated in favor of AES
ChaCha20 256-bit Modern — preferred when AES hardware acceleration is unavailable TLS on mobile devices, WireGuard VPN
RC4 40 to 2048-bit (variable) Deprecated — multiple vulnerabilities known Formerly used in SSL and WEP Wi-Fi — now prohibited

Asymmetric Encryption

Asymmetric encryption uses a mathematically linked key pair: a public key (shared openly) and a private key (kept secret by the owner). Data encrypted with the public key can only be decrypted with the corresponding private key, and vice versa.

This solves the key distribution problem: you can publish your public key to anyone. Only your private key can decrypt messages sent to you. Asymmetric encryption is much slower than symmetric, so it is used primarily for key exchange and digital signatures rather than encrypting large data volumes.

Algorithm Key size Primary use Notes
RSA 2048-bit minimum; 4096-bit preferred Key exchange, digital signatures, certificate signing Most widely deployed asymmetric algorithm. Math based on factoring large prime numbers.
ECC (Elliptic Curve Cryptography) 256-bit is roughly equivalent to RSA 3072-bit Key exchange (ECDH), digital signatures (ECDSA), TLS Smaller keys and faster computation than RSA. Preferred for mobile and performance-constrained environments.
DSA 1024–3072-bit Digital signatures only — cannot encrypt Largely replaced by ECDSA. Still seen in some legacy systems.
Diffie-Hellman (DH) 2048-bit minimum Key exchange (establishing a shared secret) Does not encrypt data. Enables two parties to derive a shared symmetric key over an untrusted channel.

Hybrid Encryption

In practice, symmetric and asymmetric encryption are almost always used together. TLS (the protocol that secures HTTPS) is the most common example:

  1. Asymmetric cryptography (RSA or ECDH) establishes a shared session key during the handshake
  2. That session key drives AES symmetric encryption for the actual data transfer

This gives you the key distribution strength of asymmetric (no need to pre-share a secret) with the performance of symmetric (AES is fast enough for continuous data streams).

Hashing

A hash function takes input of any length and produces a fixed-length output called a digest or checksum. Hash functions are one-way: you cannot reverse the output to recover the original input. They are used to verify data integrity, not to protect confidentiality.

Key properties of a secure hash function:

  • One-way (pre-image resistance): You cannot derive the input from the output
  • Deterministic: The same input always produces the same output
  • Avalanche effect: A tiny change to input produces a completely different output
  • Collision resistance: It should be computationally infeasible to find two different inputs that produce the same hash
Algorithm Output size Status Notes
MD5 128-bit Broken — do not use for security Collision attacks are practical. Acceptable only for non-security checksums (file transfer verification where security is not a concern).
SHA-1 160-bit Deprecated for security use Collision demonstrated. Prohibited in new certificates and signatures. Still seen in legacy systems.
SHA-256 256-bit Current standard Part of the SHA-2 family. Used in TLS certificates, code signing, blockchain (Bitcoin), and password hashing.
SHA-384 / SHA-512 384-bit / 512-bit Current — stronger variant SHA-2 family. Used when higher output length is required (government, high-assurance systems).
SHA-3 Variable (224 to 512-bit) Current — alternative standard Different internal algorithm (Keccak). NIST-standardized alternative in case SHA-2 is ever compromised.

Salting

A salt is a random value added to a password before hashing. Without salting, two users with the same password produce identical hashes. Attackers exploit this with precomputed lookup tables called rainbow tables: large databases mapping common passwords to their hash values.

Adding a unique salt per user makes every hash unique, even if the underlying passwords are identical. Rainbow tables become useless because they would need to be recomputed for every possible salt value. Salts are stored alongside the hash in the database. Their purpose is uniqueness and unpredictability, not secrecy.

Key Stretching

Key stretching takes a short or potentially weak password and makes it much harder to brute-force by deliberately slowing down the hashing process. The algorithm is designed to require many iterations and significant computation, so even fast modern hardware takes a meaningful amount of time per guess.

Algorithm Key characteristic Common uses
PBKDF2 Applies a pseudorandom function (usually HMAC-SHA256) thousands of times. Iteration count is configurable. WPA2 (Wi-Fi passphrase derivation), LUKS disk encryption, some web applications
bcrypt Designed specifically for password hashing. Has a work factor (cost) that can be increased as hardware speeds up, keeping brute-force impractical over time. Web application password storage (widely used in PHP, Python, Ruby, Node.js ecosystems)
scrypt Memory-hard: requires significant RAM in addition to CPU time. Resists GPU and ASIC attacks because memory bandwidth is the bottleneck, not raw computation. Some cryptocurrency wallets; Linux encryption tools
Argon2 Winner of the Password Hashing Competition (2015). Three variants: Argon2d (GPU-resistant), Argon2i (side-channel-resistant), Argon2id (both — recommended). Highly tunable. Currently the recommended algorithm for new systems requiring password hashing

Digital Signatures

A digital signature provides two guarantees: integrity (the content was not altered) and non-repudiation (it came from someone who possesses the specific private key). Signatures do not encrypt the content — they verify it.

How a digital signature works:

  1. The sender hashes the message or document (e.g., SHA-256)
  2. The sender encrypts that hash with their private key. That encrypted hash is the signature.
  3. The sender transmits both the original message and the signature
  4. The recipient decrypts the signature using the sender's public key, recovering the hash
  5. The recipient independently hashes the received message and compares the two hashes
  6. If the hashes match: the message was not tampered with (integrity) and came from the key owner (authenticity)

Key Exchange

Key exchange protocols solve a specific problem: how do two parties agree on a shared secret over an untrusted channel without ever transmitting the secret itself?

  • Diffie-Hellman (DH): The original protocol. Each party generates a private value and a corresponding public value. The math combines both public values in a way that produces the same shared secret on both ends, without either party ever sending that secret. An eavesdropper sees only the public values and cannot derive the shared secret without solving a computationally infeasible problem.
  • ECDH (Elliptic Curve Diffie-Hellman): The ECC-based version of Diffie-Hellman. Equivalent security with much smaller keys and faster computation.
  • ECDHE (Ephemeral ECDH): Uses a fresh, temporary key pair for each session. This provides Perfect Forward Secrecy (PFS): even if the server's long-term private key is later compromised, past recorded session traffic cannot be decrypted because each session's key was independently generated and discarded.

Obfuscation Techniques

Technique How it works Security property Common use
Steganography Hides a secret message within another file or media type. For example: embedding text in the least-significant bits of an image's pixel values. The image looks normal but carries concealed data. Conceals the existence of communication, not just its content. Different from encryption, which hides content but not the fact that something is being communicated. Covert data exfiltration, watermarking, digital forensics (detecting hidden content)
Tokenization Replaces sensitive data with a non-sensitive placeholder (token). A token vault maps each token back to the original value. The token itself is meaningless outside the vault. Sensitive data never needs to be stored or transmitted by the application. Even if the application database is compromised, the attacker gets tokens, not real data. Tokens cannot be mathematically reversed. Payment systems (credit card numbers stored as tokens), healthcare records, PII in analytics systems
Data masking Replaces sensitive data with realistic-looking but fake values. A real name becomes a fictional name; a real credit card number becomes a plausible but invalid number. Allows developers, testers, and analysts to work with realistic data volumes and formats without exposing real PII or sensitive records. Dev and test environments, data analytics pipelines, offshore development teams

Blockchain and Open Public Ledgers

A blockchain is a distributed, append-only ledger where each block of recorded data is cryptographically linked to the previous block via a hash. Altering any block changes its hash, which invalidates all subsequent blocks — making tampering evident.

On a public (open) blockchain, all participants can independently verify the complete transaction history. No single entity controls the ledger. Transactions are signed with private keys, providing non-repudiation.

From a security perspective, blockchain provides strong data integrity and non-repudiation properties. Beyond cryptocurrency, these properties are applied to supply chain provenance (tracking who handled a product at each step), audit log tamper-evidence, and digital identity schemes.

Algorithm and Key Length Reference

Algorithm Type Recommended minimum Notes
AES Symmetric 128-bit 256-bit for classified or long-term sensitive data. AES-128 is considered quantum-resistant for near-term threats.
RSA Asymmetric 2048-bit 3072 to 4096-bit preferred where performance allows. Vulnerable to sufficiently capable quantum computers (Shor's algorithm).
ECC Asymmetric 256-bit 256-bit ECC is roughly equivalent to 3072-bit RSA. Preferred for TLS, mobile, and IoT.
DH Key exchange 2048-bit Use ECDHE in preference to DH. Ephemeral variants provide PFS.
SHA-256 Hash 256-bit output Do not use MD5 or SHA-1 for new applications. SHA-256 or SHA-3 for new implementations.
1.5 Public Key Infrastructure (PKI)

PKI is the ecosystem of roles, policies, hardware, software, and procedures that creates, manages, distributes, and revokes digital certificates. A certificate binds a public key to an identity (a domain name, an organization, a person, or a device) in a way that a trusted third party has verified. That trust is what makes HTTPS work.

Certificate Authority (CA) Hierarchy

Trust in PKI flows from a hierarchy of certificate authorities.

Role What it does Key security consideration
Root CA The top of the trust hierarchy. Its certificate is self-signed. Browsers and operating systems include a set of trusted root CA certificates (the root store). Everything in the chain traces back to a root CA. Root CAs should be kept offline (air-gapped) to protect the most critical trust anchor. If a root CA is compromised, every certificate it has ever issued must be treated as untrusted.
Intermediate CA Issued by the root CA. Acts as a middle layer that issues end-entity certificates for websites, users, and devices. The root CA delegates issuance to intermediates. If an intermediate CA is compromised, only the certificates it issued need to be revoked. The root CA and other intermediates remain unaffected. This containment is why intermediates exist.
Registration Authority (RA) Handles identity verification on behalf of the CA. Offloads the vetting process so the CA can focus on cryptographic operations. The RA does not sign certificates — only the CA does. The RA is trusted to verify requestor identity before forwarding CSRs to the CA.
Self-signed certificate A certificate signed by the entity's own private key rather than by a CA. No external party has verified the identity. Browsers show a security warning. Appropriate for internal systems, local development, and lab environments — never for production-facing services.

Certificate Lifecycle

  1. Key generation: The entity generates a public/private key pair. The private key never leaves the entity's control.
  2. Certificate Signing Request (CSR): The entity creates a CSR containing the public key and identifying information (domain name, organization, location). The CSR is sent to the CA.
  3. Vetting: The CA (or RA) verifies the identity claims in the CSR. The depth of verification depends on the certificate type (DV, OV, or EV).
  4. Issuance: The CA signs the certificate with its private key. This signature is what establishes trust. The signed certificate is returned to the requestor.
  5. Installation: The certificate is installed on the server, application, or device.
  6. Renewal: Certificates have a fixed validity period (typically one to two years for public certificates). They must be renewed before expiry or services will break.
  7. Revocation: If a certificate must be invalidated early — due to key compromise, organizational change, or domain loss — the CA revokes it and publishes the revocation status.

Certificate Revocation Methods

When a certificate must be invalidated before its expiry date, the CA must publish notice so that clients can check the status before trusting it.

Method How it works Limitation
CRL (Certificate Revocation List) The CA periodically publishes a signed list of revoked certificate serial numbers. Clients download and check this list before trusting a certificate. CRLs can become very large. They are updated periodically, so there is a window between revocation and the next CRL publication during which a revoked certificate may still appear valid.
OCSP (Online Certificate Status Protocol) A real-time query protocol. The client sends the certificate's serial number to an OCSP responder. The responder replies with the current status: good, revoked, or unknown. Requires the client to contact the OCSP responder for every certificate check, which introduces latency, creates a privacy concern (the CA learns which sites you visit), and fails if the responder is unavailable.
OCSP Stapling The server (not the client) periodically fetches a signed, timestamped OCSP response from the CA and "staples" it to the TLS handshake. The client receives the proof directly from the server without making a separate request to the CA. Solves both the latency and privacy issues of standard OCSP. The trade-off is that the server must proactively maintain fresh stapled responses.

Certificate Types

Certificate types reflect the level of identity verification the CA performed before issuance.

Type What the CA verifies Typical use
Domain Validation (DV) The applicant controls the domain — verified via DNS record placement or HTTP challenge. No organization identity check. Personal websites, blogs, development environments; fast and low-cost issuance
Organization Validation (OV) Domain control plus confirmation that the organization is a legitimate registered entity (via business registry, phone verification, etc.) Business websites, portals, and services where users benefit from knowing the operating organization
Extended Validation (EV) Rigorous vetting of legal, operational, and physical existence of the organization. Most thorough process, takes days to weeks. Financial institutions, e-commerce, high-trust services. Previously triggered a green address bar in browsers — now EV status is visible in certificate details rather than the address bar UI.
Wildcard Covers a domain and all its immediate subdomains. A certificate for *.example.com is valid for www.example.com, api.example.com, mail.example.com — but not sub.api.example.com. Organizations with many subdomains under a single domain. One certificate, one renewal.
Subject Alternative Name (SAN) / Multi-domain A single certificate listing multiple specific domain names in the SAN field. Can cover domains across different TLDs. Organizations running several different sites on one server; Microsoft Exchange (covers multiple hostnames on the same certificate)
Self-signed The entity signs its own certificate. No CA has verified the identity. No external trust. Internal services, lab environments, development, testing. Browsers present a warning to end users.

Certificate Formats

The same certificate data can be stored in different file formats. The format matters when moving certificates between systems or importing them into applications.

Format Extensions Encoding Includes private key Notes
PEM .pem, .crt, .cer, .key Base64 (ASCII text) No (typically — unless .key file is combined) Most common on Linux, Apache, Nginx. Human-readable (starts with "-----BEGIN CERTIFICATE-----"). Can contain a certificate chain.
DER .der, .cer Binary No Common on Windows and Java environments. Not human-readable. Single certificate per file — no chaining.
PFX / PKCS#12 .pfx, .p12 Binary Yes — can contain certificate, private key, and chain in one file Used in Windows IIS, Azure, and other Windows environments. Password-protected. This is the format for exporting a certificate with its private key.
P7B / PKCS#7 .p7b, .p7c Base64 or binary No Contains certificate chains without private keys. Used in Windows and Java for distributing certificate chains.

Trust Models

Model How trust is established Common use
Hierarchical (Chain of Trust) A single root CA anchors trust. Root CAs sign intermediate CAs; intermediates sign end-entity certificates. Trust flows downward. Relying parties trust whichever root CAs are in their root store. The dominant model for the public web (browsers' root stores contain hundreds of trusted root CAs). Also used in enterprise internal PKI.
Web of Trust No central authority. Users sign each other's public keys directly after personal verification. The more signatures a key has from people you trust, the more credible it is. PGP and GPG email encryption. Common in open-source communities where participants know each other directly.
← Back to Security+ Study Guide Next: D2 — Threats, Vulnerabilities, and Mitigations →