A construction of a cipher from a single pseudorandom permutation
暂无分享,去创建一个
We suggest a scheme for a block cipher which uses only one randomly chosen permutation,F. The key, consisting of two blocks,K1 andK2, is used in the following way. The message block is XORed withK1 before applyingF, and the outcome is XORed withK2, to produce the cryptogram block. We show that the resulting cipher is secure (when the permutation is random or pseudorandom). This removes the need to store, or generate a multitude of permutations.
[1] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[2] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[3] Joan Daemen,et al. Limitations of the Even-Mansour Construction , 1991, ASIACRYPT.
[4] Ralph Howard,et al. Data Encryption Standard , 1987, Definitions.