An efficient hardware model for RSA Encryption system using Vedic mathematics

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. Eve...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Procedia engineering Ročník 30; s. 124 - 128
Hlavní autori: Bhaskar, R., Hegde, Ganapathi, Vaya, P.R.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 2012
Predmet:
improved restoring algorithm
RSA encryption system
Vedic mathematics
Vedic mathematics
improved restoring algorithm
RSA encryption system
ISSN:1877-7058, 1877-7058
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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. 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 and also an improvement is made in the conventional restoring algorithm which does the modulus operation. “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. Also an improvement is made in the restoring algorithm by avoiding unnecessary restorations when they are not required.
ISSN:1877-7058
1877-7058
DOI:10.1016/j.proeng.2012.01.842