A. Finding Collisions B. Pre-generating millions of hashes and comparing them to the plain text that generates it. C. Really good random guessing. (2 points) O A and B O A and C O B and C

To determine which options are correct, let's analyze each option in the context of finding collisions in hashing: A. **Finding Collisions**: This refers to the process of identifying two different inputs that produce the same hash output. This is a fundamental concern in cryptography, as it can undermine the integrity of a hash function. B. **Pre-generating millions of hashes and comparing them to the plain text that generates it**: This method is known as a rainbow table attack. It involves creating a large database of precomputed hashes for various inputs and then comparing them to find matches. This is a direct method of finding collisions. C. **Really good random guessing**: This implies attempting to guess the input that produces a specific hash output. While it may lead to finding a collision, it is not a systematic or efficient method compared to the other two options. Now, let's evaluate the combinations: - **A and B**: Both involve systematic methods to find collisions. This combination is valid. - **A and C**: While A is about finding collisions, C is more about guessing rather than a systematic approach. This combination is less valid. - **B and C**: B is a systematic approach, while C is random guessing. This combination is also less valid. Based on this analysis, the best answer is: **O A and B**