Lesson Ten

Cryptography and Cryptographic Solutions

SierraTec Secure CISSP Certification Preparation Course

Lesson Overview

Cryptography is one of the primary technical mechanisms used to protect information and establish trust in digital systems.

Modern organizations use cryptography to protect:

• stored information;

• network communications;

• online banking;

• authentication credentials;

• software updates;

• digital certificates;

• cloud environments;

• mobile devices;

• backups;

• electronic transactions;

• application programming interfaces;

• administrative communications.

However, effective cryptography requires much more than selecting an encryption algorithm.

A cryptographic solution also depends on:

• identifying the security objective;

• choosing an appropriate algorithm;

• selecting sufficient key strength;

• generating keys securely;

• protecting keys;

• distributing or establishing keys;

• rotating keys;

• revoking compromised keys;

• selecting suitable modes of operation;

• using initialization values and nonces correctly;

• maintaining cryptographic agility;

• retiring obsolete algorithms;

• responding to technological changes such as quantum computing.

The current CISSP examination places these concepts primarily under Domain 3, Objective 3.6 — Select and determine cryptographic solutions. The current objective specifically includes:

• cryptographic lifecycle;

• keys;

• algorithm selection;

• symmetric cryptography;

• asymmetric cryptography;

• elliptic curves;

• quantum-related cryptography;

• Public Key Infrastructure;

• quantum key distribution.

This lesson concentrates on cryptographic principles, methods, algorithms, security services, and key-management foundations.

Lesson Eleven will expand:

• cryptanalytic attacks;

• PKI architecture;

• certificate authorities;

• certificate validation;

• revocation;

• OCSP;

• CRLs;

• certificate chains;

• man-in-the-middle attacks;

• side-channel attacks;

• brute force;

• timing attacks;

• fault injection.

The central Lesson Ten question is:

Which cryptographic mechanism should be selected to achieve confidentiality, integrity, authenticity, or nonrepudiation—and how should its keys be managed throughout their lifecycle?

CISSP Exam Objective Alignment

The official outline currently separates cryptographic-solution selection under 3.6 from cryptanalytic attacks under 3.7.

Learning Objectives

After completing this lesson, you should be able to:

1. Define cryptography.

2. Explain the security services cryptography can support.

3. Distinguish plaintext from ciphertext.

4. Distinguish encryption from decryption.

5. Explain the role of cryptographic algorithms and keys.

6. Explain why algorithm secrecy should not be the primary basis of security.

7. Explain cryptographic strength.

8. Explain why randomness and entropy matter.

9. Distinguish symmetric from asymmetric cryptography.

10. Explain the advantages and limitations of symmetric cryptography.

11. Explain AES at a CISSP level.

12. Recognize DES and 3DES as legacy technologies.

13. Distinguish block ciphers from stream ciphers.

14. Explain common block-cipher operating modes.

15. Explain why ECB generally provides weak pattern protection.

16. Explain CBC, CTR, and GCM conceptually.

17. Explain authenticated encryption.

18. Explain asymmetric key pairs.

19. Distinguish public and private keys.

20. Explain RSA conceptually.

21. Explain Diffie-Hellman conceptually.

22. Explain elliptic-curve cryptography conceptually.

23. Explain hybrid cryptography.

24. Define hashing.

25. Explain preimage resistance and collision resistance.

26. Distinguish hashing from encryption.

27. Explain salts in password storage.

28. Define Message Authentication Code.

29. Explain HMAC.

30. Explain digital signatures.

31. Explain how digital signatures differ from encryption.

32. Explain how confidentiality and digital signatures can be combined.

33. Explain the cryptographic key lifecycle.

34. Explain secure key generation.

35. Explain key establishment and distribution.

36. Explain secure key storage.

37. Explain key rotation and cryptoperiods.

38. Explain key revocation.

39. Explain key recovery and escrow.

40. Explain split knowledge and dual control.

41. Explain cryptographic key destruction.

42. Explain Hardware Security Modules.

43. Distinguish HSMs from TPMs.

44. Explain cryptographic agility.

45. Explain initialization vectors and nonces conceptually.

46. Explain post-quantum cryptography.

47. Recognize ML-KEM, ML-DSA, and SLH-DSA.

48. Explain the difference between post-quantum cryptography and quantum key distribution.

49. Select appropriate cryptographic methods for CISSP scenarios.

50. Recognize common CISSP cryptography traps.

Part I — Understanding Cryptography

1. What Is Cryptography?

Cryptography is the use of mathematical techniques to protect information and communications.

It can support security objectives including:

• confidentiality;

• integrity;

• authenticity;

• nonrepudiation.

Cryptography does not automatically provide every security property at the same time.

The cryptographic mechanism must match the requirement.

2. Cryptographic Security Services

                    CRYPTOGRAPHY

                         │

        ┌────────────────┼────────────────┐

        │                │                │

        ▼                ▼                ▼

CONFIDENTIALITY       INTEGRITY       AUTHENTICITY

        │                │                │

        └────────────────┴───────┬────────┘

                                 ▼

                         NONREPUDIATION

                           (supported)

3. Confidentiality

Cryptography can prevent unauthorized parties from understanding protected information.

Example:

PLAINTEXT

"Payroll = $80,000"

       │

       ▼

   ENCRYPTION

       │

       ▼

CIPHERTEXT

8F3A91C2...

Without the appropriate key, the ciphertext should be computationally infeasible to convert back into meaningful plaintext.

4. Integrity

Cryptographic mechanisms can help determine whether information has changed.

Common mechanisms include:

• cryptographic hashes;

• MACs;

• digital signatures.

5. Authenticity

Cryptography can support confidence that:

• a message came from the expected source;

• a system holds the expected key;

• software originated from the claimed publisher.

6. Nonrepudiation

Digital signatures can support evidence connecting a signer to a signed message or transaction.

The more precise CISSP wording is:

Digital signatures support nonrepudiation.

Organizational procedures, key protection, identity proofing, and legal frameworks also affect whether a signature provides meaningful evidence.

Part II — Plaintext, Ciphertext, Encryption, and Decryption

7. Plaintext

Plaintext is information in its original readable or interpretable form.

Example:

Transfer $10,000 to Account 4421.

8. Ciphertext

Ciphertext is the transformed output produced by encryption.

It should not reveal the original information to unauthorized parties when appropriate cryptography is correctly implemented.

9. Encryption

Encryption converts:

Plaintext → Ciphertext

using:

• an algorithm;

• a cryptographic key.

10. Decryption

Decryption converts:

Ciphertext → Plaintext

using the appropriate cryptographic key and algorithm.

11. Cryptographic Flow

                ENCRYPTION

                    │

                    ▼

PLAINTEXT ───► ALGORITHM + KEY ───► CIPHERTEXT

                                         │

                                         ▼

                                    TRANSMISSION

                                    OR STORAGE

                                         │

                                         ▼

CIPHERTEXT ──► ALGORITHM + KEY ───► PLAINTEXT

                    ▲

                    │

                DECRYPTION

Part III — Algorithms and Keys

12. Cryptographic Algorithm

A cryptographic algorithm is the mathematical process used to transform or process information.

Examples include:

• AES;

• RSA;

• SHA-256.

The algorithm is not generally expected to remain secret.

13. Cryptographic Key

A cryptographic key is a value used by the algorithm to control the cryptographic transformation.

The security of a well-designed cryptosystem should normally depend primarily on protection of the key—not secrecy of the algorithm.

14. Kerckhoffs's Principle

A foundational cryptographic design principle states, conceptually:

A cryptosystem should remain secure even if an attacker knows how the system works, provided the key remains secret.

Therefore:

ALGORITHM

   │

Generally public/known

   │

   ▼

KEY

   │

