The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1979 vol.28)
pp: 747-753
J.B. Kam , Department of Electrical Engineering and Computer Science, Columbia University
ABSTRACT
In attempting to solve the problems of data security, researchers, and practititioners are placing increasing emphasis on encryption. An important class of encryption schemes is that of substitution-permutation (SP) encryption networks. A variant of the SP network has been chosen by the National Bureau of Standards as the data encryption standard. In this paper, we introduce the concept of completeness, which captures the intuitive notion of complexity of SP networks. The completeness property is examined and a technique for designigning complete SP networks is demonstrated.
INDEX TERMS
substitution-permutation (SP) networks, Complete SP networks, data encryption standard, data security, encryption
CITATION
J.B. Kam, G.I. Davida, "Structured Design of Substitution-Permutation Encryption Networks", IEEE Transactions on Computers, vol.28, no. 10, pp. 747-753, October 1979, doi:10.1109/TC.1979.1675242
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool