Which statement about increasing key length on brute-force resistance is illustrated by extending from 43 to 50 bits?

Prepare for the Network Security (NETSEC) 3 Test with flashcards and multiple choice questions. Each question offers hints and explanations. Get exam-ready efficiently!

Multiple Choice

Which statement about increasing key length on brute-force resistance is illustrated by extending from 43 to 50 bits?

Explanation:
Increasing the key length boosts brute-force resistance because each additional bit doubles the number of possible keys. Extending from 43 to 50 bits adds seven bits, so the total key space grows from 2^43 to 2^50, a factor of 2^7 (128) more possibilities. Since a brute-force attack must try keys until it finds the correct one, the expected time to crack rises roughly by a factor of 128 under the same testing rate. This makes cracking significantly harder, though not impossible with enough time or massive parallel resources. The other options don’t fit because the brute-force effort would not shorten, would not remain unchanged, and it’s not rendered entirely crackproof just by this increase.

Increasing the key length boosts brute-force resistance because each additional bit doubles the number of possible keys. Extending from 43 to 50 bits adds seven bits, so the total key space grows from 2^43 to 2^50, a factor of 2^7 (128) more possibilities. Since a brute-force attack must try keys until it finds the correct one, the expected time to crack rises roughly by a factor of 128 under the same testing rate. This makes cracking significantly harder, though not impossible with enough time or massive parallel resources. The other options don’t fit because the brute-force effort would not shorten, would not remain unchanged, and it’s not rendered entirely crackproof just by this increase.

Subscribe

Get the latest from Passetra

You can unsubscribe at any time. Read our privacy policy