A Construction of a Cipher From a Single Pseudorandom Permutation (1991)
| Venue: | Journal of Cryptology |
| Citations: | 37 - 0 self |
BibTeX
@INPROCEEDINGS{Even91aconstruction,
author = {Shimon Even and Yishay Mansour},
title = {A Construction of a Cipher From a Single Pseudorandom Permutation},
booktitle = {Journal of Cryptology},
year = {1991},
pages = {151--161},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We suggest a scheme for a block cipher which uses only one randomly chosen permutation, F . The key, consisting of two blocks, K 1 and K 2 is used in the following way: The message block is XORed with K 1 before applying F , and the outcome is XORed with K 2 , 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 Comp. Sci. Dept., Technion, Israel Institute of Technology, Haifa, Israel 32000. Supported by the Fund for the Promotion of Research at the Technion, and by Bellcore, Morristown, NJ. E-address: even@cs.technion.ac.il 2 Computer Science Dept., Tel-Aviv University. Part of the work was done while the author was in IBM T.J. Watson Research Center. 1 Introduction Shannon defined a random cipher as a collection of randomly chosen permutations, one for each value of the key. Following Shannon, [1], a cipher, C, consists of: 1. A ...
Citations
No citations identified.
