0 Up votes0 Down votes

18 views3 pagesRSA is one of the most safest standard algorithm based on public key, for providing security in network. The hierarchical overlay multiplier is used in RSA circuitry for multiplication operation. The most significant aspect is the development of division architecture based on Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. Typically, modular-multiplication algorithm is used since no trial division is necessary, and the carry-save addition (CSA) is employed to reduce the critical path. The implementation of RSA encryption/decryption algorithm using the algorithm of Ancient Indian Vedic Mathematics that have been modified to improve performance. RSA circuitry implemented using vedic multiplication is efficient in terms of area, speed compared to its implementation using conventional multiplication.

Sep 08, 2015

© © All Rights Reserved

PDF, TXT or read online from Scribd

RSA is one of the most safest standard algorithm based on public key, for providing security in network. The hierarchical overlay multiplier is used in RSA circuitry for multiplication operation. The most significant aspect is the development of division architecture based on Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. Typically, modular-multiplication algorithm is used since no trial division is necessary, and the carry-save addition (CSA) is employed to reduce the critical path. The implementation of RSA encryption/decryption algorithm using the algorithm of Ancient Indian Vedic Mathematics that have been modified to improve performance. RSA circuitry implemented using vedic multiplication is efficient in terms of area, speed compared to its implementation using conventional multiplication.

© All Rights Reserved

18 views

RSA is one of the most safest standard algorithm based on public key, for providing security in network. The hierarchical overlay multiplier is used in RSA circuitry for multiplication operation. The most significant aspect is the development of division architecture based on Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. Typically, modular-multiplication algorithm is used since no trial division is necessary, and the carry-save addition (CSA) is employed to reduce the critical path. The implementation of RSA encryption/decryption algorithm using the algorithm of Ancient Indian Vedic Mathematics that have been modified to improve performance. RSA circuitry implemented using vedic multiplication is efficient in terms of area, speed compared to its implementation using conventional multiplication.

© All Rights Reserved

- Secure Image Encryption Using Filter Bank and Addition Modulo 28 with Exclusive OR Combination
- DNA Crypt Final
- FMIPv6 Based Secure Binding Update Authentication in Wireless Vehicular Networks
- Lecture03-1s
- 028
- ho16.pdf
- Synopsis of Thesis
- dbmslecture7
- A Comprehensive Study of Cryptography & Content Hiding Techniques for Security of Digital Videos
- SSL Key Generation Weaknesses | Bishop Fox
- Bsn
- Jamming Attacks First Review
- VPN
- Fpga Implementation of Automated Encryption Standard Algorithm
- Jit Dynamic Cryptosystem
- An Enhanced Security Enabled Sharing of Protected Cloud Storage Services by Trapdoor Commitment Based on RSA Signature Assumption
- UNIT 5
- PARC4-I: PARALLEL IMPLEMENTATION OF ENHANCED RC4A USING PASCS AND LOOP UNROLLING MECHANISM
- 1303.1048.pdf
- Multi-Dimensional Range Query Over Encrypted Data

You are on page 1of 3

Volume: 3 Issue: 1

ISSN: 2321-8169

162 - 164

_______________________________________________________________________________________________

Vedic Mathematics

Shahina M. Salim

M.E. Student, Department of Electronics and Telecommunication,

G. H. Raisoni C.O.E.T, S.G.B. Amravati University,

Amravati(Maharashtra State),India.

shahina.salim786@gmail.com

S. A. Lakhotiya

Professor, Department of Electronics and Telecommunication,

Amravati(Maharashtra State),India

sonal.lakhotiya@raisoni.net

Abstract RSA is one of the most safest standard algorithm based on public key, for providing security in network. The hierarchical overlay

multiplier is used in RSA circuitry for multiplication operation. The most significant aspect is the development of division architecture based on

Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. Typically, modularmultiplication algorithm is used since no trial division is necessary, and the carry-save addition (CSA) is employed to reduce the critical path.

The implementation of RSA encryption/decryption algorithm using the algorithm of Ancient Indian Vedic Mathematics that have been modified

to improve performance. RSA circuitry implemented using vedic multiplication is efficient in terms of area, speed compared to its

implementation using conventional multiplication.

Keywords RSA Cryptosystem, Modular Multiplication,, Modular exponentiation, Vedic Mathematics, FPGA, VHDL.

__________________________________________________*****_________________________________________________

I.

INTRODUCTION

means the store-house of all knowledge. Vedic mathematics is

mainly based on 16 Sutras (or aphorisms) dealing with various

