Editing Meet-in-the-middle attack (section)

=== MITM algorithm ===
Compute the following:
*<math>\mathit{SubCipher}_1=\mathit{ENC}_{f_1}(k_{f_1},P),\; \forall  k_{f_1} \in  K </math>:
*: and save each <math>\mathit{SubCipher}_{1} </math> together with corresponding <math> k_{f_1} </math> in a set A
*<math>\mathit{SubCipher}_1=\mathit{DEC}_{b_1}(k_{b_1},C),\; \forall k_{b_1} \in K </math>:
*: and compare each new <math>\mathit{SubCipher}_1 </math> with the set A

When a match is found, keep <math>k_{f_1},k_{b_1}</math> as candidate key-pair in a table ''T''. Test pairs in ''T'' on a new pair of {{tmath|(P,C)}} to confirm validity. If the key-pair does not work on this new pair, do MITM again on a new pair of {{tmath|(P,C)}}.