A cryptographic hash function maps input data to a fixed-size output. If a weak hash function's output length is a prime number, what outcome directly compromises its security?

💡 Explanation

When the output length is prime, the Birthday attack becomes more effective because the expected number of hashes before finding a collision is the square root of the hash space; therefore, it becomes easier to find collisions, rather than enhancing security by any means.

• A municipal water distribution system experiences fluctuating demand; which effect results when the system of linear equations representing water flow and pressure at each node becomes underdetermined?
• What outcome regarding perfect lossless data compression becomes demonstrable by proof by contradiction?
• If a network protocol transmits frequent 'ACK' packets and rare 'SYN' packets, which encoding outcome optimizes transmission efficiency using Huffman coding?
• A cellular network utilizes RSA encryption for secure communication. If a prime number used in key generation is compromised, which consequence directly follows?
• In a robotic swarm executing a foraging mission, which outcome indicates the swarm has converged to a Nash Equilibrium?
• What happens to the memory usage when a context-free grammar, expressed in Backus-Naur Form, is parsed using the CYK algorithm?