What do most attacks on hash functions involve?%0D%0A%0D%0AA. Finding Collisions%0D%0AB. Pre-generating millions of hashes and comparing them to the plain text that generates it. %0D%0AC. Really good random guessing.%0D%0A%0D%0A(2 points)%0D%0AResponses%0D%0A%0D%0AA and B%0D%0AA and B%0D%0A%0D%0AA and C%0D%0AA and C%0D%0A%0D%0AB and C
A. Finding Collisions
Most attacks on hash functions involve finding collisions (A) and pre-generating millions of hashes and comparing them to the plain text that generates them (B). Therefore, the correct answer is A and B.
Most attacks on hash functions involve finding collisions, which means finding two different inputs that produce the same hash output. This is known as a collision attack.
However, it is also possible to attack hash functions by pre-generating millions of hashes and comparing them to the plaintext that generates it. This is known as a preimage attack.
As for really good random guessing (option C), it is not typically an effective strategy for attacking hash functions. Guessing the correct input that produces a specific hash output is extremely difficult due to the collision resistance property of hash functions.
Therefore, the correct answer would be A and B – most attacks on hash functions involve finding collisions (A) and pre-generating hashes to compare with plaintext (B). Option C is not a common attack method.