# Simplifying Meet-In-The-Middle Attacks

Considering the fact that a block cipher is a bijective function on the set of possible plaintexts, if one views the encryption of a datum with a key $$K_2$$, which has been already encrypted with the same n-bit block cipher, using key $$K_1$$ as a single n-bit mapping $$\text{F(plaintext}, K)$$, is not bruteforcing through $$2^n$$ keys not more efficient than performing a Meet-In-The-Middle Attack (or MD-MITM, as the case may be)?

Although you may get one $$K$$ for only one block with the negiligible probability it will work for the other blocks.