This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
October 1979 (vol. 28 no. 10)
pp. 747-753
J.B. Kam, Department of Electrical Engineering and Computer Science, Columbia University
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, Oct. 1979, doi:10.1109/TC.1979.1675242
Usage of this product signifies your acceptance of the Terms of Use.