2012
DOI: 10.1016/j.proeng.2012.01.842
|View full text |Cite
|
Sign up to set email alerts
|

An efficient hardware model for RSA Encryption system using Vedic mathematics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(9 citation statements)
references
References 1 publication
0
8
0
Order By: Relevance
“…The Comparison between proposed Vedic divider and restoring divider is shown in table (1). As from the table this divider helps in future to make fast processors.…”
Section: Resultsmentioning
confidence: 96%
“…The Comparison between proposed Vedic divider and restoring divider is shown in table (1). As from the table this divider helps in future to make fast processors.…”
Section: Resultsmentioning
confidence: 96%
“…The author of [14] has stated that for providing security to information cryptography involves privacy, confidentiality, key exchange, authentication, and non-repudiation. The author of [15] has stated that RSA is standard algorithm that use Public-key, Private-key for providing security to data in networks.…”
Section: Review Of Literaturementioning
confidence: 99%
“…Shift operation is not necessary because the partial product calculation will perform it in a single step, which in turn saves time and power. This is the main advantage of the Vedic multiplier [14].…”
Section: B Urdhava Triyagbhayam Sutramentioning
confidence: 99%