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.
This paper was presented on August 24, 1981, at the CRYPTO 81 conference at the University of California, Santa Barbara.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this paper
Cite this paper
Davies, D.W. (1983). Some Regular Properties of the ‘Data Encryption Standard’ Algorithm. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0602-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-0604-8
Online ISBN: 978-1-4757-0602-4
eBook Packages: Springer Book Archive