Abstract

ENCRYPTION of data has become essential for sending confidential information from one system to another system especially in banking sector NTRU labs have done pioneering work using a ring of truncated polynomials which was based on the impossibility with proper choice of parameters of finding the polynomial with knowledge of its inverse in modular arithmetic Recently Learning With Errors LWE has been studied extensively and its hardness can be linked to the near impossibility of finding the Shortest Vector on integer lattices In this paper we have shown that a preprocessing of input before applying the LWE algorithm greatly reduces the time of encryption and decryption