Must receive appropriate protection

15. Security Through Obscurity

Hiding implementation details can create an additional barrier.

But:

Security should not depend entirely on attackers being unaware of the algorithm or architecture.

Strong cryptography should remain secure even when its algorithm is publicly analyzed.

Part IV — Cryptographic Strength

16. What Determines Cryptographic Strength?

Factors include:

• algorithm design;

• key length;

• implementation;

• key protection;

• random-number quality;

• protocol design;

• attack capabilities.

A long key cannot compensate for a fundamentally broken algorithm.

17. Key Length

Larger keys generally expand the number of possible keys.

But key sizes cannot be compared blindly between different algorithm families.

For example:

A 256-bit symmetric key and a 256-bit elliptic-curve key do not represent identical cryptographic structures merely because both contain “256.”

18. Effective Security

Think:

STRONG ALGORITHM

       +

SUFFICIENT KEY STRENGTH

       +

SECURE IMPLEMENTATION

       +

SECURE KEY MANAGEMENT

       =

EFFECTIVE CRYPTOGRAPHIC PROTECTION

Failure of any major component can weaken the overall solution.

Part V — Randomness and Entropy

19. Why Randomness Matters

Cryptography depends heavily on unpredictable values.

Examples include:

• cryptographic keys;

• nonces;

• initialization vectors;

• salts.

Predictable values may dramatically weaken a cryptographic system.

20. Entropy

Entropy represents uncertainty or unpredictability in generated values.

Strong cryptographic key generation requires an appropriate source of randomness.

21. Weak Key Generation Example

Poor:

Encryption Key =

CompanyName2026

Better:

Cryptographically secure

randomly generated key

Human-created strings generally do not provide sufficient cryptographic randomness.

Part VI — Symmetric Cryptography

22. What Is Symmetric Cryptography?

Symmetric cryptography uses the same secret key—or closely related secret keying material—for encryption and decryption.

              SHARED SECRET KEY

                  K

            ┌─────┴─────┐

            ▼           ▼

       ENCRYPTION    DECRYPTION

23. Symmetric Encryption Flow

SENDER



PLAINTEXT

   │

   ▼

ENCRYPT WITH KEY K

   │

   ▼

CIPHERTEXT

   │

   ▼

──────── NETWORK ────────

   │

   ▼

CIPHERTEXT

   │

   ▼

DECRYPT WITH KEY K

   │

   ▼

PLAINTEXT



RECEIVER

Both parties need access to the shared secret.

24. Advantages of Symmetric Cryptography

Symmetric algorithms are generally:

• computationally efficient;

• fast;

• suitable for large volumes of information;

• effective for bulk encryption.

25. Symmetric Cryptography Challenge

The major challenge is:

Key Distribution

How do two parties securely obtain the same secret key?

If the attacker obtains the shared key:

Confidentiality can be lost.

26. Symmetric Key Scaling

Suppose every pair of users requires a unique shared secret.

As the number of users increases, key-management complexity grows rapidly.

This is one reason public-key methods became important.

Part VII — AES

27. Advanced Encryption Standard

AES is the primary modern symmetric block cipher candidates should recognize.

AES supports key sizes of:

• 128 bits;

• 192 bits;

• 256 bits.

28. AES Characteristics

At CISSP level, associate AES with:

• symmetric encryption;

• block cipher;

• modern data confidentiality;

• efficient bulk encryption.

29. AES Use Cases

AES may be used for:

• full-disk encryption;

• VPN protection;

• database encryption;

• file protection;

• application encryption.

30. Exam Memory Aid

AES = Modern Symmetric Block Cipher

Part VIII — DES and 3DES

31. DES

The Data Encryption Standard is historically important.

Its effective 56-bit key length is no longer adequate for modern security requirements.

For CISSP:

DES is obsolete for modern protection.

32. Triple DES

3DES applies DES operations multiple times to increase effective security compared with ordinary DES.

It is now primarily a legacy technology rather than a preferred choice for new cryptographic designs.

33. Algorithm Evolution

DES

 │

 ▼

3DES

 │

 ▼

AES

For new systems, modern approved algorithms should be selected according to current requirements and standards.

Part IX — Block and Stream Ciphers

34. Block Cipher

A block cipher processes fixed-size blocks of information.

Example:

AES

35. Stream Cipher

A stream cipher encrypts information in a continuing sequence, often conceptually byte by byte or bit by bit.

Stream-oriented cryptography can be useful where:

• low latency;

• continuous communication

is important.

36. Comparison

Part X — Why Block Cipher Modes Exist

37. Modes of Operation

A block cipher processes blocks.

A mode of operation determines how blocks are combined to securely encrypt longer messages.

Important modes candidates should recognize include:

• ECB;

• CBC;

• CFB;

• OFB;

• CTR;

• GCM.

Part XI — ECB

38. Electronic Codebook

ECB encrypts each block independently.

Conceptually:

BLOCK 1 ──► AES ──► CIPHER BLOCK 1

BLOCK 2 ──► AES ──► CIPHER BLOCK 2

BLOCK 3 ──► AES ──► CIPHER BLOCK 3

39. Major ECB Weakness

Identical plaintext blocks encrypted using the same key produce identical ciphertext blocks.

Patterns can therefore remain visible.

40. ECB Pattern Problem

PLAINTEXT



A A B A A



   ↓



ECB



X X Y X X

The contents are encrypted, but structural patterns remain.

41. CISSP Principle

ECB is generally inappropriate for protecting patterned or structured bulk information.

Memory aid:

ECB exposes patterns.

Part XII — CBC

42. Cipher Block Chaining

CBC chains blocks together so the encryption of one block depends partly on the previous ciphertext block.

The first block uses an initialization vector.

43. CBC Concept

            IV

             │

             ▼

PLAINTEXT 1 ─⊕─► ENCRYPT ─► C1

                          │

                          ▼

PLAINTEXT 2 ──────────────⊕─► ENCRYPT ─► C2

44. CBC Benefit

Repeated plaintext blocks do not necessarily produce repeated ciphertext blocks in the same way as ECB.

45. CBC Consideration

CBC encryption alone does not automatically provide modern authenticated integrity.

Confidentiality and integrity requirements should both be considered.

Part XIII — CFB and OFB

46. Cipher Feedback

CFB uses block-cipher operations in a feedback arrangement to provide stream-like encryption behavior.

47. Output Feedback

OFB generates a keystream-like sequence from repeated cipher output.

These modes are useful for understanding how block ciphers can operate beyond basic independent blocks.

For CISSP:

Know their general role rather than attempting to reproduce implementation equations.

Part XIV — CTR

48. Counter Mode

CTR uses a counter value to produce a keystream that is combined with plaintext.

Conceptually:

COUNTER 1 ─► ENCRYPT ─► KEYSTREAM 1

                             │

PLAINTEXT 1 ─────────────────⊕──► C1



COUNTER 2 ─► ENCRYPT ─► KEYSTREAM 2

                             │

PLAINTEXT 2 ─────────────────⊕──► C2

49. CTR Characteristics

CTR can provide:

• efficient processing;

• parallelization;

• random access to blocks.

Nonce/counter uniqueness is extremely important.

Part XV — GCM

50. Galois/Counter Mode

GCM is a widely used authenticated-encryption mode.

It can provide:

• confidentiality;

• integrity/authentication of ciphertext and associated data.

51. Authenticated Encryption

Traditional thinking:

ENCRYPTION

     │

     ▼

CONFIDENTIALITY

Modern authenticated encryption:

ENCRYPTION

     +

AUTHENTICATION

     │

     ▼

CONFIDENTIALITY

     +

INTEGRITY / AUTHENTICITY

52. AEAD

Authenticated Encryption with Associated Data, or AEAD, allows a design to protect:

