Cryptography is the science of hiding information so that only the intended recipient can read it. In the world of information security, it is the primary tool for protecting data at rest, in transit, and even in use. For the CISSP exam, understanding cryptography is not about becoming a mathematician; it is about knowing which type of cryptographic tool solves which business problem, and recognising the common pitfalls that lead to insecure implementations.
Jump to a section
A simple way to picture Cryptography and Its Applications
The sealed envelope you drop into a public post box is the simplest cryptographic system ever deployed at global scale. The message written on the paper inside is the plaintext. Before you slide it into the envelope, you might write it in a code that only you and the recipient understand; that code is the cipher. Sealing the envelope is like encrypting the plaintext into ciphertext—anyone handling the envelope can see it exists, but they cannot read the hidden words without tearing it open. The recipient uses a letter opener, which acts as the decryption key, to reveal the original message. No one else can open it without leaving visible damage, which provides integrity—tampering is immediately obvious. The return address on the back of the envelope offers authentication, proving who the message claims to be from. A dated postmark stamped over the seal delivers non-repudiation: proof of exactly when it was sent and that it really did enter the postal system, stopping the sender later denying they ever mailed it. Finally, the recipient may choose to keep the sealed envelope in a safe for years—this is key management: protecting the key (the letter opener) and the secured message so that future access remains possible but unauthorised access remains impossible.
Cryptography transforms readable data, called plaintext, into an unreadable format called ciphertext, using a mathematical recipe known as an encryption algorithm and a secret value called a key. The reverse process, decryption, uses a key to turn ciphertext back into plaintext. If you do not have the correct key, the ciphertext should be useless to you. This is the concept of confidentiality—ensuring that only authorised parties can access the data.
There are two fundamental families of encryption: symmetric and asymmetric. Symmetric encryption uses the same key for both encryption and decryption. Think of a single physical key that locks and unlocks a safe. It is very fast and efficient for encrypting large amounts of data, but it has a problem: how do you securely get that single key to the other person in the first place? This is called the key distribution problem. Symmetric algorithms include AES (Advanced Encryption Standard), which is the modern workhorse approved by governments worldwide, and older ones like DES (Data Encryption Standard) and 3DES. Symmetric ciphers come in two flavours: block ciphers, which encrypt data in fixed-size chunks (AES uses 128-bit blocks), and stream ciphers, which encrypt data one bit or byte at a time.
Asymmetric encryption, also called public-key cryptography, solves the key distribution problem by using a pair of mathematically related keys: a public key and a private key. The public key can be shared with everyone, like your postal address published in a directory. The private key must be kept absolutely secret, like the key to your post box. Anything encrypted with the public key can only be decrypted with the corresponding private key, and vice versa. If someone wants to send you a confidential message, they encrypt it with your public key; only you can decrypt it with your private key. Asymmetric encryption is slower than symmetric, so it is normally used to securely exchange a temporary symmetric key, which then encrypts the bulk of the data. This combination is called hybrid cryptography. Common asymmetric algorithms are RSA, named after its inventors Rivest, Shamir, and Adleman, and ECC (Elliptic Curve Cryptography), which provides equivalent security with much smaller key sizes, ideal for mobile devices.
Cryptography also provides more than just confidentiality. Hash functions take an input of any size and produce a fixed-size string called a digest or hash. They are one-way operations: you cannot reverse a hash to get the original input. Hashing provides integrity: if even one bit of the original data changes, the hash becomes completely different. Common hash algorithms include SHA-256 and SHA-3. Hashing alone does not tell you who created the message. A digital signature combines a hash with asymmetric encryption to provide authentication, integrity, and non-repudiation. The sender creates a hash of the message, encrypts that hash with their private key, and attaches the result as a signature. The recipient decrypts the signature with the sender's public key, recalculates the hash of the message, and compares the two. If they match, the message is authentic and has not been altered.
Real-world protocols tie these primitives together. TLS (Transport Layer Security), the ‘s’ in HTTPS, uses asymmetric encryption to authenticate the server and negotiate a symmetric session key, then uses symmetric encryption to protect the data stream. IPsec (Internet Protocol Security) does the same for network-layer VPNs. Public Key Infrastructure (PKI) provides a framework for issuing, revoking, and trusting digital certificates that bind a public key to an identity, using Certificate Authorities (CAs).
The three main services of cryptography map directly to the CIA triad:
Confidentiality is delivered by encryption (symmetric or asymmetric).
Integrity is delivered by hash functions and digital signatures.
Availability in a cryptographic sense is often about having robust key management and algorithms that resist denial-of-service attacks against cryptographic operations.
Authentication and non-repudiation are two additional services that cryptography uniquely provides. Authentication proves that an entity is who it claims to be; non-repudiation ensures that an entity cannot falsely deny having performed an action, such as sending a message. Digital signatures are the primary mechanism for non-repudiation because they prove possession of the private key, which only the sender should control.
Define the protection objective
Start by asking which of confidentiality, integrity, authentication, or non-repudiation is needed. This single decision determines whether you reach for symmetric encryption, hashing, digital signatures, or a combination. Cryptography only succeeds when it is mapped to a clear security goal.
Select the appropriate algorithm family
Based on the objective, choose between symmetric encryption (for confidentiality of bulk data), asymmetric encryption (for key exchange or digital signatures), and hashing (for integrity). Real-world designs nearly always use a hybrid approach, so pick the right tool for each role in the protocol.
Generate and secure the keys
Use a cryptographically secure random number generator to create keys. Store private keys in a Hardware Security Module or a trusted Key Management Service. Separate the key storage from the data it protects, and define access controls that limit who can read or use each key.
Implement the encryption or signing process correctly
Encrypt data using a vetted, standard library—never attempt to write your own encryption algorithm. For digital signatures, hash the message first, then encrypt the hash with the private key. Apply encryption before data leaves a trusted boundary, and decrypt only when absolutely necessary.
Verify integrity and authenticate the source on receipt
When receiving encrypted and signed data, first decrypt it with the appropriate key. Then re-hash the plaintext and compare it against the decrypted signature. If the hashes match, you have assurance that the data is authentic and unaltered. Any mismatch indicates either corruption or an attack.
Manage the lifecycle: rotation, revocation, and destruction
Set expiry periods for keys and certificates. Rotate keys before they age out. If a private key is compromised, revoke the associated certificate immediately via a Certificate Revocation List (CRL) or OCSP responder. At the end of life, destroy keys using degaussing or cryptographic erasure so they cannot be recovered.
An IT security specialist at a regional healthcare provider is tasked with protecting patient records to comply with data protection regulations. This is a classic, high-stakes scenario where cryptography is not optional.
The first step is to identify every location where sensitive plaintext exists. The specialist discovers patient data stored on database servers, file shares, email attachments, and backup tapes. The immediate action is to apply encryption at rest. All database volumes are encrypted using full-disk encryption with a symmetric algorithm such as AES-256. The encryption keys are not stored on the same server; they are kept inside a cloud-based hardware security module (HSM) or a key management service (Cloud KMS), which logs every access attempt. This forces any potential attacker who steals a physical hard drive to also obtain the key, which is stored elsewhere and rotated regularly.
Next, they protect data in transit. Internal applications serving patient portals currently use unencrypted HTTP. The specialist configures the web servers with TLS 1.3 certificates issued by a trusted internal certificate authority. They enforce HTTPS-only connections, automatically redirecting HTTP to HTTPS. They also deploy an email gateway that uses S/MIME to encrypt messages containing patient data before they leave the organisation, ensuring that even if a message is intercepted, it remains unintelligible.
The organisation then needs to guarantee the integrity and authenticity of electronic prescriptions. The specialist implements a digital signature workflow: when a doctor signs a prescription electronically, the system hashes the prescription content and encrypts that hash with the doctor's private key, which is stored on a smart card. The pharmacy decrypts the signature with the doctor’s public key, which is embedded in a digital certificate issued by the healthcare provider’s PKI. If the hashes match, the pharmacy knows the prescription has not been tampered with and really came from that doctor. This provides non-repudiation—the doctor cannot later claim they never wrote that prescription.
Finally, the specialist addresses the human and procedural elements of key management. They create a policy stating that private keys must never be shared via email or chat, that cryptographic keys must be replaced every 12 months, and that any compromise of a private key triggers an immediate emergency re-issuance and revocation process. All these actions are logged and audited, tying cryptographic controls directly to the organisation’s risk management and compliance reporting. The specialist trains IT staff and clinicians on why they must never bypass encryption or share their decryption passphrases, reinforcing that cryptography only works if the operational discipline around keys matches the mathematical strength of the algorithms.
The CISSP exam tests cryptography as a toolkit of services, not as raw mathematics. You will face scenario-based questions that demand you pick the right cryptographic technique for a given business requirement. The exam loves to force a choice between symmetric and asymmetric encryption, and between hashing and encryption.
The most frequently tested services and their correct mappings are:
Confidentiality: use encryption (symmetric is fast for bulk data; asymmetric is used for key exchange).
Integrity: use hashing algorithms like SHA-256 or SHA-3.
Authentication: use digital signatures or Message Authentication Codes (MACs) that rely on a shared secret.
Non-repudiation: use digital signatures only, because they rely on a private key that only the sender should possess.
Trap patterns to recognise:
A question asks how to ensure that a file has not been altered. The answer is hashing, not encryption. Many beginners pick encryption because they think encrypting the file protects it from changes, but encryption alone does not prove integrity.
A question asks for non-repudiation. The correct answer will involve digital signatures or asymmetric encryption with a sender’s private key. HMAC (Hash-based Message Authentication Code) provides authentication and integrity but cannot provide non-repudiation because both parties share the same secret key—either could have created the HMAC.
A question describes a large volume of data needing protection in transit. The correct answer is to use a symmetric session key established via asymmetric exchange (hybrid cryptography). The exam will present options like “use RSA to encrypt the entire payload” as a distractor—that is theoretically possible but outrageously slow.
A question asks about protecting stored credit card numbers. The correct answer patterns are tokenisation or format-preserving encryption, not just any symmetric encryption. CISSP expects you to know that specialised data types often require specialised cryptographic approaches.
Key definitions you must memorise without hesitation:
Symmetric encryption uses one shared key; examples: AES, DES, 3DES, Blowfish, RC4.
Asymmetric encryption uses a key pair (public and private); examples: RSA, ECC, ElGamal.
Hash function is one-way; produces a fixed-length digest; examples: SHA-256, SHA-3, MD5 (broken).
Digital signature equals encrypting the hash of a message with the sender’s private key.
PKI is the framework of Certificate Authorities, registration authorities, and certificate revocation lists that manages digital certificates.
Perfect forward secrecy (PFS) is a property of key exchange protocols where the compromise of a long-term private key does not compromise past session keys. It is commonly tested in the context of TLS configurations.
The exam also probes key management concepts. You must know that keys should be rotated periodically, that private keys must never be stored alongside the data they protect, and that key escrow (storing a copy of a key with a trusted third party) is a legitimate business continuity practice but must be carefully controlled. Questions may describe an organisation that lost its encryption key and has no backup—the correct answer is that the data is effectively destroyed. The CISSP expects you to recognise that cryptographic strength relies as much on key management practices as on the algorithm itself.
Cryptography provides five core services: confidentiality, integrity, authentication, non-repudiation, and access control support.
Symmetric encryption uses a single shared key and is best suited for encrypting large volumes of data quickly.
Asymmetric encryption uses a key pair and is ideal for secure key exchange and digital signatures, but it is too slow for bulk bulk data encryption.
A hash function enables integrity verification by producing a unique, fixed-size digest that cannot be reversed to the original data.
A digital signature is created by encrypting a message hash with the sender's private key, providing non-repudiation because only the sender controls that key.
Modern secure communication protocols such as TLS and IPsec use hybrid cryptography: asymmetric encryption to safely exchange a symmetric session key, then symmetric encryption for the data stream.
Key management—generating, storing, rotating, and revoking keys—is just as critical to overall security as the strength of the algorithm used.
The CISSP exam consistently asks you to match business requirements (e.g., ‘prove it was not tampered with’) to the correct cryptographic primitive (in that case, hashing, not encryption).
These come up on the exam all the time. Here's how to tell them apart.
Symmetric Encryption
Uses a single shared secret key for both encryption and decryption.
Extremely fast and suitable for bulk data encryption.
Key distribution must be solved out-of-band; example algorithms: AES, DES.
Asymmetric Encryption
Uses a mathematically linked key pair: public and private.
Slow compared to symmetric; typically used for key exchange or digital signatures.
Solves key distribution through public sharing; example algorithms: RSA, ECC.
Hashing
A one-way mathematical function producing a fixed-size digest.
Cannot be reversed to obtain the original input without extraordinary effort.
Primary purpose is integrity verification, not hiding data.
Encryption
A reversible process requiring a key to decrypt the output.
Designed to recover the original plaintext when the correct key is used.
Primary purpose is confidentiality, though it can also support integrity in authenticated modes.
Digital Signature
Uses asymmetric cryptography: encrypt hash with sender’s private key.
Provides non-repudiation because only the sender holds the private key.
Verification relies on a trusted Public Key Infrastructure.
Message Authentication Code (MAC)
Uses a symmetric shared secret to generate a tag on a message.
Provides authentication and integrity but not non-repudiation, since both parties share the secret.
Much faster than digital signatures; example: HMAC-SHA256.
Block Cipher
Encrypts data in fixed-size blocks (e.g. 128 bits for AES).
Requires modes of operation like CBC or GCM to handle data longer than one block.
Commonly used for file encryption, disk encryption, and TLS.
Stream Cipher
Encrypts data as a continuous stream, one bit or byte at a time.
Naturally suits real-time communication like voice or video streaming.
Examples include RC4 (now deprecated) and ChaCha20.
Public Key Infrastructure (PKI)
Relies on a centralised hierarchy of Certificate Authorities (CAs).
Trust is transitive: if you trust the root CA, you automatically trust all certificates it signs.
Used almost universally for TLS, code signing, and enterprise authentication.
Web of Trust
A decentralised model where users directly vouch for each other’s keys.
No single point of trust; you decide how much to rely on any introducer.
Primarily used in PGP/GPG email encryption and niche communities.
Mistake
Symmetric encryption is less secure than asymmetric encryption.
Correct
Both can be equally secure when using appropriate key lengths. Symmetric algorithms like AES-256 are trusted to protect top-secret government information, and they are actually harder to break than RSA of equivalent bit length.
Beginners often equate ‘public’ with less secure and ‘secret’ with more secure, but the real distinction is about key distribution and performance, not inherent strength.
Mistake
Hashing and encryption are interchangeable ways to protect data confidentiality.
Correct
Hashing is a one-way function that produces a fixed-length digest. It cannot be reversed to recover the original data. Encryption is a reversible process that allows authorised decryption with a key.
The term ‘encrypt’ is used loosely in everyday speech to mean any kind of scrambling. This leads to confusion when the CISSP exam asks specifically about data integrity vs confidentiality.
Mistake
A digital signature keeps a message secret.
Correct
A digital signature provides authentication, integrity, and non-repudiation, but it does not provide confidentiality. The original message remains in plaintext form alongside the signature unless separately encrypted.
The word ‘signature’ in the physical world does not hide the contents of a document. In the digital world, learners sometimes mistakenly combine the concept of encryption with signing because both involve keys.
Mistake
A longer key always means a stronger system.
Correct
Key strength depends on the algorithm and the underlying mathematical problem. A 256-bit RSA key is trivially breakable, whereas a 256-bit AES key is extremely strong. Compare the algorithm first, then the key length.
Bit-length comparisons are emphasised in many introductory resources without the nuance of different cryptographic families. This creates the dangerous, persistent myth that ‘bigger bits equals more security’.
Mistake
Once data is encrypted, it is fully protected forever and no further care is needed.
Correct
Encryption is only one part of a security strategy. Keys must be managed, rotated, and revoked. Algorithms become obsolete, and quantum computing threatens many current asymmetric systems in the future.
The set-and-forget mentality is common when something feels ‘military grade’. In reality, cryptographic protection has a lifecycle that must be actively managed for it to remain effective over time.
Reveal each answer, then mark whether you got it right. Score 60%+ to unlock the next chapter.
Encryption is a reversible process that uses a key to scramble and later unscramble data, preserving confidentiality. Hashing is a one-way function that turns any input into a fixed-size digest and cannot be reversed; it is used to verify data integrity.
Use symmetric encryption when you need to encrypt large amounts of data quickly, such as a backup file or a database. Use asymmetric encryption when you need to securely exchange a symmetric key over the internet or create a digital signature, since it solves key distribution problems.
A digital signature is created by encrypting a hash of the message with the sender’s private key. Because only the sender is supposed to possess that private key, the signature mathematically proves the sender endorsed the message, preventing them from later denying they sent it.
TLS uses a handshake process where the server authenticates with an asymmetric certificate, then both parties negotiate a temporary symmetric session key. All subsequent data is encrypted with that fast symmetric key, while hashing verifies that packets have not been altered in transit.
A Certificate Authority (CA) is a trusted third party that issues digital certificates linking a public key to an identity. It is needed because without a trusted CA, an attacker could present their own public key claiming to be your bank, and you would have no way to detect the impersonation.
Not necessarily. The security of a key depends on the algorithm it is used with. A 128-bit AES key is far stronger than a 128-bit RSA key because RSA key strength does not scale linearly with bit length. You must compare keys within the same algorithm family and against current best practice recommendations.
You've finished Cryptography and Its Applications. Continue through the CISSP study guide to build a complete picture of the exam.
Done with this chapter?