Difference between revisions 5957521 and 8061769 on simplewiki

{{complex|date=April 2012}}
The '''Meet-in-the-middle attack''' is a [[cryptography|cryptographic]] attack which, like the [[birthday attack]], makes use of a [[space-time tradeoff]]. While the birthday attack attempts to find two values in the domain of a function that map to the same value in its range, the meet-in-the-middle attack attempts to find a value in each of the ranges and domains of the composition of two functions such that the forward mapping of one through the f(contracted; show full)| date=June 1977
| title=Exhaustive Cryptanalysis of the NBS Data Encryption Standard
| journal=Computer
| volume=10
| issue=6
| pages=74–84
| doi=10.1109/C-M.1977.217750

| s2cid=2412454⏎
}}</ref> The attack works by encrypting from one end and decrypting from the other end, thus meeting in the middle.

Assume the attacker knows a set of plaintext and ciphertext: ''P'' and ''C''. That is,
: <math>
  C=E_{K_2}(E_{K_1}(P))
  </math>,
where E is the encryption function (cipher), and ''K''<sub>1</sub> and ''K''<sub>2</sub> are the two keys.

(contracted; show full)
==References==
<references/>


{{Math-stub}}

[[Category:Cryptography]]