Which of the following MOST significantly limits a hacker's ability to use brute force attacks to compromise an encryption scheme?

Question

Options

• AMathematical algorithms
• BEncryption keys
• CStatistical properties
• DRandomness of key generation

• A
  11% (5)
• B
  7% (3)
• C
  5% (2)
• D
  77% (34)

Explanation

Randomness of key generation is correct because brute force attacks succeed by exploiting predictability - if keys are generated with high entropy (true randomness), attackers cannot narrow the search space and must try every possible combination, making the attack computationally infeasible. Weak or predictable key generation (low entropy) collapses the effective keyspace, allowing attackers to focus on likely keys rather than all possible ones.

Why the distractors fall short:

• A (Mathematical algorithms) - Algorithms like AES are publicly known (Kerckhoffs's principle); security was never meant to rely on algorithm secrecy, and they don't specifically resist brute force.
• B (Encryption keys) - Keys are what the attacker is guessing; having keys doesn't limit brute force - how those keys are generated does. Key length matters, but that's a property of randomness and keyspace size, not keys in isolation.
• C (Statistical properties) - These properties (e.g., frequency analysis resistance) defend against classical or analytical attacks, not exhaustive key-search attacks.

Memory tip: Picture a combination lock - if someone knows you always pick birthdays, they can crack it fast. True randomness means no shortcuts exist, forcing a full exhaustive search. When you see "brute force + limits," think entropy/randomness, not the algorithm or the key object itself.

No community discussion yet for this question.