gen-define-key-length-and-brute-force-resistance-and-give-one-sh-cf94

Define key length and brute-force resistance and give one short worked example.

# Key Length and Brute-Force Resistance ## Definitions **Key Length**: The number of bits in a cryptographic key. It determines the total number of possible key combinations. **Brute-Force Resistance**: The computational difficulty of trying all possible keys to break encryption. Resistance increases exponentially with key length. ## Relationship For an n-bit key: - **Total possible keys** = 2^n - **Average attempts to find correct key** = 2^(n-1) ## Worked Example **Question**: Compare the brute-force resistance of a 56-bit key versus a 112-bit key. **Solution**: *56-bit key:* - Possible keys = 2^56 ≈ 7.2 × 10^16 keys *112-bit key:* - Possible keys = 2^112 ≈ 5.2 × 10^33 keys **Comparison**: - 2^112 / 2^56 = 2^56 ≈ 7.2 × 10^16 The 112-bit key is approximately **72 quadrillion times more resistant** to brute-force attack than the 56-bit key. **Practical implication**: If a computer could crack a 56-bit key in 1 second, the same computer would need about **2.3 billion years** to crack a 112-bit key. --- *Note: Doubling the key length squares the brute-force resistance.*