Abstract
Abstract: This work is a study of DES-like ciphers where the bitwise exclusive-or (XOR) operation in the underlying Feistel network is replaced by an arbitrary group operation. The authors construct a two-round simplified version of DES that contains all the DES components and show that its set of encryption permutations is not a group under functional composition, it is not a pure cipher, and its set of encryption permutations does not generate the alternating group. They present a non-statistical proof that for n ≤ 4 the set of n-round Feistel permutations over an arbitrary group do not constitute a group under functional composition.
Original language | English |
---|---|
Pages (from-to) | 3-24 |
Number of pages | 22 |
Journal | Cryptologia |
Volume | 39 |
Issue number | 1 |
DOIs | |
State | Published - 2 Jan 2015 |
Keywords
- Data Encryption Standard
- group operation
- pure cipher
- symmetric group