Searching on remote encrypted data has become an important issue in secure online data, since it allows users to encrypt online data to an un-trusted third party while maintains the capability of keyword search on the data. Searchable encryption can be achieved using the classical method called oblivious RAM[2], but the resultant schemes are too inefficient to be applied in the real-world scenarios (e.g., cloud computing). In this paper, we first present Character-wise Symmetric Encryption technique, which helps in searching by Sub-String. This encryption technique solves the Space and Time complexity issue involved in using Homomorphic encryption. Anyserver or a person who has some auxiliary knowledge can uncover the underlying keywords of user queries. To address this issue, we then develop a new encryption algorithm to transform an existing searchable encryption scheme to a new less complicated algorithm. © Research India Publications.