• encrypted content;

• associated metadata whose integrity must be authenticated even if it is not encrypted.

53. GCM Exam Focus

Remember:

AES-GCM = Authenticated Encryption

Do not assume:

Every encryption mode automatically provides integrity.

Part XVI — Mode Comparison

54. Block Mode Table

Part XVII — Initialization Vectors

55. Initialization Vector

An Initialization Vector, or IV, provides an initial value used by certain encryption modes.

The IV often does not need to be secret.

But depending on the mode, it may need to be:

• unpredictable;

• unique;

• properly generated.

56. IV Is Not the Encryption Key

ENCRYPTION KEY

      ≠

INITIALIZATION VECTOR

They serve different purposes.

Part XVIII — Nonces

57. Nonce

A nonce is a value intended to be used according to the protocol's uniqueness requirements, often effectively:

a value used once in a given cryptographic context.

Nonce reuse can catastrophically weaken some cryptographic constructions.

58. Exam Principle

Do not assume:

“Non-secret” means “unimportant.”

An IV or nonce may be public but still require strict uniqueness or unpredictability.

Part XIX — Asymmetric Cryptography

59. What Is Asymmetric Cryptography?

Asymmetric cryptography uses a mathematically related key pair:

• public key;

• private key.

            KEY PAIR

        ┌──────┴──────┐

        ▼             ▼

   PUBLIC KEY     PRIVATE KEY

60. Public Key

The public key can generally be distributed widely.

61. Private Key

The private key must be appropriately protected.

Compromise of a private key may enable:

• impersonation;

• unauthorized decryption in some schemes;

• fraudulent signatures.

62. Asymmetric Advantages

Asymmetric cryptography can support:

• scalable key establishment;

• digital signatures;

• authentication;

• PKI.

63. Asymmetric Limitations

Compared with symmetric cryptography, asymmetric operations are generally more computationally expensive.

Therefore modern systems often combine:

Asymmetric + Symmetric

in hybrid designs.

Part XX — Asymmetric Confidentiality Concept

64. Public-Key Encryption

Conceptually:

SENDER

   │

   │ Encrypt using

   ▼

RECIPIENT'S PUBLIC KEY

   │

   ▼

CIPHERTEXT

   │

   ▼

RECIPIENT

   │

   │ Decrypt using

   ▼

RECIPIENT'S PRIVATE KEY

The recipient's private key must remain protected.

Part XXI — RSA

65. RSA

RSA is a classic asymmetric cryptographic algorithm family.

At CISSP level, associate RSA with:

• public/private key pairs;

• encryption or key-transport uses in suitable constructions;

• digital signatures.

66. RSA Security Foundation

RSA's traditional security is related to the computational difficulty of factoring sufficiently large integers.

You do not need to manually perform RSA mathematics for the CISSP exam.

67. RSA Exam Principle

Remember:

RSA = Asymmetric

Do not confuse RSA with AES.

Part XXII — Diffie-Hellman

68. Diffie-Hellman

Diffie-Hellman is primarily a:

Key-Agreement Mechanism

It enables parties to derive a shared secret over an untrusted communication channel.

69. Diffie-Hellman Concept

ALICE                           BOB

Private A                     Private B

   │                              │

   ▼                              ▼

Public A                        Public B

   │                              │

   └──────── Exchange ────────────┘

              │

              ▼

       SHARED SECRET

Neither party simply sends the final shared secret across the network.

70. Diffie-Hellman Does Not Automatically Authenticate

Unauthenticated Diffie-Hellman can be vulnerable to interception/man-in-the-middle scenarios.

Authentication must be incorporated where required.

Cryptanalytic attack details will be covered in Lesson Eleven.

Part XXIII — Elliptic-Curve Cryptography

71. ECC

Elliptic-Curve Cryptography uses mathematics based on elliptic curves over finite fields.

At CISSP level, associate ECC with:

• asymmetric cryptography;

• digital signatures;

• key agreement;

• strong security with relatively compact key sizes compared with some traditional alternatives.

72. Why ECC Is Useful

Smaller keys can benefit environments involving:

• mobile devices;

• embedded systems;

• constrained systems;

• network protocols.

73. Exam Memory Aid

ECC = Asymmetric Public-Key Cryptography

Part XXIV — Hybrid Cryptography

74. Why Hybrid Systems Exist

Symmetric cryptography is efficient for bulk data.

Asymmetric cryptography helps solve:

• authentication;

• key-establishment;

• signature problems.

Modern protocols often combine them.

75. Hybrid Model

        ASYMMETRIC CRYPTOGRAPHY

                │

                ▼

     ESTABLISH / PROTECT

         SESSION KEY

                │

                ▼

        SYMMETRIC KEY

                │

                ▼

       BULK DATA ENCRYPTION

76. Example

A secure communication protocol might:

1. authenticate the server using a certificate;

2. use asymmetric/key-agreement mechanisms;

3. derive a symmetric session key;

4. use that session key for high-speed encrypted communication.

This is much more efficient than using expensive asymmetric operations on every block of application data.

Part XXV — Hashing

77. What Is a Hash Function?

A cryptographic hash function converts input of arbitrary length into a fixed-size digest.

INPUT

"The contract is approved."

       │

       ▼

    HASH FUNCTION

       │

       ▼

DIGEST

A18F92...

78. Hash Functions Are One Way

A cryptographic hash should make it computationally infeasible to recover the original input merely from the digest.

This is different from encryption.

79. Hashing Versus Encryption

80. Common Hash Families

CISSP candidates should recognize:

• SHA-2;

• SHA-3.

Examples include:

• SHA-256;

• SHA-384;

• SHA-512.

81. Legacy Hashes

Algorithms such as MD5 and SHA-1 are historically important but should not be selected for modern collision-resistant security designs.

Part XXVI — Hash Security Properties

82. Preimage Resistance

Given:

Hash H

it should be computationally infeasible to find an input that produces H.

83. Second-Preimage Resistance

Given one message:

M1

it should be difficult to find a different message:

M2

with the same digest.

84. Collision Resistance

It should be computationally infeasible to deliberately find any two different inputs that produce the same digest.

M1 ─► HASH ─► X



M2 ─► HASH ─► X

If M1 ≠ M2 but the hash is the same:

Collision

Part XXVII — Hashing and File Integrity

85. File Verification

ORIGINAL FILE

     │

     ▼

HASH

     │

     ▼

DIGEST A



RECEIVED FILE

     │

     ▼

HASH

     │

     ▼

DIGEST B

If:

A ≠ B

the file changed.

86. What a Bare Hash Does Not Prove

If an attacker can replace:

• the file;

• and the published hash;

then an ordinary hash comparison does not prove authenticity.

Additional trusted mechanisms may be required.

Part XXVIII — Password Hashing and Salts

87. Passwords Should Not Normally Be Stored as Plaintext

Instead, authentication systems commonly store derived password-verification values using suitable password-hashing/key-derivation techniques.

88. Salt

A salt is a unique value combined with a password before password hashing.

PASSWORD

    +

UNIQUE SALT

    │

    ▼

PASSWORD HASHING

    │

    ▼

STORED VALUE

89. Why Salt Matters

Without salts, identical passwords can generate identical stored hashes under the same simple hashing process.

With unique salts:

Password: Sierra123

Salt A → Hash X



Password: Sierra123

Salt B → Hash Y

This makes precomputed attacks less effective.

90. Salt Is Not a Secret Key

A salt generally does not need to remain secret.

Its security purpose differs from an encryption key.

Part XXIX — Message Authentication Codes

91. MAC

A Message Authentication Code uses secret keying material to provide assurance concerning:

• message integrity;

• message authenticity.

92. MAC Concept

MESSAGE

   +

