Add-On Security Model for Public-Key Cryptosystem Based on Magic Square Implementation

Abstract

The efficiency of a cryptographic algorithm is based on its time taken for encryption / decryption and the way it produces different cipher text from a clear text. The RSA, the widely used public key algorithm and other public key algorithms may not guarantee that the cipher text is fully secured. As an alternative approach to handling ASCII characters in the cryptosystems, a magic square implementation is thought of in this work. It attempts to enhance the efficiency by providing add-on security to the cryptosystem. This approach will increase the security due to its complexity in encryption because it deals with the magic square formation with seed number, start number and sum that cannot be easily traced. Here, encryption / decryption is based on numerals generated by magic square rather than ASCII values. This proposed work provides another layer of security to any public key algorithms such as RSA, ElGamal etc., Since, this model is acting as a wrapper to a public key algorithm, it ensures that the security is enhanced. Further, this approach is experimented in a simulated environment with 2, 4, 8, and 16 processor model using Maui scheduler which is based on back filling philosophy.