Abstract

In this paper, we have developed a novel block cipher, which involves a key bunch matrix in the process of encryption. In order to carry out the decryption process, we have obtained the multiplicative inverse of each key in the encryption key bunch matrix by using the concept of multiplicative inverse, and constructed the decryption matrix. In this analysis, the cryptanalysis clearly shows that the strength of the cipher is remarkable, and this cipher can be used for the transmission of information, like any other well-known cipher, through internet.

References

• Lester Hill, (1929), "Cryptography in an algebraic alphabet", (V. 36 (6), pp. 306-312. ), American Mathematical Monthly.
• Arthur C. Clarke's Venus Prime, volume 2: Maelstrom. New York. Avon Books, 1988.
• Fiestal H. , Cryptography and Computer Privacy, Scientific American, May 1973.
• National Bureau of Standards NBS FIPS PUB 46 "Data Encryption Standard (DES)", US Department of Commerce, January 1977.
• Daemen J. , Rijman V. , "Rijndael, The Advanced Encryption Standard (AES)", Dr. Dobb's Journal, vol. 26, No. 3, March 2001, pp. 137-139.
• V. U. K. Sastry, S. Udaya Kumar, and A. Vinay Babu, "A large Block Cipher using Modular Arithmetic Inverse of a Key Matrix and mixing of the Key Matrix and the Plaintext", Journal of Computer Science, 2(9), 2006, New York, pp. 690-697.
• S. Udaya Kumar, V. U. K. Sastry and A. Vinay Babu, "An iterative Process Involving Interlacing and Decomposition in the Development of a block Cipher", International journal of Computer Science and Network Security, vol. 6, No. 10, October 2006, Seoul, South Korea, pp. 236-245.
• V. U. K. Sastry, V. Janaki, "On the modular arithmetic Inverse in the cryptology of Hill Cipher", Proceedings of North American Technology and Business Conference, September 2005, Canada.
• V. U. K. Sastry, V. Janaki, "A block Cipher using linear Congruences", accepted for publication in Journal of Computer Science, Science publications, Newcity, New York.
• V. U. K. Sastry, N. Ravi Shankar, "Modified Hill Cipher with Interlacing and Iteration ", Journal of Computer Science, Science Publications, 3(11):854-859, 2007.
• V. U. K. Sastry, N. Ravi Shankar, "Modified Hill Cipher for a large block of plaintext with Interlacing and Iteration", Journal of Computer Science, Science Publications, 4(1):15-20, 2008.
• V. U. K. Sastry, Prof. D. S. R. Murthy, Dr. S. Durga Bhavani, "A Block Cipher Invloving a Key Applied on both sides of the plaintext", International Journal of Computer and Network Security (IJCNS), Vol. 1, No. 1, pp. 27-30, Oct 2009.
• V. U. K. Sastry, Prof. D. S. R. Murthy, Dr. S. Durga Bhavani, "A modified Fiestal Cipher involving Modular Arithmetic and a Key on both sides of the Plaintext Matrix", International Journal of Computational Intelligence and Information Security (IJCIIS), Special Issue, Vol. 1, No. 4, pp. 10-16, Jun 2010.
• V. U. K. Sastry, Aruna Varanasi, " A Modified Hill Cipher Involving Permutation, Iteration and the Key in a Specified Position"(IJCNS) International Journal of Computer and Network Security, Vol. 2, No. 10, pp. 157-162, October 2010.
• V. U. K. Sastry, Aruna Varanasi, S. Udaya Kumar, "A Modern Hill Cipher Involving a Permuted Key and Modular Arithmetic Addition Operation", International Journal of Advanced Research in Computer Science Vol. 2 No. 1,pp. 162-165, Jan-Feb 2011.
• V. U. K Sastry and K. Anup Kumar, " A Modified Feistel Cipher involving a key as a multiplicant on both the sides of the Plaintext matrix and supplemented with Mixing Permutation and XOR Operation", International Journal of Computer Technology and Applications ISSN: 2229-6093. Vol. 3, No. 1, pp. 23-31, 2012.
• V. U. K Sastry and K. Anup Kumar, "A Modified Feistel Cipher Involving a Key as a Multiplicant on Both the Sides of the Plaintext Matrix and Supplemented with Mixing, Permutation, and Modular Arithmetic Addition", International Journal of Computer Technology and Applications ISSN: 2229-6093. Vol. 3, No. 1, pp. 32-39, 2012.
• VUK Sastry, Ch. Samson, A Generalized Hill Cipher Involving Different Powers of a Key, Mixing and Substitution, International Journal of Advanced Research in Computer Science, July 2012.
• VUK Sastry, Ch. Samson, Generalized Hill Cipher Involving Multiple Keys, Mixing and Key Dependent Substitution, International Journal of Computational Intelligence and Information Security, July 2012.
• V. U. K Sastry and K. Anup Kumar, "A Modified Feistel Cipher Involving a Pair of Key Matrices, Supplemented with XOR Operation, and Blending of the Plaintext in each Round of the Iteration Process", International Journal of Computer Science and Information Technologies ISSN: 0975-9646. Vol. 3, No. 1, pp. 31333141, 2012.
• William Stallings: Cryptography and Network Security: Principle and Practices", Third Edition 2003, Chapter 2, pp. 29.