Advertisement

Some Regular Properties of the ‘Data Encryption Standard’ Algorithm

  • Donald W. Davies

Abstract

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.

Keywords

Hamiltonian Cycle Regular Feature Data Encryption Standard Complementation Property Regular Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • Donald W. Davies
    • 1
  1. 1.National Physical LaboratoryTeddington, MiddlesexUK

Personalised recommendations