The standard techniques for providing privacy and security in data networks include encryption/decryption algorithms such as Advanced Encryption System (AES) (private-key) and RSA (public-key). RSA is one of the safest standard algorithms, based on public-key, for providing security in networks. One of the most time consuming processes in RSA encryption/decryption algorithm is the modular exponentiation computation of TE mod m where T is the text, (e, n) is the key and this paper examines how this computation could be speeded up drawing up on the Indian Vedic Mathematics when compared with the conventional algorithms in existence. © 2007 IEEE.