Question

An __________________ attack is one that tries all possible values for some target object, like the key. If an attack requires 2²³⁵ steps of work, then this corresponds to an exhaustive search for a 235-bit value. A) Exponential attack

B) Brute-force attack

C) Incremental attack

D) Recursive attack

Answer 1

A brute-force attack tries all possible values to find the correct key and a requirement of 2^235 steps indicates a search for a 235-bit value.

Step-by-step explanation:

An attack that tries all possible values for some target object, like a key, is known as a brute-force attack. This type of attack systematically checks all possible keys until the correct one is found. The scenario described in the question, where an attack requires 2235 steps, indeed corresponds to an exhaustive search of a 235-bit value. This immense number of combinations signifies the sheer magnitude of possibilities a brute-force attempt must explore, illustrating why it's critical for encryption algorithms to use long keys for better security.