In cryptographic theory, block cipher security is formally defined via probabilistic games involving Target Key Recovery (TKR) and Consistent Key Recovery (KR), where a family of functions maps keys to permutations over a domain equal to the range. Security metrics are quantified by an adversary's advantage—the probability that the game returns true—distinguishing between strict TKR, which requires outputting the exact secret key used for encryption, and relaxed KR, which accepts any key consistent with observed input-output pairs. The theoretical significance lies in establishing a formal baseline where exhaustive key search guarantees success against CR but may succeed with lower advantage against TRK depending on the cipher's structural properties regarding collision-free consistency of distinct keys within query constraints.
In cryptographic theory, block cipher security is formally defined via probabilistic games involving Target Key Recovery (TKR) and Consistent Key Recovery (KR), where a family of functions maps keys …