Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Kam et al. (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: