Loading...
conference paper
Feistel ciphers with L2-decorrelation
1999
The 5th Annual International Workshop on Selected Areas in Cryptography, SAC '98
Recently, we showed how to strengthen block ciphers by decorrelation techniques. In particular, we proposed two practical block ciphers, one based on the GF(2<sup>n</sup>)-arithmetics, the other based on the x mod p mod 2<sup>n</sup> primitive with a prime p=2<sup>n</sup>(1+d). We show how to achieve similar decorrelation with a prime p=2<sup>n</sup>(1-d). For this we have to change the choice of the norm in the decorrelation theory and replace the L<sub>8</sub> norm by the L<sub>2</sub> norm. We propose a new practical block cipher which is provably resistant against differential and linear cryptanalysis
Loading...
Name
Vau98e.ps
Access type
openaccess
Size
244.09 KB
Format
Postscript
Checksum (MD5)
2fe65a58a709d0ee4d99c934100a03ff