The week's pick
Reseach Article
Variable-length Hill Cipher with MDS Key Matrix
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 57 - Number 13 |
| Year of Publication: 2012 |
| Authors: Kondwani Magamba, Solomon Kadaleka, Ansley Kasambara |
10.5120/9178-3587
|
Kondwani Magamba, Solomon Kadaleka, Ansley Kasambara . Variable-length Hill Cipher with MDS Key Matrix. International Journal of Computer Applications. 57, 13 ( November 2012), 43-45. DOI=10.5120/9178-3587
Abstract
The Hill Cipher is a classical symmetric cipher which breaks plaintext into blocks of size m and then multiplies each block by an m×m key matrix to yield ciphertext. However, it is well known that the Hill cipher succumbs to cryptanalysis relatively easily. As a result, there have been efforts to strengthen the cipher through the use of various techniques e. g. permuting rows and columns of the key matrix to encrypt each plaintext vector with a new key matrix. In this paper, a method is proposed to strengthen the security of the Hill cipher against a known-plaintext attack by encrypting each plaintext matrix by a variable-length key matrix obtained from a Maximum Distance Separable (MDS) master key matrix.
References
- V. U. K. Sastry, D. S. R. Murthy, S. Durga Bhavani, "A Block Cipher Involving a Key Applied on Both the Sides of the Plain Text," International Journal of Computer and Network Security (IJCNS), Vol. 1, No. 1, pp. 27 -30, Oct. 2009.
- V. U. K. Sastry and V. Janaki, "A Modified Hill Cipher with Multiple Keys", International Journal of Computational Science, Vol. 2, No. 6, 815-826, Dec. 2008.
- Bhibhudendra Acharya, Girija Sankar Rath, and Sarat Kumar Patra, "Novel Modified Hill Cipher Algorithm,"Proceedings of ICTAETS, pp. 126-130, 2008
- D. R. Stinson, 2006. "Cryptography Theory and Practice," 3rd edition, Chapman and Hall/CRC, pp. 13-37,
- Shahrokh Saeednia, "How to Make Hill cipher Secure," Cryptologia 24:4, pp. 353-360, Oct 2000.
- Ismail I A, Amin Mohammed, Diab Hossam, "How to Repair the Hill Cipher," Journal of Zhejiang University Science, 7(12), pp. 2022-2030, 2006.
- Overbey, J. , Traves, W. , and Wojdylo, J. , "On the keyspace of the Hill cipher," Cryptologia, 29(l), pp. 59-72, 2005.
- F. J. McWilliams and N. J. A. Sloane, 1977. "The Theory of Error Correcting Codes," Amsterdam, The Netherlands, North Holland.
- Sriram Ramanujam and Marimuthu Karuppiah, "Designing an algorithm with high Avalanche Effect,"IJCSNS International Journal of Computer Science and Network Security, VOL. 11, No. 1, 106-111 January 2011.
- Romero, Y. R. Garcia, R. V. et al. , "Comments on How to Repair the Hill Cipher," J. Zhejiang Univ. Sci. A 9(2): pp. 211-214, 2008.
- Chefranov, A. G. , "Secure Hill Cipher Modification," Proc. Of the First International Conference on Security of Information and Network (SIN2007) 7-10 May 2007, Gazimagusa (TRNC) North Cyprus, Elci, A. , Ors, B. , and Preneel, B (Eds) Trafford Publishing, Canada, 2008: pp 34-37, 2007.
- Daemen, J. , Rijmen, V. , The Design of Rijndael: "AES – The Advanced Encryption Standard. " Springer, 2002.
- Monem, A. M. , Rahma1 and Yacob, B. Z. ,"The Dynamic Dual Key Encryption Algorithm Based on joint Galois Fields," IJCSNS International Journal of Computer Science and Network Security, VOL. 11, No. 8, August 2011.
Index Terms
Keywords