SECRET KEY

   │

   ▼

MAC ALGORITHM

   │

   ▼

AUTHENTICATION TAG

93. MAC Versus Hash

A simple hash:

MESSAGE → HASH

A MAC:

MESSAGE + SECRET KEY → TAG

The secret key enables source/authenticity assurance among parties holding the secret.

Part XXX — HMAC

94. HMAC

HMAC is a keyed message-authentication construction using a cryptographic hash function.

It supports:

• integrity;

• message authentication.

95. HMAC Flow

MESSAGE

   │

   ├──────┐

   │      │

   ▼      ▼

 HASH   SECRET KEY

   │      │

   └──┬───┘

      ▼

    HMAC

      │

      ▼

AUTHENTICATION VALUE

96. HMAC Does Not Encrypt the Message

The message may remain readable.

HMAC primarily addresses:

• integrity;

• authenticity.

Part XXXI — Digital Signatures

97. What Is a Digital Signature?

A digital signature uses asymmetric cryptography to provide assurance concerning:

• integrity;

• origin authenticity;

• nonrepudiation support.

98. Signing Concept

The signer uses:

Private Key

The recipient verifies using:

Public Key

99. Digital Signature Flow

                SENDER

                  │

                  ▼

               MESSAGE

                  │

                  ▼

                 HASH

                  │

                  ▼

              DIGEST

                  │

                  ▼

         SIGN WITH PRIVATE KEY

                  │

                  ▼

        DIGITAL SIGNATURE

Recipient:

MESSAGE + SIGNATURE

        │

        ▼

VERIFY USING SIGNER'S

PUBLIC KEY

        │

        ▼

SIGNATURE VALID?

100. Why Hash Before Signing?

Digital-signature systems commonly sign a digest rather than processing the entire potentially large message directly through the signature algorithm.

This improves efficiency and connects the signature to the message's integrity.

101. Digital Signature Security Services

102. Major Exam Trap

Digital Signature ≠ Encryption for Confidentiality

Signing a document does not automatically hide its contents.

Part XXXII — Signing Versus Encrypting

103. Confidentiality

For conceptual asymmetric confidentiality:

Encrypt using recipient's public key.

104. Digital Signature

For signing:

Sign using sender's private key.

105. Comparison

Part XXXIII — Combining Confidentiality and Signatures

106. Both May Be Required

Suppose Alice sends Bob a confidential signed contract.

Requirements:

• Bob must be able to read it.

• Unauthorized parties should not.

• Bob must verify Alice's signature.

Conceptually, the system may combine:

• digital signatures;

• encryption.

107. Layered Cryptographic Protection

MESSAGE

   │

   ▼

DIGITALLY SIGN

   │

   ▼

SIGNED MESSAGE

   │

   ▼

ENCRYPT FOR RECIPIENT

   │

   ▼

PROTECTED TRANSMISSION

Exact protocol ordering and construction should follow established standards rather than improvised cryptography.

Part XXXIV — Cryptographic Key Management

108. The Algorithm Is Only Part of Security

A powerful cryptographic algorithm with poorly managed keys can provide weak security.

NIST's currently final SP 800-57 Part 1 Rev. 5 provides extensive guidance for the management and protection of cryptographic keying material.

109. Cryptographic Key Lifecycle

KEY REQUIREMENT

      │

      ▼

GENERATION

      │

      ▼

ESTABLISHMENT /

DISTRIBUTION

      │

      ▼

STORAGE

      │

      ▼

ACTIVE USE

      │

      ▼

ROTATION / RENEWAL

      │

      ▼

REVOCATION / EXPIRATION

      │

      ▼

ARCHIVAL / RECOVERY

      │

      ▼

DESTRUCTION

110. Key Generation

Cryptographic keys should be generated using:

• approved algorithms;

• sufficient entropy;

• suitable key lengths;

• trusted cryptographic mechanisms.

Weak random-number generation can undermine strong encryption.

111. Key Distribution

Symmetric keys must be securely shared with authorized parties.

The challenge is:

How do we securely send the secret required to protect communication?

Possible approaches include:

• secure key-establishment protocols;

• public-key mechanisms;

• pre-established secure channels.

112. Key Establishment

Key establishment generally includes mechanisms through which communicating parties obtain shared keying material.

Two conceptual approaches include:

Key Transport

One party creates keying material and securely provides it to another.

Key Agreement

Both parties contribute to deriving shared keying material.

Diffie-Hellman is a well-known key-agreement concept.

Part XXXV — Key Storage

113. Protect Keys According to Their Importance

Encryption keys should not casually be stored:

• in source code;

• in public repositories;

• in unprotected configuration files;

• beside the encrypted data without adequate protection.

114. Key Hierarchy

Organizations may use:

MASTER / ROOT KEY

      │

      ▼

KEY-ENCRYPTION KEY

      │

      ▼

DATA-ENCRYPTION KEY

      │

      ▼

PROTECTED DATA

This allows different keys to serve specialized purposes.

115. Key Wrapping

Key wrapping is the protection of one cryptographic key using another cryptographic mechanism/key.

This can help protect keys during:

• storage;

• distribution;

• backup.

Part XXXVI — Hardware Security Modules

116. HSM

A Hardware Security Module is a specialized security device designed to perform and protect cryptographic operations and sensitive key material.

117. HSM Functions

An HSM may support:

• secure key generation;

• key storage;

• signing;

• encryption/decryption;

• controlled cryptographic operations.

118. HSM Architecture

APPLICATION

    │

    ▼

CRYPTOGRAPHIC REQUEST

    │

    ▼

┌────────────────────┐

│        HSM         │

│                    │

│ Protected Keys     │

│ Crypto Operations  │

│ Access Controls    │

└────────────────────┘

Ideally, highly sensitive private keys may remain protected within the cryptographic boundary rather than being routinely exported.

Part XXXVII — TPM Versus HSM

119. Comparison

Both can protect cryptographic functions, but they serve different architectural purposes.

Part XXXVIII — Cryptoperiod

120. What Is a Cryptoperiod?

A cryptoperiod is the period during which a cryptographic key is authorized for use.

Keys should not necessarily remain active indefinitely.

121. Why Rotate Keys?

Rotation can limit:

• exposure duration;

• amount of information protected by one key;

• consequences of compromise.

122. Cryptoperiod Factors

Appropriate cryptoperiod depends on:

• key purpose;

• algorithm;

• information sensitivity;

• transaction volume;

• threat environment;

• organizational requirements.

Part XXXIX — Key Rotation

123. Key Rotation

Key rotation replaces an active key with a new key.

Conceptually:

KEY K1

  │

Active period

  │

  ▼

ROTATE

  │

  ▼

KEY K2

Old information may still need decryption using appropriately retained historical keys.

Part XL — Key Revocation

124. Revocation

Revocation invalidates keying credentials before their normal expiration.

Reasons may include:

• private-key compromise;

• employee departure;

• device theft;

• certificate compromise.

125. Compromised Key Response

SUSPECTED KEY COMPROMISE

          │

          ▼

CONFIRM / ASSESS

          │

          ▼

REVOKE / DISABLE

          │

          ▼

REPLACE KEY

          │

          ▼

RE-ESTABLISH TRUST

          │

          ▼

ASSESS DATA / TRANSACTION IMPACT

Part XLI — Key Backup and Recovery

126. Key Recovery

Some encryption keys may require controlled recovery capability.

Without appropriate recovery:

Losing the key may make encrypted business information permanently inaccessible.

127. But Not Every Private Key Should Be Recoverable

A private digital-signature key has different security implications from an encryption key.

If signing keys can be freely recovered and used by others, accountability and nonrepudiation may be weakened.

128. Exam Principle

Ask:

What is the key used for?

