摘要: The block cipher DESX is defined by DESXk.k1.ka(x) = k2 ⊕ DESk(k1 x), where denotes bitwise exclusive-or. This construction was first suggested Ron Rivest as a computationally-cheap way to protect DES against exhaustive key-search attacks. paper proves, in formal model, that the sound. We show that, when F an idealized cipher, FXk.k1.k2(x)= K2 Fk(k1 x) substantially more resistant key search than F. In fact, our analysis says FX has effective length of at least ϰ+n - 1 lg m bits, ϰ, F, n Iength, and bounds number (x, FXk(x)) pairs adversary can obtain.