Showing papers on "Plaintext-aware encryption published in 1979"
••
TL;DR: The concept of completeness is introduced, which captures the intuitive notion of complexity of SP networks and is examined and a technique for designigning complete SP networks is demonstrated.
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
176 citations
•
31 May 1979TL;DR: A public encryption key (c 1, c 2, r) in which r is the product of two relatively prime numbers, and in which c 1 and r, as well as c 2 and r are relatively prime number, is used in an encryption algorithm x =csub1 msub1 +csub2 msub2 (mod r) The decryption algorithm will be equivalent to solving simultaneous linear equations derived from the encryption algorithm as mentioned in this paper.
Abstract: A public encryption key (c 1 , c 2 , r) in which r is the product of two relatively prime numbers, and in which c 1 and r, as well as c 2 and r, are relatively prime numbers, is used in an encryption algorithm x=csub1 msub1 +csub2 msub2 (mod r) The decryption algorithm will be equivalent to solving simultaneous linear equations derived from the encryption algorithm Thus, both encrypting and decrypting are quite simplified while still maintaining a high degree of security
44 citations