Among methods of breaking a cipher, exhaustive key search stands out as the most successful (albeit the least efficient) method. We demonstrate that various algorithmic implementations of exhaustive key search are not equally effective, and cryptosystems can be devised which make some implementations of exhaustive key search unsuccessful (in the sense that the problem these algorithms try to solve turns out to be incomputable). We observe that there are implementations of exhaustive key search that are always successful (i.e. they terminate and generate a correct result irrespective of the cryptosystem they are used against). As to those implementations of exhaustive key search that are not always successful, we describe them and those cryptosystems that can make them unsuccessful.
['Alexei Vernitski']
Can Unbreakable Mean Incomputable