Orr Dunkelman, Nathan Keller, and Adi Shamir later proved it was possible to simplify the Even–Mansour scheme even further and still retain the same provable security, producing the " single-key Even–Mansour scheme": XOR the plaintext with the key, apply a publicly known unkeyed permutation to the result, and then XOR the same key to the permuted result to produce the final ciphertext. Studying simple Even–Mansour style block ciphers gives insight into the security of Feistel ciphers (DES-like ciphers) and helps understand block cipher design in general. In 1991, motivated by Rivest's DESX construction, Even and Mansour proposed a much simpler scheme (the " two-key Even–Mansour scheme"), which they suggested was perhaps the simplest possible block cipher: XOR the plaintext with a prewhitening key, apply a publicly known unkeyed permutation (in practice, a pseudorandom permutation) to the result, and then XOR a postwhitening key to the permuted result to produce the final ciphertext. In 1984, to protect DES against exhaustive search attacks, Ron Rivest proposed DESX: XOR a pre- whitening key to the plaintext, encrypt the result with DES using a secret key, and then XOR a postwhitening key to the encrypted result to produce the final ciphertext. XEX is also a common form of key whitening, and part of some smart card proposals. In tweaked-codebook mode with ciphertext stealing ( XTS mode), it is one of the more popular modes of operation for whole-disk encryption.
The xor–encrypt–xor ( XEX) is a (tweakable) mode of operation of a block cipher. XEX technique: Key1 and Key2 extend the original (short) Key
0 kommentar(er)
