2012/05/25 by Liljana Babinkostova, Babinkostova, Liljana, Alyssa M. Bowden +5
Computer Science · Mathematics · #11T71 #14G50 #20B05 #20B30 #94A60 #Cryptography and Security (cs.CR) #E.3 #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #acm:11T71 #acm:14G50 #acm:20B05 #acm:20B30 #acm:94A60 #cs.CR #math.GR #msc:11T71 #msc:14G50 #msc:20B05 #msc:20B30 #msc:94A60
paper · pdf · doi:10.48550/arxiv.1205.5613
24 pages, 2 figures
arxiv created 2012/06/04 · arxiv updated 2012/06/05
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 n≤6 the set of n-round Feistel permutations over an arbitrary group do not constitute a group under functional composition.