Loading...
conference paper
On the Lai-Massey scheme
1999
International Conference on the Theory and Applications of Cryptology and Information Security, Advances in Cryptology - ASIACRYPT'99
Constructing a block cipher requires us to define a random permutation, which is usually performed by the Feistel scheme and its variants. In this paper we investigate the Lai-Massey scheme which was used in IDEA. We show that we cannot use it  as is in order to obtain results like the Luby-Rackoff theorem. This can however be done by introducing a simple function which has an orthomorphism property. We also show that this design offers nice decorrelation properties, and we propose a block cipher family called Walnut
Loading...
Name
Vau99c.ps
Access type
openaccess
Size
194.78 KB
Format
Postscript
Checksum (MD5)
a80330b3c2c92476baa2b2a82eb96bee