LRXE: Lite-RSA for XML Encryption suitable for computational constraint devices

Web services and cloud computing have gained wide range of popularity. Cloud and web services are used anywhere, by anyone, on any platform. In these fields, Extensible Markup Language (XML) has been identified as conventional standard for data sharing among the communicating parties. XML Security has become an important concern in the field of information and data sharing. In this paper, a variant of RSA algorithm called Lite-RSA for XML Encryption (LRXE) is proposed. LRXE uses small public key exponent for encryption. Computational burden of LRXE decryption process is reduced by redevising the private key of basic RSA. The encryption/decryption is validated over several granularities of XML file. The time to encrypt/decrypt an entire XML file using LRXE is very less compared to normal RSA. Due to the encryption/decryption efficiency, LRXE can be preferred over RSA and is more suitable for devices having low battery life and computational limitations.