Analysis of Playfair Algorithm with Different Sizes on Natural Languages (Specialized on Telugu language)

Cryptography is used to encrypt the secret messages. In Cryptography, the Playfair cipher algorithm depending upon different matrices had explained an interesting data encryption technique with very low complexity. This Paper will present a perspective on combination of Playfair techniques. Extending the concept of 5 X 5 matrix of Playfair algorithm into different sizes, encrypting the messages of natural languages is developed. Play fair cipher is one of the popular symmetric encryption methods. The first recorded description of the Play fair cipher was in a document signed by Wheatstone on 26 March 1854. However Lord Play fair promoted the use of this cipher and hence it is called Play fair Cipher. Previously, this paper is improved the algorithm to support 6 X 6 matrix for 0-9 numeric values and alphabets, 8 X 8 matrix for Interweaving on DNA – encoded data, 7 X 4 matrix for non repeating alphabets with #,*.10 X 9 matrix for alpha-numeric values and special characters. The 16 X 16 matrix is used of Urdu language, 256 X 256 a matrix is used for Kurdish Language. In this paper the original paper of 5 X 5 matrix is modified into N X M matrix and it is possible to encrypt messages written by natural language. In this paper our state language Telugu as a special case is discussed.