branches of mathematics like arithmetic, algebra, geometry

etc.

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). RivestShamirAdleman (RSA) is one of the

most widely preferred algorithms used in public-key

cryptography systems. RSA is one of the safest standard

algorithms, based on public-key, for providing security in

networks. RSA has a very slow ciphering rate if used in

software. Security has become an increasingly important

feature with the growth of electronic communication. The

development of public-key cryptography (PKC) is the greatest

and perhaps the only true revolution in the entire history of

cryptography . Many PKC algorithms such as RivestShamir

Adleman (RSA) algorithm and DiffieHellman algorithm

have been proposed. PKC is asymmetric involving the use of

two separate keys, in contrast to symmetric conventional

encryption, which uses only a single key. The use of two keys

provides solution to key management and user authentication

in a cryptosystem.

RSA algorithm is the best known, the most versatile and

widely used public key algorithm today RSA depends on the

modular exponentiation of long integers, which is the critical

operation for a variety of the most widely accepted

cryptosystems . Therefore, fast modular multiplication

a high throughput is needed in data communication. The most

widely used algorithm for efficient modular multiplication is

Montgomerys algorithm. The binary Montgomerys modularmultiplication algorithm employs only simple addition,

subtraction, and shift operation to avoid trial division, a critical

and time-consuming operation in conventional modular

multiplication. The modular exponentiation is usually

accomplished by performing repeated modular multiplications.

II. LITERATURE REVIEW

Sriraman, L, Kumar K.S, Prabakar, T.N [1] presented Vedic

mathematics is one of the ancient Indian mathematics which

contains sixteen sutras. These sutras can be used to solve

problems in any branch of Mathematics in a faster way. The

proposed squarer is based on sutra called Ekadhikena Purvena.

It means that one more than the previous. This sutra is used

