A NOVEL EFFIECIENT TECHNIQUE FOR DATA SECURITY USING VEDIC MATHEMATICS

ABSTRACT 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. Even though the RSA Algorithm is an old and simple encryption technique, there is a scope to improve its performance. This paper proposes the implementation of RSA encryption algorithm using the sutras or principles of ancient indian vedic mathematics that have been modified the algorithm to improve performance.It is observed that, RSA algorithm is difficult to implement with high speed because one of the most time consuming processes in RSA encryption/ decryption algorithm is the computation of ab mod n where “a” is the text, (b, n) is the key. Generally the prime number used for RSA Encryption system will around 100 to 150 decimal digits. The computations involved are tedious and time consuming. Also the hardware is quite complex. To increase the computation speed, the multiplication principle of Vedic mathematics is used in this paper. “Urdhva-tiryakbhyam” is the sutra (principle) which used to compute the multiplication. It literally means vertical and crosswise manipulation. The significance of this technique is that it computes the partial products in one step and avoids the shifting operation which saves both time and hardware. The VHDL code is simulated and synthesized on ModelSim SE 6.3f and Altera Quartus II 9.1 tools respectively.