Key-management policy should reflect the key's function.

Part XLII — Key Escrow

129. Key Escrow

Key escrow places recoverable keying material under controlled custody so authorized recovery can occur.

Possible uses include:

• business continuity;

• lawful organizational recovery;

• employee departure.

130. Escrow Risk

Key escrow also creates a high-value target.

The escrow mechanism must itself receive strong protection.

Part XLIII — Split Knowledge

131. Split Knowledge

Split knowledge divides sensitive key information so no single individual possesses the entire secret.

Example:

KEY MATERIAL



PART A → PERSON A

PART B → PERSON B

Both parts may be required for recovery or activation.

132. Why Split Knowledge Matters

It reduces the risk of:

• insider abuse;

• single-person compromise.

Part XLIV — Dual Control

133. Dual Control

Dual control requires two or more authorized individuals to participate in a sensitive cryptographic operation.

Example:

Two security officers must authorize activation of a master encryption key.

134. Split Knowledge Versus Dual Control

They can be used together.

Part XLV — Key Destruction

135. Key Destruction

When a key is no longer required, it should be securely destroyed according to:

• retention requirements;

• legal needs;

• archival requirements;

• operational requirements.

136. Cryptographic Erase

If information is strongly encrypted and all required copies of the relevant keying material are securely destroyed, the ciphertext may become computationally inaccessible.

This technique depends heavily on correct:

• encryption;

• key architecture;

• key destruction.

Part XLVI — Key-Management Program

137. Key Management Is Governance + Technology

NIST SP 800-57 emphasizes that cryptographic protection requires appropriate management of keying material throughout its lifecycle, including protection, use, compromise handling, and other organizational considerations.

A mature program may include:

• cryptographic policy;

• approved algorithms;

• key inventories;

• owners;

• HSMs;

• recovery;

• rotation;

• auditing;

• retirement.

Part XLVII — Cryptographic Agility

138. What Is Crypto Agility?

Cryptographic agility is the ability to replace or modify cryptographic:

• algorithms;

• key sizes;

• protocols;

• certificates;

without redesigning the entire enterprise.

139. Why Agility Matters

Algorithms eventually become:

• weak;

• deprecated;

• incompatible;

• threatened by new computing capabilities.

Hard-coding one algorithm everywhere creates migration difficulty.

140. Poor Architecture

APPLICATION

   │

   └── Hard-coded old algorithm

          │

          ▼

      Cannot change without

      complete rewrite

141. Better Architecture

APPLICATION

     │

     ▼

CRYPTOGRAPHIC ABSTRACTION

     │

     ├── Current Algorithm

     ├── New Algorithm

     └── Future Algorithm

Part XLVIII — Cryptographic Inventory

142. Know Where Cryptography Is Used

Organizations preparing for algorithm transitions need to know:

• where keys exist;

• which algorithms are used;

• which certificates exist;

• which protocols depend on them;

• which vendors embed them.

This is sometimes referred to as cryptographic discovery or inventory.

143. Why Inventory Matters

You cannot efficiently replace vulnerable cryptography if you do not know:

Where it exists.

This principle is especially important for post-quantum migration.

Part XLIX — Quantum Computing and Cryptography

144. Why Quantum Computing Matters

Large fault-tolerant quantum computers could threaten important traditional public-key cryptographic approaches.

This creates long-term risk for systems relying on:

• integer-factorization security;

• discrete-logarithm security;

• elliptic-curve discrete-logarithm security.

145. Symmetric Cryptography and Quantum Risk

Quantum computing also affects symmetric cryptography differently.

The practical security impact is generally less catastrophic than for vulnerable traditional public-key algorithms when adequate symmetric key sizes are used.

For CISSP:

Do not assume quantum computing breaks every cryptographic algorithm in the same way.

Part L — Harvest Now, Decrypt Later

146. Long-Term Confidentiality Risk

An attacker may collect encrypted information today and retain it for future decryption if technology later improves sufficiently.

This is often described conceptually as:

Harvest Now, Decrypt Later

It is especially relevant when information must remain confidential for many years.

Part LI — Post-Quantum Cryptography

147. What Is Post-Quantum Cryptography?

Post-quantum cryptography uses algorithms designed to resist attacks from both:

• conventional computers;

• future sufficiently capable quantum computers.

These algorithms run on conventional computing platforms.

148. Current NIST PQC Standards

NIST published its first three finalized post-quantum cryptography standards on August 13, 2024:

• FIPS 203 — ML-KEM

• FIPS 204 — ML-DSA

• FIPS 205 — SLH-DSA.

149. ML-KEM

ML-KEM stands for:

Module-Lattice-Based Key-Encapsulation Mechanism

Its purpose is key establishment.

At CISSP level:

ML-KEM → Post-quantum key establishment

150. ML-DSA

ML-DSA stands for:

Module-Lattice-Based Digital Signature Algorithm

At CISSP level:

ML-DSA → Post-quantum digital signatures

151. SLH-DSA

SLH-DSA is a stateless hash-based digital-signature standard.

At CISSP level:

SLH-DSA → Post-quantum hash-based signatures

152. PQC Quick Table

NIST continues additional post-quantum standardization work beyond these initial standards.

153. CISSP PQC Principle

Candidates should understand:

Organizations must eventually migrate cryptographic systems, inventories, protocols, certificates, and applications—not simply install one “quantum security product.”

Part LII — Quantum Key Distribution

154. QKD

Quantum Key Distribution uses quantum-physics properties to assist parties in establishing or distributing secret keying material.

The current CISSP outline explicitly includes quantum key distribution as an example under PKI-related cryptographic solutions.

155. PQC Versus QKD

These are different concepts.

Do not use the terms interchangeably.

Part LIII — Public Key Infrastructure Introduction

156. What Is PKI?

Public Key Infrastructure is the system of:

• technologies;

• policies;

• procedures;

• roles;

• certificates;

• trust relationships

used to manage public-key identities and certificates.

157. PKI Problem

Suppose you receive this public key:

PUBLIC KEY X

How do you know it actually belongs to:

Bank A

and not:

an attacker impersonating Bank A?

PKI helps bind public keys to identities.

158. Digital Certificate

A digital certificate associates a public key with information about an identity or entity.

Conceptually:

┌─────────────────────────────┐

│ DIGITAL CERTIFICATE         │

│                             │

│ Subject: Example Bank       │

│ Public Key: XXXXX           │

│ Issuer: Trusted CA          │

│ Validity: ...               │

│ Signature: CA Signature     │

└─────────────────────────────┘

159. Certificate Authority

A Certificate Authority, or CA, is a trusted entity that issues and signs certificates according to its policies and procedures.

160. Trust Chain Preview

ROOT CA

   │

   ▼

INTERMEDIATE CA

   │

   ▼

SERVER CERTIFICATE

Detailed PKI architecture, certificate validation, revocation, CRLs, OCSP, and trust chains are covered in Lesson Eleven.

Part LIV — Cryptographic Solution Selection

161. Start With the Security Requirement

Do not begin with:

“Which algorithm do I like?”

Begin with:

What security property is required?

162. Requirement Matrix

163. SierraTec Secure CRYPTO Decision Model

Use the CRYPTO model when selecting cryptographic solutions.

C — Clarify the Security Objective

Confidentiality? Integrity? Authentication? Signature?

R — Review the Data and Lifespan

How sensitive is it? How long must protection last?

Y — Yield the Correct Cryptographic Method

Symmetric? Asymmetric? Hash? MAC? Signature?

P — Protect the Keys

How will keys be generated, stored, rotated, recovered, and destroyed?

T — Test the Implementation

Is the implementation secure and interoperable?

O — Observe and Update

Monitor algorithm strength and maintain cryptographic agility.

164. CRYPTO Diagram

