Optimizing Cipher Text Size for ASCII Based Cryptography Using Matrices

A secret encoding matrix generation scheme based on recursion is presented in this paper which makes the already existing ASCII Based Cryptography more generalized in the sense of security aspect and it also allows the string length of alphanumeric receiver identity to be at most 40. Our generates an encoding matrix whose entries are relatively smaller than its earlier variant and it is further able to put a cap on the size of cipher text generated for sending to the receiver without compromising the security aspect.