Some Regular Properties of the ‘Data Encryption Standard’ Algorithm
A cipher function y = E(k,x) should appear to be a random function of both the key k and the plaintext x. Any regular behaviour is of interest to the users. In the extreme case regular properties might point to a weakness of the cipher. Precautions are needed in the use of a cipher that has regular features. This note describes five regular properties of the ‘Data Encryption Standard’ or DES, two of which have been described elsewhere, are included for completeness.
KeywordsHamiltonian Cycle Regular Feature Data Encryption Standard Complementation Property Regular Property
Unable to display preview. Download preview PDF.