C

CLARIFY OBJECTIVE

      │

      ▼

R

REVIEW DATA / LIFESPAN

      │

      ▼

Y

YIELD APPROPRIATE METHOD

      │

      ▼

P

PROTECT KEYS

      │

      ▼

T

TEST IMPLEMENTATION

      │

      ▼

O

OBSERVE & UPDATE

Part LV — Worked Cryptographic Scenarios

165. Scenario 1 — Large Database

An organization needs to encrypt several terabytes of stored database information efficiently.

Which cryptographic method is MOST appropriate for bulk encryption?

A. Symmetric encryption such as AES
B. Digital signatures only
C. Hashing only
D. Certificate revocation

Correct Answer

A

Symmetric encryption is efficient for large volumes of data.

166. Scenario 2 — File Integrity

A security analyst needs to determine whether a downloaded file changed during transfer.

Which mechanism is MOST directly appropriate?

A. Cryptographic hash
B. Symmetric encryption only
C. Key escrow
D. Data classification

Correct Answer

A

167. Scenario 3 — Message Authentication

Two systems share a secret key and need assurance that messages have not been modified and came from a party holding that secret.

Which mechanism BEST meets the requirement?

A. HMAC
B. Plain hash only
C. ECB
D. Data masking

Correct Answer

A

168. Scenario 4 — Digital Signature

A company needs to demonstrate that a particular executive digitally approved a document and that the document has not changed.

Which mechanism is MOST appropriate?

A. Digital signature
B. AES encryption only
C. Plain hashing only
D. Tokenization

Correct Answer

A

169. Scenario 5 — Confidentiality and Signature

Alice must send Bob a confidential contract that Bob can verify was signed by Alice.

What combination is required?

A. Appropriate encryption plus digital signature
B. Hash alone
C. DLP alone
D. RAID

Correct Answer

A

170. Scenario 6 — Shared Secret Establishment

Two systems need to establish shared secret keying material over an untrusted network.

Which method is MOST directly associated with this need?

A. Key agreement
B. Data masking
C. File deletion
D. DLP

Correct Answer

A

171. Scenario 7 — Key Compromise

A private signing key is believed to be compromised.

What should happen FIRST under an established cryptographic response process?

A. Continue using the key indefinitely.

B. Initiate compromise response and revoke or disable the affected credential/key as appropriate.

C. Publish the private key.

D. Convert it to a password.

Correct Answer

B

172. Scenario 8 — Symmetric Key Loss

A company encrypts all archived financial records with one key but has no protected recovery capability.

The key is accidentally destroyed.

What is the PRIMARY impact?

A. Encrypted information may become permanently inaccessible.

B. Confidentiality automatically fails.

C. The data becomes public.

D. The algorithm becomes asymmetric.

Correct Answer

A

173. Scenario 9 — Algorithm Migration

A company has thousands of applications with one obsolete algorithm hard-coded into source code.

Which architectural capability was MOST clearly missing?

A. Cryptographic agility
B. Data classification
C. Separation of duties
D. Business continuity testing

Correct Answer

A

174. Scenario 10 — Quantum Migration

An organization has information that must remain confidential for several decades.

What should security leadership increasingly consider?

A. Long-term cryptographic transition and post-quantum readiness.

B. Eliminating encryption.

C. Using DES.

D. Publishing all keys.

Correct Answer

A

NIST's standardized PQC algorithms now provide concrete migration targets for post-quantum key establishment and digital signatures.

Part LVI — Common CISSP Exam Traps

175. Trap — Hashing Is Encryption

No.

Hashing is intended to be one way.

Encryption is designed to be reversible with appropriate keying material.

176. Trap — Digital Signature Provides Confidentiality

Not by itself.

A signature supports:

• integrity;

• authenticity;

• nonrepudiation.

Encryption is required when confidentiality is also needed.

177. Trap — Public Key Must Be Secret

No.

The:

Private key

requires protection.

178. Trap — Symmetric Encryption Uses Public and Private Keys

No.

Symmetric encryption uses shared secret keying material.

179. Trap — Asymmetric Encryption Is Best for All Bulk Data

Generally no.

Symmetric cryptography is much more practical for large-volume data encryption.

Hybrid approaches combine the strengths of both.

180. Trap — Diffie-Hellman Encrypts the Whole Message

Diffie-Hellman is primarily associated with:

Key Agreement

181. Trap — Salt Is an Encryption Key

A salt is not a secret encryption key.

It helps strengthen password-hashing defenses against precomputed attacks.

182. Trap — ECB Is Fine Because the Data Is Encrypted

ECB may reveal structural patterns.

Encrypted does not automatically mean securely designed.

183. Trap — Encryption Automatically Provides Integrity

Not necessarily.

Use appropriate:

• authenticated encryption;

• MAC;

• digital-signature mechanisms

when integrity/authentication is required.

184. Trap — Key Rotation Fixes a Previously Exposed Key

If a key has already been compromised, merely waiting for normal rotation may be insufficient.

Compromise requires appropriate revocation and response.

185. Trap — Strong Algorithm Means Secure System

Weak:

• key generation;

• storage;

• implementation;

• protocols

can defeat strong algorithms.

186. Trap — HSM and TPM Are the Same

They can both protect cryptographic functions, but they have different architectural roles.

187. Trap — PQC Means Quantum Computers Perform the Encryption

No.

Post-quantum algorithms are designed to run on conventional computing systems while resisting known quantum attack approaches.

188. Trap — PQC and QKD Are the Same

No.

PQC is algorithmic.

QKD uses quantum communication principles.

Part LVII — Knowledge Check

189. Knowledge Check

Question 1

What security objective does encryption primarily provide?

A. Confidentiality
B. Availability
C. Retention
D. Physical security

Correct Answer

A

Question 2

Which type of cryptography uses shared secret keying material?

A. Symmetric
B. Asymmetric
C. Hashing
D. Digital certificate

Correct Answer

A

Question 3

Which algorithm is a modern symmetric block cipher?

A. AES
B. RSA
C. Diffie-Hellman
D. SHA-256

Correct Answer

A

Question 4

Which mode is especially known for leaking plaintext patterns?

A. ECB
B. GCM
C. CTR
D. CBC

Correct Answer

A

Question 5

Which mode is strongly associated with authenticated encryption?

A. GCM
B. ECB
C. DES
D. RSA

Correct Answer

A

Question 6

What is the primary challenge of symmetric cryptography?

A. Secure key distribution/management
B. No ability to encrypt data
C. No algorithms exist
D. It requires a certificate authority for every operation

Correct Answer

A

Question 7

Which key must be protected in an asymmetric key pair?

A. Private key
B. Public key only
C. Certificate serial number
D. Username

Correct Answer

A

Question 8

Which is primarily a key-agreement concept?

A. Diffie-Hellman
B. AES
C. SHA-256
D. DLP

Correct Answer

A

Question 9

Which is an asymmetric cryptographic family?

A. RSA
B. AES
C. GCM
D. SHA-2

Correct Answer

A

Question 10

Which technique produces a fixed-size digest?

A. Cryptographic hashing
B. Symmetric encryption
C. Tokenization
D. Data masking

Correct Answer

A

Question 11

Which property describes difficulty in finding two different inputs producing the same hash?

A. Collision resistance
B. Availability
C. Key escrow
D. Nonce reuse

Correct Answer

A

Question 12

Which construction combines a hash function with secret keying material for message authentication?

A. HMAC
B. ECB
C. RSA encryption
D. Tokenization

Correct Answer

A

Question 13

Which key is normally used by the signer to create a digital signature?

A. Signer's private key
B. Signer's public key
C. Recipient's private key
D. Shared symmetric key only

Correct Answer

A

Question 14

