I was thinking about a thought experiment.
Let's imagine a world full of crackers such that whenever you encrypt something there will be someone who will try to crack your cryptographic key through bruteforce.
Suppose furthermore that we are using secure key based cryptography where keys are randomly generated by the creator such that on average it will need unsustainable computational power to crack it (not much different from reality).
Suppose that in the initial state of our system all crackers use a rudimentary algorithm that starts from 0 and searches the key one by one by bruteforce.
Now let's imagine that we want to encrypt our message in the mentioned world, we run our RNG and we get 10 (a low value). For the hypothesis above we are absolutely certain that if we encrypt the message with 10 as key it would be immediately cracked. So we need to drop 10 and basically we have to raise the floor of our RNG, reducing the key space size, or to shift it completely. When most encrypters will end up adopting these measures as a consequence crackers will start to change their starting point for bruteforce and I guess we will get some kind of predator-prey process. Now I know it's not a specific question but I was wondering if there is any scientific literature about this phenomenon, if it has a name and basically if there is any kind of reference to something similar somewhere. I googled things like "Cryptography game theory" and similar but did not really find anything pertinent.