Analysis and Implementation of Transposition Techniques

Satish Bansal, Rajesh Srivastava · 2012

This paper presents some of the transposition and symmetric-based techniques, where the key is not used separately because it is hidden in the message. Early classical ciphers — substitution and transposition operations — have formed the building blocks for today’s powerful ciphers such as the Data Encryption Standard (DES). But with the advent of the Internet, data privacy is facing more risks. Therefore, the need for information security increases, which leads to new developments in cryptography. One of the most important things is that all symmetric and asymmetric techniques are key-based, and this key is in any sequence or in any order to encrypt the plain text. The major problem in symmetric key is the key exchange between the communication parties. Transposition is a simpler and more powerful technique than substitution because it not only substitutes the text, but also permutates the text. The new approach first develops three new transposition algorithms which are very simple than the other transposition ciphers. These transposition ciphers are then modified based on the symmetric key which reduces the overheads of the key exchange as the key is hidden in the message (Satish and Rajesh 2011a). The new transposition algorithms are helpful in generating symmetric key that can help in encryption and decryption processes. It can also be used in the field of education, banking, networking and other secret communication-related applications.

Read the paper · More papers on PaperTik