for finding the square of decimal numbers ending with `5'. In

this paper this sutra is generalized and used for squaring of

binary numbers.

Gustavo D. Sutter, Jean-Pierre Deschamps, and Jos Luis

Imaa [2] presented Modular exponentiation with large

modulus and exponent, which is usually accomplished by

repeated modular multiplications, has been widely used in

public key cryptosystems. Typically, the Montgomerys

modular-multiplication algorithm is used since no trial

division is necessary, and the carrysave addition (CSA) is

employed to reduce the critical path. In this paper, we

optimize the Montgomerys multiplication and propose

architectures to perform the least significant bit first and the

most significant bit first algorithm [3],[4],[5].

162

_______________________________________________________________________________________

Volume: 3 Issue: 1

ISSN: 2321-8169

162 - 164

_______________________________________________________________________________________________

Xiaoming Tang [6] presented A certain range of real number

presented by ASCII code is converted to single precision

floating-point by pipeline processing with VHDL language.

Through functional simulation and download verification, the

conversion time is about 10 us when the clock is 50 MHz .

Huddar, S.R. , Rupanagudi, S.R. , Kalpana, M. , Mohan, S. [7]

presented With the advent of new technology in the fields of

VLSI and communication, there is also an ever growing

demand for high speed processing and low area design. It is

also a well known fact that the multiplier unit forms an

integral part of processor design. Due to this regard, high

speed multiplier architectures become the need of the day. In

this paper, we introduce a novel architecture to perform high

speed multiplication using ancient Vedic maths techniques.

Jaina, D, Sethi, K. , Panda, R. [8] presented Real-time signal

processing requires high speed and high throughput

Multiplier-Accumulator (MAC) unit that consumes low

power, which is always a key to achieve a high performance

digital signal processing system. In this paper, design of MAC

unit is proposed. The multiplier used inside the MAC unit is

based on the Sutra "Urdhva Tiryagbhyam" (Vertically and

Cross wise) which is one of the Sutras of Vedic mathematics.

Vedic mathematics is mainly based on sixteen Sutras and was

rediscovered in early twentieth century. In ancient India, this

Sutra was traditionally used for decimal number

multiplications within less time. The same concept is applied

for multiplication of binary numbers to make it useful in the

digital hardware.

G.P. Saggese , L. Romano[9] presented An accelerator which

can effectively improve the security and the performance of

virtually any RSA cryptographic application. The accelerator

integrates two crucial security- and performance enhancing

facilities: an RSA processor and an RSA key-store. An RSA

processor is a dedicated hardware block which executes the

RSA algorithm. An RSA key-store is a dedicated device for

securely storing RSA key-pairs. We chose RSA since it is by

far the most widely adopted standard in public key

cryptography[10].

III.

The RSA algorithm involves three steps: key generation,

encryption and decryption.

1.

Key generation :

RSA involves a public key and a private key. The public key

can be known by everyone and is used for encrypting

messages. Messages encrypted with the public key can only be

decrypted in a reasonable amount of time using the private

key[11]. The keys for the RSA algorithm are generated the

following way:

1.

2.

PROPOSED WORK

easy to find and multiply the large prime numbers together,

but it is extremely difficult to factor their product. The public

and private keys in RSA are based on very large prime

numbers[10]. The algorithm is simple but the complexity lies

in the selection and generation of public and private keys. The

algorithm steps are as follows:

3.

4.

For security purposes, the integers p and q should be

chosen at random, and should be of similar bit-length.

Prime integers can be efficiently found using a

primality test.

Compute n = pq.

n is used as the modulus for both the public and

private keys. Its length, usually expressed in bits, is

the key length.

Compute (n) = (p)(q) = (p 1)(q 1) = n - (p + q

-1), where is Euler's totient function.

Choose an integer e such that 1 < e < (n) and gcd(e,

(n)) = 1; i.e., e and (n) are coprime.

e is released as the public key exponent.

e having a short bit-length and small Hamming

weight results in more efficient encryption most

commonly 216 + 1 = 65,537. However, much smaller

163

_______________________________________________________________________________________

Volume: 3 Issue: 1

ISSN: 2321-8169

162 - 164

_______________________________________________________________________________________________

5.

secure in some settings.

Determine d as d e1 (mod (n)); i.e., d is the

multiplicative inverse of e (modulo (n)

This is more clearly stated as: solve for d given de

1 (mod (n))

This is often computed using the extended Euclidean

algorithm. Using the pseudocode in the Modular

integers section, inputs a and n correspond to e and

(n), respectively.

d is kept as the private key exponent.

The public key consists of the modulus n and the public (or

encryption) exponent e. The private key consists of the

modulus n and the private (or decryption) exponent d, which

must be kept secret. p, q, and (n) must also be kept secret

because they can be used to calculate d.

2.

Encryption :

A transmits its public key (n, e) to B and keeps the private key

d secret. B then wishes to send message P to A , then

computes the ciphertext C corresponding to

[3]

[4]

[5]

[6]

[7]

[8]

C = P (mod n)

This can be done efficiently, even for 500-bit numbers, using

Modular exponentiation. B then transmits C to A[10].

[9]

3.

Decryption :

A can recover P from C by using its private key exponent d

via computing

[10]

P = C (mod n)

[11]

[12]

IV.

CONCLUSION

The RSA encryption/decryption system is implemented using

the Vedic Mathematics algorithm to increase its computation

speed. The advantage of the Vedic multiplier is that it

calculates the partial products in one single step and there are

no shift operations which saves the time and the hardware. As

the number of message bits increases the gate delay as well as

the area increase slowly. Hence it can be used effectively in all

the cryptographic applications. It is found that this design is

quite efficient in terms of silicon area and speed and should

result in substantial savings of resources in hardware when

used for crypto and security applications.

[13]

Based on Digit Serial Computation IEEE Trans. Ind.

Electron., vol. 57, no. 10, pp. 33083316, Oct. 2010.

E. Monmasson and M. N. Cirstea, FPGA design

methodology for industrial control systemsA review,

IEEE Trans. Ind. Electron., vol. 54, no. 4, pp. 18241842,

Aug. 2007.

J. J. Rodriguez-Andina, M. J. Moure, and M. D. Valdes,

Features, design tools, and application domains of

FPGAs, IEEE Trans. Ind. Electron., vol. 54, no. 4, pp.

18101823, Aug. 2007.

R. L. Rivest, A. Shamir, and L. Adleman, A method for

obtaining digital signatures and public-key cryptosystems,

Commun. ACM, vol. 21, no. 2, pp. 120126, Feb. 1978.

Xiaoming Tang ; Res. Inst. of Inf. Fusion, Naval Aeronaut.

& Astronaut. Univ., Yantai, China; Tao Zhang ; Zhenjie

Wang ; Wenliang Yuan, A novel data format conversion

method based on FPGA IEEE Trans. Ind. Electron ,July

2011.

Huddar, S.R. ; WorldServe Educ., Bangalore, India ;

Rupanagudi, S.R. ; Kalpana, M. ; Mohan, S. , Novel high

speed vedic mathematics multiplier using compressors

IEEE Trans. Ind. Electron ,March 2013.

Jaina, D. ; Dept. of Electron. & Telecommun. Eng., VSS

Univ. of Technol., Burla, India ; Sethi, K. ; Panda, R,

Vedic Mathematics Based Multiply Accumulate Unit

IEEE Trans. Ind. Electron ,Oct. 2011.

G.P. Saggese a, L. Romano a,*, N. Mazzocca b, A.

Mazzeo, A tamper resistant hardware accelerator for RSA

cryptographic applications, Journal of Systems Architecture

50 (2004) 711727 .

William Stallings, Cryptography and Nework Security,

Third Edition, Pearson Education, 2003

S.E. Eldridge, C.D. Walter, Hardware Implementation of

Montgomerys modular multiplication algorithm, IEEE

Trans. Comput. 42 (6) (1993) 693699.

A.Z. Alkar, R. So nmez, An ASIC Implementation of the

RSA Algorithm 18th MUG International Conference,

February 2002.

Sumit Vaidya, Deepak Dandekar, Delay-Power

Performance Comparison of multipliers in VLSI circuit

design, International Journal of Computer Networks &

Communications (IJCNC), Vol.2, No.4, July 2010.

REFERENCES

[1]

[2]

Eng. Coll., Trichy, India ; Kumar, K.S. ; Prabakar, T.N ,

Design and FPGA implementation of binary squarer using

Vedic mathematics IEEE Trans. Ind. Electron., July 2013.

Gustavo D. Sutter, Member, IEEE, Jean-Pierre Deschamps,

and Jos Luis Imaa , Modular Multiplication and

164

_______________________________________________________________________________________

- Secure Image Encryption Using Filter Bank and Addition Modulo 28 with Exclusive OR CombinationUploaded byAI Coordinator - CSC Journals
- DNA Crypt FinalUploaded byHwang Waisen
- FMIPv6 Based Secure Binding Update Authentication in Wireless Vehicular NetworksUploaded bynot_jason
- Lecture03-1sUploaded byพูลพิพัฒน์ สุขเกษม
- 028Uploaded byAminudin Jaya
- Synopsis of ThesisUploaded byhimanshus13
- dbmslecture7Uploaded byTajul Islam
- BsnUploaded byUmamageswari Kumaresan
- A Comprehensive Study of Cryptography & Content Hiding Techniques for Security of Digital VideosUploaded byIJAFRC
- ho16.pdfUploaded bydinudineshbhawnani2916
- Jamming Attacks First ReviewUploaded byNeeta Bangalur
- VPNUploaded bykiransawant11
- SSL Key Generation Weaknesses | Bishop FoxUploaded byMatthew Irwin
- Fpga Implementation of Automated Encryption Standard AlgorithmUploaded bybalajithriller
- Jit Dynamic CryptosystemUploaded byInternational Journal of Research in Engineering and Technology
- An Enhanced Security Enabled Sharing of Protected Cloud Storage Services by Trapdoor Commitment Based on RSA Signature AssumptionUploaded byBONFRING
- UNIT 5Uploaded bySubramanya Manjunath
- PARC4-I: PARALLEL IMPLEMENTATION OF ENHANCED RC4A USING PASCS AND LOOP UNROLLING MECHANISMUploaded byAnonymous IlrQK9Hu
- 1303.1048.pdfUploaded byVinayak Nadar
- Multi-Dimensional Range Query Over Encrypted DataUploaded byМилош Пантовић
- cloud.docxUploaded byBhaskar Rao P
- Packetpushers NetUploaded byCiprian Laurentiu Cazanel
- usec15-eskandariUploaded byjhon
- sample 4Uploaded byharitha
- Crypto VizUploaded bypipul36
- IJETR032902Uploaded byerpublication
- A Prototype Implementation for Public Key Infrastructure Based on Transport Layer SecurityUploaded byAnonymous vQrJlEN
- NEM TechRefUploaded bydazeee
- wp_mid-IIUploaded byJeevankumar Chandu
- RssUploaded bymarshal robert

- a clustering and associativity analysis based probabilistic method for web page predictionUploaded byrahul sharma
- Regression Based Comparative Study for Continuous BP Measurement Using Pulse Transit TimeUploaded byEditor IJRITCC
- Channel Estimation Techniques over MIMO-OFDM SystemUploaded byEditor IJRITCC
- A Review of Wearable Antenna for Body Area Network ApplicationUploaded byEditor IJRITCC
- Safeguarding Data Privacy by Placing Multi-level Access RestrictionsUploaded byEditor IJRITCC
- space complexity analysis of rsa and ecc based security algorithms in cloud dataUploaded byrahul sharma
- A Review of 2D &3D Image Steganography TechniquesUploaded byEditor IJRITCC
- IJRITCC Call for Papers (October 2016 Issue) Citation in Google Scholar Impact Factor 5.837 DOI (CrossRef USA) for each paper, IC Value 5.075Uploaded byEditor IJRITCC
- Performance Analysis of Image Restoration Techniques at Different NoisesUploaded byEditor IJRITCC
- Comparative Analysis of Hybrid Algorithms in Information HidingUploaded byEditor IJRITCC
- Importance of Similarity Measures in Effective Web Information RetrievalUploaded byEditor IJRITCC
- 7 1534938100_22-08-2018Uploaded byEditor IJRITCC
- Fuzzy Logic A Soft Computing Approach For E-Learning: A Qualitative ReviewUploaded byEditor IJRITCC
- Modeling Heterogeneous Vehicle Routing Problem with Strict Time ScheduleUploaded byEditor IJRITCC
- Network Approach based Hindi Numeral RecognitionUploaded byEditor IJRITCC
- Efficient Techniques for Image CompressionUploaded byEditor IJRITCC
- A Study of Focused Web Crawling TechniquesUploaded byEditor IJRITCC
- Prediction of Crop Yield Using LS-SVMUploaded byEditor IJRITCC
- Predictive Analysis for Diabetes using TableauUploaded byEditor IJRITCC
- Simulation of Vector Controlled Adjustable Speed System of Doubly Fed Induction MachineUploaded byEditor IJRITCC
- iTimer - Count On Your TimeUploaded byEditor IJRITCC
- Hybrid Algorithm for Enhanced Watermark Security with Robust DetectionUploaded byEditor IJRITCC
- 48 1530871571_06-07-2018.pdfUploaded byrahul sharma
- IoT and Fingerprint Based Door Looking SystemUploaded byEditor IJRITCC
- Kinematic Hardening Parameters Identification with Finite Element Simulation of Low Cycle Fatigue using Genetic Algorithm ApproachUploaded byEditor IJRITCC
- image restoration techniques using fusion to remove motion blurUploaded byrahul sharma
- a content based region separation and analysis approach for sar image classificationUploaded byrahul sharma

- BabelEllipticCurve.pdfUploaded byAndrew Biranto
- Implementation of Rekeying Mechanism for Node Authentication in Wireless Sensor NetworksUploaded byijassnjournal
- SAFE PosterUploaded byBob Bethel Benson
- AES-Ver1-AU-CEGUploaded byliza
- IncompatibleUploaded byneeraj
- Future of Online BankingUploaded bynikhil91190
- Hids and NidsUploaded byCarlon Baird
- Configuring Vpns With Overlapping NetworksUploaded byAndrew Antonopoulos
- VIC CipherUploaded byCasandra Edwards
- Configuring IPSec Between a Cisco IOS Router and a Cisco VPN Client 4.x for Windows Using RADIUS for User AuthenticationUploaded byjames Spywang
- emvpubUploaded byDen Maz Poer
- Brochure Nokia CheckpointUploaded byriskilana
- Final PaperUploaded byRay El Rey
- NSX v Security Configuration Guide Ver2.1Uploaded byShady El-Malatawey
- SY0-101 Comptia Security+Uploaded byWillyTorres
- Homework 2- Authentication_KerberosV5Uploaded byAnonymous QlHCfcQ1Qb
- Chapter 3Uploaded bysetharus
- deffi helmen 1Uploaded bySaurabh Gupta
- 02 Feb Network Security Portable PenetratorUploaded bySunil Kankal
- Sac - Case Studies 1427401Uploaded bySuresh Gundala
- Konica bizhub423SeriesUserGuideUploaded byAndi Kalaci
- Cryptography Dan BonehUploaded byFilip Blagojević
- D2T2 - Jean-Baptiste Bédrune & Jean Sigwald - iPhone Data Protection in DepthUploaded byxsniperpandax
- Common CredentialsUploaded bymathewkylescribd
- Lsvpn Palo AltoUploaded byHarshit Bhattaram
- TPM-Main-Part-1-Design-Principles_v1.2_rev116_01032011.pdfUploaded byJitendra Singh Rauthan
- Unit 8Uploaded byTin Sioco
- Palo Alto WildfireUploaded byxhagix
- Rogue Access PointsUploaded byFarsightwarrior01
- Study and Implementation of various Cryptographic techniquesUploaded byawake9

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.