You are the Security Consultant and have been contacted by a client regarding their encryption and hashing algorithms. Their in-house network administrator tells you that their current hashing algorithm is an older one with known weaknesses and is not collision resistant.Which algorithm are they most likely using for hashing?

MD5 (Message Digest 5) is a widely used but now deprecated cryptographic hash function. Since the mid-2000s, it has been known to have severe cryptographic flaws, most notably its lack of collision resistance. Researchers have demonstrated practical methods to create two different inputs that produce the identical MD5 hash value. Due to these well-documented vulnerabilities, major standards bodies like NIST have disallowed its use for applications requiring collision resistance, such as digital signatures. Its profile as an older, broken, and non-collision-resistant algorithm makes it the most fitting answer.

A. PKI (Public Key Infrastructure) is a comprehensive system of hardware, software, and policies for managing digital certificates, not a hashing algorithm itself.
B. SHA (Secure Hash Algorithm) is a family of algorithms. While the older SHA-1 has known weaknesses, newer versions like SHA-2 and SHA-3 are considered secure.
C. Kerberos is a network authentication protocol used for client-server applications; it is not a hashing algorithm.

1. National Institute of Standards and Technology (NIST). (2019). Special Publication 800-131A Revision 2: Transitioning the Use of Cryptographic Algorithms and Key Lengths. Page 10

Table 2. This document explicitly lists MD5 as "Disallowed" for digital signature generation and "Legacy-use" for other applications

confirming its deprecated status due to known weaknesses.

2. Wang

X.

& Yu

H. (2005). How to Break MD5 and Other Hash Functions. In H. Gilbert (Ed.)

Advances in Cryptology - EUROCRYPT 2005 (Vol. 3494

pp. 19–35). Springer. This seminal academic paper provides the technical details of the collision attacks against MD5

establishing its lack of collision resistance. DOI: https://doi.org/10.1007/114266392

3. Rivest

R. (2014). Lecture 7: Hash Functions. MIT OpenCourseWare

6.857 Network and Computer Security

Spring 2014. The lecture notes discuss the history and properties of hash functions

specifically citing the 2004 collision attacks on MD5 by Wang et al. as a critical failure

leading to its deprecation.