USING BINARY DERIVATIVES TO TEST AN ENHANCEMENT OF DES

Abstract
Using the eight parity bits of the DES key to select from 256 alternative sets of substitution (S-) boxes increases key space from 256 to 264, permits operating in an autokeying mode if desired, and allows up to variants of the algorithm. We employ multi-level binary derivative sequences to show that our S-boxes scramble the bits of crypt-text as well as unmodified DES does.