Showing papers on "Transposition cipher published in 1982"
DOI•
01 Mar 1982TL;DR: This paper is a review of the subject of data security and the probabilistic as well as the computational complexity approaches to this subject have been discussed.
Abstract: This paper is a review of the subject of data security. The probabilistic as well as the computational complexity approaches to this subject have been discussed. Ciphers examined in some depth include block random ciphers, stream ciphers, the DES cipher adopted by the National Bureau of Standards, USA, the RSA computational complexity cipher, the Merkle and the Hellman trap-doorKnapsack cipher.
1 citations
TL;DR: It is proved that every generalized Hill encipherments is de-composable into a transposition cipher and a context-sensitive substitution, if and only if the underlying ring is a local ring.
Abstract: We study generalized Hill encipherments using an arbitrary finite commutative ring with 1 as coordinate system, and we prove that every such cipher is de-composable into a transposition cipher and a context-sensitive substitution, if and only if the underlying ring is a local ring.