2008 Third International Conference on Convergence and Hybrid Information Technology 2008
DOI: 10.1109/iccit.2008.179
|View full text |Cite
|
Sign up to set email alerts
|

A Comparative Study of the Performance and Security Issues of AES and RSA Cryptography

Abstract: Security is always a major concern in the field of communication. Advanced Encryption Standard (AES) and RivestShamir-Adleman (RSA) algorithms are the two popular encryption schemes that guarantee confidentiality and authenticity over an insecure communication channel. There has been trifling cryptanalytic progress against these two algorithms since their advent. This paper presents the fundamental mathematics behind the AES and RSA algorithm along with a brief description of some cryptographic primitives that… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
46
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 102 publications
(54 citation statements)
references
References 7 publications
(4 reference statements)
0
46
0
Order By: Relevance
“…There are many cryptography algorithms used to secure information such as DES, 3DES, Blowfish, AES, RSA, ElGamal and Paillier [2]. All of these algorithms are unique on it's way.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…There are many cryptography algorithms used to secure information such as DES, 3DES, Blowfish, AES, RSA, ElGamal and Paillier [2]. All of these algorithms are unique on it's way.…”
Section: Literature Reviewmentioning
confidence: 99%
“…RSA is an asymmetric cryptographic algorithm [2] which is also used for encryption and decryption of the message. RSA is widely used in transferring of keys over an insecure channel.…”
Section: B Asymmetric Cryptographymentioning
confidence: 99%
“…In the original RSA, the probability of failure against this attack will be decreased considerably by choosing exponents larger than 2048 bits [9] butthe combination of HE-RSA makes this algorithm has significant resistance brute force attack even with 1024 bits exponents.…”
Section: A Brute Force Attackmentioning
confidence: 99%
“…Timing attack is a side channel attack, in which the attacker determines private exponent by calculating the time with exploiting the timing variation of the modular exponentiation [12].Timing attack in original RSA may be prevented by including a random delay to the exponentiation algorithm or multiplying the cipher-text with a random number [9] while dual encryption in HE-RSA will protect the transferred message from the timing attack and it is not necessary for multiplying the cipher-text.…”
Section: B Timing Attackmentioning
confidence: 99%
See 1 more Smart Citation