Feistel ciphers with L<sub>2</sub>-decorrelation

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


Published in:
The 5th Annual International Workshop on Selected Areas in Cryptography, SAC '98, 1556, 1-14
Year:
1999
Laboratories:




 Record created 2007-01-18, last modified 2018-03-17

n/a:
Download fulltextPS
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)