Hash-Functions — CISSP Practice Questions
Hash functions are cryptographic algorithms that take an arbitrary-length input and produce a fixed-length output called a digest or hash, and are designed to be one-way and collision-resistant. The CISSP exam tests their role in verifying data integrity, storing passwords securely, constructing digital signatures, and building message authentication codes. Candidates should know the properties that make a hash function cryptographically secure, including pre-image resistance and collision resistance, as well as which algorithms are considered current versus deprecated. Understanding why unsalted hashes of passwords are vulnerable to precomputed table attacks is also an expected area of knowledge.
Free questions on hash-functions
Which cryptographic attack exploits the mathematical probability that two different inputs produce the same hash output?
Free question · medium · full answer + explanation