An exhaustive key search, also known as brute-force attack, involves systematically trying every possible key in the keyspace of a cipher until the correct key is found. The effectiveness of such an approach depends greatly on the size of the keyspace, which is determined by the number of possible keys, and the structure of the