A simplified and generalized treatment of DES related ciphers
From MaRDI portal
Publication:6233261
arXiv1205.5613MaRDI QIDQ6233261FDOQ6233261
Authors: L. Babinkostova, Alyssa M. Bowden, Andrew M. Kimball, Kameryn J. Williams 
Publication date: 25 May 2012
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. We 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. We present a non-computational proof that for nleq6 the set of n-round Feistel permutations over an arbitrary group do not constitute a group under functional composition.
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) General theory for finite permutation groups (20B05) Symmetric groups (20B30) Applications to coding theory and cryptography of arithmetic geometry (14G50)
This page was built for publication: A simplified and generalized treatment of DES related ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233261)
