Abstract

In this paper, we study an encryption scheme based on group algebra 􀛵 over the\nboolean ring 􀜀. The key idea of the proposal is that for a given commutative ring, we can define\ndifferent functions over ℤ􀡺 and use them as the underlying structure. Using this group algebra\n􀜀􀛵, we are giving a criterion to encrypt the message and to retrieve it using the RSA Algorithm.\nFor the decryption algorithm to work, without any loss of data, the invertibility of the latin\nsquare over 􀜀 is the necessary condition.