Which key is used to verify a signer's digital signature?

A. Signer's public key
B. Signer's private key
C. Recipient's password
D. Data-encryption key

Correct Answer

A

Question 15

What is a cryptoperiod?

A. Authorized lifetime/use period of cryptographic keying material
B. Length of plaintext
C. Network timeout
D. Certificate authority name

Correct Answer

A

Question 16

Which control divides knowledge of sensitive keying material among participants?

A. Split knowledge
B. ECB
C. Data masking
D. RAID

Correct Answer

A

Question 17

Which principle requires multiple people to participate in a sensitive key operation?

A. Dual control
B. Hashing
C. Data minimization
D. Availability

Correct Answer

A

Question 18

What is cryptographic agility?

A. Ability to replace cryptographic algorithms and mechanisms without complete system redesign.

B. Ability to encrypt without keys.

C. Ability to make every algorithm secret.

D. Ability to prevent every cryptographic attack.

Correct Answer

A

Question 19

Which current NIST standard specifies ML-KEM?

A. FIPS 203
B. FIPS 204
C. FIPS 205
D. FIPS 140

Correct Answer

A

Question 20

Which statement is MOST accurate?

A. Post-quantum cryptography and quantum key distribution are identical.

B. PQC uses quantum computers to encrypt every message.

C. PQC uses algorithms designed to resist quantum attacks; QKD uses quantum communication principles for key distribution.

D. Quantum computing affects no cryptographic systems.

Correct Answer

C

Part LVIII — Original CISSP-Style Scenario Practice

190. Practice Question 1

A company must encrypt a large backup archive as efficiently as possible.

Which choice is BEST?

A. Strong symmetric encryption
B. Digital signature alone
C. Hash alone
D. Certificate alone

Correct Answer

A

191. Practice Question 2

A software vendor publishes a file and wants customers to detect accidental modification but does not need confidentiality.

Which mechanism MOST directly addresses integrity?

A. Cryptographic hash
B. Encryption only
C. Tokenization
D. RAID

Correct Answer

A

192. Practice Question 3

A bank must verify that a payment instruction came from a known system sharing a secret key and was not modified.

Which mechanism BEST fits?

A. MAC/HMAC
B. Plain hash only
C. DES in ECB
D. Data masking

Correct Answer

A

193. Practice Question 4

A company wants its customers to verify that software updates genuinely originated from the company and were not modified.

Which mechanism is MOST appropriate?

A. Digital signatures
B. Symmetric encryption alone
C. Disk encryption
D. Data retention

Correct Answer

A

194. Practice Question 5

A development team stores an encryption key directly inside publicly accessible source code.

What is the GREATEST concern?

A. Key-management failure
B. Excessive availability
C. Strong integrity
D. Appropriate cryptoperiod

Correct Answer

A

195. Practice Question 6

A highly sensitive encryption key must be activated only when two security officers participate.

Which principle is MOST directly demonstrated?

A. Dual control
B. Data minimization
C. Noninterference
D. Risk transfer

Correct Answer

A

196. Practice Question 7

A master cryptographic secret is divided so two different custodians each hold only part.

Which concept is demonstrated?

A. Split knowledge
B. Dual encryption
C. Hash collision
D. ECB

Correct Answer

A

197. Practice Question 8

A certificate signing private key must receive extremely strong protection and perform cryptographic operations without routinely leaving its protected environment.

Which technology is MOST appropriate?

A. HSM
B. DLP
C. CASB
D. RAID

Correct Answer

A

198. Practice Question 9

A company learns that one of its approved cryptographic algorithms will soon become unacceptable, but applications cannot change algorithms without complete rewrites.

What design weakness is MOST apparent?

A. Lack of cryptographic agility
B. Excessive hashing
C. Too many certificates
D. Data remanence

Correct Answer

A

199. Practice Question 10

A security architect is planning long-term protection for information that must remain confidential for 30 years.

Which consideration is increasingly important?

A. Post-quantum migration planning
B. Adopting DES
C. Disabling key rotation
D. Publishing private keys

Correct Answer

A

Part LIX — Cryptography Comparison Table

200. Major Mechanisms

Part LX — Algorithm Memory Table

201. Know the Association

Part LXI — Key Management Memory Table

202. Key Lifecycle

NIST's key-management guidance treats cryptographic keying material as requiring protection and management throughout the full lifecycle rather than only at the moment of generation.

Part LXII — Key Terms

203. Key Terms

Cryptography

Mathematical techniques used to protect information and communications.

Plaintext

Original readable information.

Ciphertext

Encrypted form of information.

Encryption

Transformation of plaintext into ciphertext.

Decryption

Transformation of ciphertext back into plaintext using appropriate keying material.

Algorithm

Mathematical procedure used for cryptographic operations.

Cryptographic Key

Value controlling a cryptographic operation.

Symmetric Cryptography

Cryptography using shared secret keying material.

Asymmetric Cryptography

Cryptography using mathematically related public and private keys.

AES

Modern symmetric block cipher.

RSA

Classic asymmetric cryptographic family.

Diffie-Hellman

Key-agreement mechanism.

ECC

Elliptic-Curve Cryptography.

Hash Function

One-way function producing a fixed-size digest.

Collision

Two different inputs producing the same hash output.

Salt

Unique value incorporated into password hashing to reduce effectiveness of precomputed attacks.

MAC

Message Authentication Code.

HMAC

Hash-based Message Authentication Code.

Digital Signature

Asymmetric mechanism supporting integrity, authenticity, and nonrepudiation.

Initialization Vector

Initial input used by certain cryptographic modes.

Nonce

Value used according to a protocol's uniqueness requirements.

ECB

Electronic Codebook mode; encrypts blocks independently.

CBC

Cipher Block Chaining mode.

CTR

Counter mode.

GCM

Galois/Counter Mode; authenticated-encryption mode.

AEAD

Authenticated Encryption with Associated Data.

Cryptoperiod

Authorized period of cryptographic-key use.

Key Escrow

Controlled storage enabling authorized key recovery.

Split Knowledge

Dividing sensitive secret information among multiple parties.

Dual Control

Requiring multiple authorized participants for a sensitive operation.

HSM

Hardware Security Module.

Cryptographic Agility

Ability to replace cryptographic algorithms or mechanisms with manageable system changes.

PKI

Public Key Infrastructure.

Digital Certificate

Digitally signed structure binding a public key to identity or other information.

Certificate Authority

Trusted entity that issues and signs certificates.

Post-Quantum Cryptography

Cryptography designed to resist attacks by conventional and sufficiently capable quantum computers.

ML-KEM

NIST-standardized module-lattice key-encapsulation mechanism.

ML-DSA

NIST-standardized module-lattice digital-signature algorithm.

SLH-DSA

NIST-standardized stateless hash-based digital-signature algorithm.

Quantum Key Distribution

Key-distribution approach using quantum-physical properties.

Part LXIII — CISSP Exam Focus

204. Cryptographic Mindset

Remember:

SECURITY REQUIREMENT

        │

        ▼

CRYPTOGRAPHIC PROPERTY

        │

        ▼

ALGORITHM / METHOD

        │

        ▼

KEY MANAGEMENT

        │

        ▼

SECURE IMPLEMENTATION

        │

        ▼

MONITOR / ROTATE / RETIRE

For CISSP questions:

• Encryption primarily supports confidentiality.

• Hashing primarily supports integrity verification.

• A simple hash does not provide confidentiality.

• HMAC supports integrity and shared-secret authenticity.

• Digital signatures support integrity, authenticity, and nonrepudiation.

• Digital signatures do not automatically provide confidentiality.

• Symmetric encryption is efficient for bulk data.

• Asymmetric cryptography helps with authentication, signatures, and key establishment.

• AES is symmetric.

