A Nxm Version Of 5X5 Playfair Cipher For Any Natural Language (Urdu As Special Case)

In this paper a modified version NXM of traditional 5X5 playfair cipher is introduced which enable the user to encrypt message of any Natural language by taking appropriate size of the matrix depending upon the size of the natural language. 5X5 matrix has the capability of storing only 26 characters of English language and unable to store characters of any language having more than 26 characters. To overcome this limitation NXM matrix is introduced which solve this limitation. In this paper a special case of Urdu language is discussed. Where # is used for completing odd pair and * is used for repeating letters.
{"references":["Andrew S. Tanenbaum, \"Networks Computer\", 4th Edition","http://www.sirraksbey.com/cryptography.html","http://eclipsed.net/~gr/20030702/320000- symmetric_v_pki.html","Behrouz A. Forouzan, \"Data Communications and Networking\", 4th\nEdition, McGraw-Hills, 2006","William Stallings, \"Cryptography and Network Security: Principles and\nPractice\", 4th Edition, Prentice Hall, 2005","http://en.wikipedia.org/wiki","http://unicode.org/standard/WhatIsUnicode.html","http://www.tremu.gov.pk/tremu1/workingroups/pdfpresentations/UZT%\n20UNICODE%20MAPPING.pdf","http://unicode.org/charts/PDF/U0600.pdf\n[10] H. A. A. Hassan, M. Saeb, and H. D. Hamed, \"The PYRAMIDS block\ncipher\", International Journal of Network Security, Vol. 1, No. 1, pp. 52-\n60, 2005.\n[11] Y. Kurniawan, A. S. A., M. S. Mardiyanto, I. S. S., and S. Sutikno, \"The\nnew block cipher: BC2\", International Journal of Network Security, Vol.\n8, No. 1, pp. 16-24, 2009.\n[12] P. Lin, W. L. Wu, C. K. Wu, \"Security analysis of double length\ncompression function based on block cipher\" International Journal of\nNetwork Security, Vol. 4, No. 2, pp. 121-127, 2007."]}