CISSP 6.2 - Modern Cryptography (Part 2 of 2)

This episode of the ISC2 Certified Information Systems Security Professional (CISSP) exam prep series continues Domain 3’s tour of modern cryptography, turning to the systems that solve symmetric encryption’s biggest problems. It explores how key pairs cooperate behind every secure connection, what makes those systems easy to grow, and the supporting technique that guards data against tampering.

Frequently Asked Questions

How do public and private key pairs work?

Each person holds two mathematically linked keys: one public, freely shared with anyone, and one private, guarded and known only to its owner. The pair works in opposite directions — whatever the public key locks, only the matching private key can open, and the reverse holds too. So if you encrypt a message with someone’s public key, only they can read it.

Why does asymmetric encryption scale so gracefully?

Because adding a person costs almost nothing. Where symmetric systems need a separate key for every unique pair of people, each new asymmetric user generates just one key pair and can then talk to everyone in the system with it. Removing someone is just as clean — you simply revoke and cancel their keys without disturbing anyone else.

What extra powers does asymmetric encryption unlock?

Because a private key belongs to exactly one person, it enables digital signatures. To sign, you create a compact fingerprint of your message and encrypt that fingerprint with your private key, and anyone can then use your public key to verify it truly came from you and was not altered. This single mechanism can provide confidentiality, integrity, authentication, and nonrepudiation together, and two strangers can begin communicating securely with no prior shared secret at all.

What is asymmetric encryption’s one big drawback?

Speed. Public key operations are far slower than symmetric ones, sometimes by thousands of times, which makes asymmetric encryption a poor choice for encrypting large volumes of data directly. In practice we use hybrid cryptography: the slow but convenient asymmetric method sets up the connection and exchanges a shared symmetric key, then fast symmetric encryption carries the bulk of the conversation.

What does a hashing algorithm actually give us?

It produces a fixed-length fingerprint of any input, called a message digest. You cannot run it backward to recover the original, and it is extraordinarily unlikely that two different inputs produce the same digest — when two do collide, that signals the algorithm is weakening and should be retired. Hashing powers integrity checks and, paired with signatures, nonrepudiation.

Reference: This article is based on concepts discussed in CISSP 6.2 - Modern Cryptography (Part 2 of 2).