1979/10/01 by Kam, Pooi‐Yuen Kam, Davida · 181 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #56-bit encryption #Algorithm #Artificial intelligence #Class (philosophy) #Coding theory and cryptography #Completeness (order theory) #Computer science #Computer security #Cryptography #DNA and Biological Computing #Encryption #Mathematics #Multiple encryption #Permutation (music) #Probabilistic encryption #Programming language #Substitution (logic) #Theoretical computer science #Wireless Communication Security Techniques
paper · doi:10.1109/tc.1979.1675242
published in IEEE Transactions on Computers C-28(10), 747-753 (Institute of Electrical and Electronics Engineers)
openalex publication_date 1979/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/27
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.