2013 International Conference on IT Convergence and Security (ICITCS) 2013
DOI: 10.1109/icitcs.2013.6717816
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of ECC and RSA Algorithm in Resource Constrained Devices

Abstract: Nowadays, the usage of resource constrained devices is increasing and these devices are primarily working with sensitive data. Consequently, data security has become crucial for both producers and users. Limitation of resources is deemed as the major issue that makes these devices vulnerable. Attackers might exploit these limitations to get access to the valuable data. Therefore, carefully chosen and practically tested encryption algorithm must be applied to increase the device efficiency and mitigate the risk… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 66 publications
(29 citation statements)
references
References 12 publications
0
27
0
Order By: Relevance
“…where p is the prime value. Because of the advantage of ECC, which has a shorter key length and faster calculation speed compared with RSA algorithm [14], as solving the elliptic curve discrete logarithm problem (ECDLP) is more difficult than factoring an integer, the application of it has become a very popular research topic in cryptography. To be specific, the elliptic curve must be a cyclic group over a finite field GF(p), given a base point g called a generator with order r, and given Q = tg, t ∈ Z r .…”
Section: Elliptic Curve Cryptographymentioning
confidence: 99%
“…where p is the prime value. Because of the advantage of ECC, which has a shorter key length and faster calculation speed compared with RSA algorithm [14], as solving the elliptic curve discrete logarithm problem (ECDLP) is more difficult than factoring an integer, the application of it has become a very popular research topic in cryptography. To be specific, the elliptic curve must be a cyclic group over a finite field GF(p), given a base point g called a generator with order r, and given Q = tg, t ∈ Z r .…”
Section: Elliptic Curve Cryptographymentioning
confidence: 99%
“…However, the performance of recoding algorithms depends on the hardware system implementation and memory storage [16] and [19]. Efficient recoding must have recoding rules that are efficient, simple, and consumes less memory [20].…”
Section: Related Workmentioning
confidence: 99%
“…However, it increases the value [6], which implies more time and memory is consumed as it requires more operation during pre-computation. It is important to make a trade-off between the performances categories according to the target objective for implementation [16].…”
Section: Introductionmentioning
confidence: 99%
“…So that other users can access files with their keys and access permission will be decided by owner of that data. In 2013, M Bafandehkar et al [20] implement ECC and RSA algorithms for resource constrained devices to compare the performance of both algorithms in small hand held devices. They compare the ECC with key size of 160 bit and RSA with key size 1024 bit.…”
Section: Related Workmentioning
confidence: 99%