An application engineer who tries to design a new cipher, a new hash construction, or a novel way of combining existing primitives is not being ambitious — they are recreating decades of published cryptanalysis with none of the review that caught the flaws in every serious cryptographer's early drafts too. The skill this lesson actually teaches is narrower and more useful than "understand cryptography": recognize which of a small number of vetted, off-the-shelf constructions solves the problem in front of you, and use it correctly, because correct use of a vetted primitive is where nearly all real-world cryptographic failures actually happen — not in the primitive itself.
This lesson is deliberately a menu, not a mathematics course. For integrity, you reach for a cryptographic hash. For proving a message came from someone holding a shared secret and wasn't altered in transit, you reach for an HMAC — a construction this course has already used repeatedly for webhook and CSRF verification, precisely because it is the vetted answer to that exact problem. For storing a password, you reach for a slow, adaptive key-derivation function, never a fast general-purpose hash. For encrypting data such that both confidentiality and integrity are guaranteed together, you reach for an authenticated encryption construction. None of these choices require you to understand the number theory underneath them to use correctly — they require you to know which one answers which question.
The recurring failure this lesson exists to prevent is a fast general-purpose hash (MD5, SHA-256 alone) being reached for as if it were a password-storage function, or a raw block cipher being used without the authentication that catches tampering — both are cases of a real, sound primitive being misapplied to a job it was never designed for, which is a use error, not a flaw in the primitive.