• RSA and ECC are asymmetric.

• Diffie-Hellman is primarily associated with key agreement.

• Hybrid systems combine asymmetric and symmetric methods.

• ECB exposes patterns.

• GCM provides authenticated encryption.

• IVs and nonces are not encryption keys.

• Nonce reuse can be dangerous.

• Public keys may be distributed.

• Private keys require strong protection.

• Key management can be more important than algorithm selection alone.

• A strong cipher with weak key management remains insecure.

• Key generation requires appropriate randomness.

• Cryptoperiods limit key-use duration.

• Compromised keys may require revocation rather than ordinary future rotation.

• Split knowledge divides secret information.

• Dual control divides authority over sensitive operations.

• HSMs protect high-value cryptographic operations and key material.

• TPMs and HSMs serve different architectural roles.

• Cryptographic agility helps organizations replace outdated algorithms.

• PQC is different from QKD.

• As of 2026, NIST's first three finalized PQC standards are FIPS 203, FIPS 204, and FIPS 205.

205. Lesson Summary

Lesson Ten established the cryptographic foundation necessary for security architecture and trusted communications.

The current CISSP examination requires candidates to select and determine cryptographic solutions, including cryptographic lifecycle considerations, keys and algorithm selection, symmetric and asymmetric techniques, elliptic curves, quantum-related methods, and PKI.

You learned that cryptography can support:

CONFIDENTIALITY

      │

INTEGRITY

      │

AUTHENTICITY

      │

NONREPUDIATION

You distinguished:

SYMMETRIC

    │

Shared secret

    │

Fast / bulk encryption

    │

Example: AES

from:

ASYMMETRIC

     │

Public + private key

     │

Signatures / authentication /

key establishment

     │

Examples: RSA / ECC

You examined hybrid cryptography:

ASYMMETRIC MECHANISM

        │

        ▼

SESSION KEY ESTABLISHED

        │

        ▼

SYMMETRIC ENCRYPTION

        │

        ▼

HIGH-SPEED PROTECTED DATA

You studied cryptographic hashes, HMAC, digital signatures, operating modes, initialization values, nonces, and authenticated encryption.

Most importantly, you learned that cryptography does not end with algorithm selection.

A cryptographic key moves through a lifecycle:

GENERATE

   ↓

DISTRIBUTE / ESTABLISH

   ↓

STORE

   ↓

USE

   ↓

ROTATE

   ↓

REVOKE

   ↓

RECOVER / ARCHIVE

   ↓

DESTROY

NIST SP 800-57 Part 1 Rev. 5 remains a core final reference for general cryptographic key-management principles, while NIST has also been developing Revision 6 to update that guidance.

You also examined the changing cryptographic environment created by quantum computing.

NIST's finalized post-quantum standards now include:

• FIPS 203 — ML-KEM;

• FIPS 204 — ML-DSA;

• FIPS 205 — SLH-DSA.

The most important Lesson Ten principle is:

Cryptography is not simply encryption. Effective cryptographic security requires choosing the correct mechanism for the security objective, protecting cryptographic keys throughout their lifecycle, implementing the solution correctly, and remaining capable of replacing cryptography as threats and standards evolve.

Exam Readiness Check

Before proceeding to Lesson Eleven, make sure you can explain without reviewing the lesson:

• What cryptography is.

• What plaintext is.

• What ciphertext is.

• What encryption does.

• What decryption does.

• The difference between an algorithm and a key.

• Why key secrecy is normally more important than algorithm secrecy.

• Why randomness matters.

• What entropy means.

• What symmetric cryptography is.

• Why symmetric encryption is efficient.

• The symmetric-key distribution problem.

• What AES is.

• Why DES is obsolete.

• Why 3DES is treated as legacy.

• The difference between block and stream ciphers.

• Why operating modes are necessary for block ciphers.

• Why ECB is generally undesirable.

• What CBC does conceptually.

• What CTR does conceptually.

• What GCM provides.

• What authenticated encryption means.

• What AEAD means.

• The difference between an IV and an encryption key.

• What a nonce is.

• What asymmetric cryptography is.

• The difference between a public and private key.

• What RSA is.

• What Diffie-Hellman does.

• What ECC is.

• Why hybrid cryptography is common.

• What a hash function does.

• Why hashing differs from encryption.

• What collision resistance means.

• What preimage resistance means.

• Why salts are used in password storage.

• What a MAC does.

• What HMAC does.

• What a digital signature provides.

• Which key creates a digital signature.

• Which key verifies a digital signature.

• Why signatures do not automatically provide confidentiality.

• What the cryptographic key lifecycle contains.

• What key generation requires.

• What key distribution and establishment mean.

• Why key storage matters.

• What an HSM does.

• How a TPM differs from an HSM.

• What a cryptoperiod is.

• What key rotation means.

• What key revocation means.

• What key escrow means.

• What split knowledge means.

• What dual control means.

• Why signing-key recovery has different implications from encryption-key recovery.

• What cryptographic agility means.

• Why cryptographic inventory matters.

• Why quantum computing affects long-term cryptographic planning.

• What post-quantum cryptography means.

• What ML-KEM does.

• What ML-DSA does.

• What SLH-DSA does.

• How PQC differs from QKD.

• What PKI does at a foundational level.

Coming Next

Lesson Eleven: Cryptographic Attacks and Public Key Infrastructure

Lesson Eleven will combine two closely related areas:

Part One — Cryptanalytic Attacks

The current CISSP Objective 3.7 explicitly includes:

• brute-force attacks;

• ciphertext-only attacks;

• known-plaintext attacks;

• frequency analysis;

• chosen-ciphertext attacks;

• implementation attacks;

• side-channel attacks;

• fault injection;

• timing attacks;

• man-in-the-middle attacks;

• pass-the-hash;

• Kerberos exploitation;

• ransomware.

We will examine how those attacks affect cryptographic design and protocol trust.

Part Two — Public Key Infrastructure

The lesson will then expand:

• digital certificates;

• X.509 concepts;

• Certificate Authorities;

• Registration Authorities;

• root CAs;

• intermediate CAs;

• certificate chains;

• trust anchors;

• certificate signing requests;

• certificate issuance;

• certificate validation;

• certificate expiration;

• certificate revocation;

• Certificate Revocation Lists;

• Online Certificate Status Protocol;

• certificate pinning;

• key compromise;

• digital-signature validation;

• PKI trust models;

• enterprise certificate management;

• PKI failure scenarios;

• original CISSP-style questions.

The central Lesson Eleven question will be:

How can cryptographic trust fail—and how does PKI establish, validate, revoke, and maintain trust in public keys and digital identities?

Publication and Independence Notice

This lesson is independently developed educational material for the SierraTec Secure CISSP Certification Preparation Course.

CISSP is administered by ISC2. SierraTec Secure's course is independent certification-preparation material and should not be represented as official ISC2 training unless separately authorized.

The current exam alignment was verified against the ISC2 CISSP Certification Exam Outline. Objective 3.6 currently covers the cryptographic lifecycle, algorithm selection, symmetric and asymmetric methods, elliptic curves, quantum-related methods, PKI, and quantum key distribution. Objective 3.7 covers cryptanalytic attack methods.

Cryptographic-key-management concepts were aligned with NIST SP 800-57 Part 1 Rev. 5, which provides general guidance on cryptographic keying material, algorithms, key types, protection, management functions, and lifecycle considerations.

The post-quantum section reflects NIST's published FIPS 203, FIPS 204, and FIPS 205 standards and current 2026 NIST PQC information.

The SierraTec Secure CRYPTO model, diagrams, tables, worked examples, knowledge checks, scenarios, and practice questions are original instructional material and are not actual, recalled, leaked, or official CISSP examination questions.