LESSON 15 / 30 · Protect and observe

Encryption, hashing, signatures and quantum-resistant cryptography

Choose a cryptographic purpose, then explain the trust and key assumptions.

FREE LESSONFICTIONAL WORKED EXAMPLE

After this lesson, try to

  • Distinguish encryption, hashing and signatures.
  • Explain hash resistance properties without promising uniqueness.
  • Describe post-quantum cryptography at introductory depth.

Match a mechanism to the need

Encryption transforms readable data so it can be recovered using the appropriate cryptographic process and key. Symmetric mechanisms use shared secret key material; asymmetric mechanisms use a related public/private key pair. The label “asymmetric” does not mean every algorithm can both encrypt and sign. Protection also depends on key management, implementation and the endpoints handling plaintext.

A hash is not a reversible cipher

For the fixed-output cryptographic hash functions considered here, a digest has the function’s specified output length. Collision resistance makes it difficult to find two different inputs with the same output; preimage resistance concerns finding an input for a given output; second-preimage resistance concerns finding another input matching a particular input’s digest. These are resistance properties, not a guarantee that all outputs are unique. A bare hash does not authenticate who supplied a file, and it is not a recoverable encrypted copy.

Signing and encryption have different purposes

A digital signature uses a private signing key and a corresponding public verification key to support integrity and origin evidence. Verification needs suitable trust in the public key’s binding and protection of the private key. A signature does not normally conceal the document, prove every claim inside it or guarantee a particular legal outcome. Do not generalize signing as “encrypting a hash with a private key”; signature schemes differ.

Keep quantum resistance at the right depth

Post-quantum cryptography addresses attacks using sufficiently capable future quantum computers. Not every primitive is affected in the same way. This introduction explains the purpose rather than supplying an algorithm-selection list or migration plan. Current algorithm approvals, key-size choices and deployment decisions require current authoritative guidance.

Make it your own.

For a fictional export, select encryption, a trustworthy digest comparison or a signature. State what each leaves unresolved.

Use fictional information. Writing an answer helps expose assumptions; this exercise is not independently marked.

Connect the terminology.

SCOPE, PRACTICE AND ACCESS

What to take further.

Coverage and remaining teaching

  • This site does not provide complete key lifecycle, PKI, certificate validation, authenticated encryption or migration teaching, or recommend current algorithms and key sizes from historical lists.

Practice and feedback

  • Use fresh mechanism-selection cases. A reviewed cryptography lab or independent full assessment is not provided.

Free and paid resources

These editorial lessons are free to read. Commercial CC teaching is optional; exam and credential-maintenance charges are separate. Confirm current issuer terms before paying.

A reading acknowledgement tracks your place; it does not establish competence or course completion.