Symmetric Key Cryptography Using Random Key Generator.
Asoke Nath, Saima Ghosh, Meheboob Alam Mallick · Security and Management · 2010
In the present work we have introduced a new symmetric key cryptographic method for encrypting as well as decrypting any file such as binary file, text file or any other file. In our method we have modified the idea of Play fair method into a new platform where we can encrypt or decrypt any file. We have introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. We have also introduced a new algorithm for encrypting the plain text multiple times. Our method is totally dependent on the random text_key which is to be supplied by the user. The maximum length of the text_key can be of 16 characters long and it may contain any character(ASCII code 0 to 255). We have developed an algorithm to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and hence if someone applies the brute force method then he/she has to give trail for 256! times which is quite absurd. Moreover the multiple encryption method makes the system further secured. We propose that our method could be appropriate in sensor network where the massive computation is not possible but the security of data is important at the same time.