발간년도 : [2024]
| 논문정보 |
|
| 논문명(한글) |
[Vol.19, No.3] A Comparative Analysis of Performance Between RSA and Elliptic Curve Cryptography |
|
| 논문투고자 |
Jae-Yeon Choi |
|
| 논문내용 |
In this paper, we present a comparative analysis of elliptic curve cryptography and RSA known as one of the public key encryption algorithm methods. Currently, much research in the field of digital cryptography and public key cryptography is conducted with encryption systems based on public key cryptography algorithms, and encryption systems based on elliptic curves are presented as an alternative to public key encryption systems. The efficiency of an encryption algorithm is determined by several parameters, one of which is the length of the key. In order to provide strong security, public key cryptography systems use larger key sizes, and larger key sizes allow degradation of processing performance. As a result, processing speed decreases and memory usage increases. The encryption algorithms with small key sizes and high security are increasingly required in the end. The security of public key cryptography systems is based on the integer factorization problem, while the security of elliptic curve cryptography is based on the discrete logarithm problem of elliptic curves. An important concern about elliptic curve cryptography is that the best known algorithms for solving the discrete logarithm problem of elliptic curves take full exponential time, while solving integer factorization in public key cryptography takes partial exponential time. We demonstrate that much smaller parameters can be used in elliptic curve cryptography than in public key cryptography systems at the same level of security. We present a comparative analysis of performance and security based on key length comparison and encryption and decryption time for data according to security strength in public key cryptography systems and elliptic curve cryptography. |
|
| 첨부논문 |
|
|
|
|
|
자료실 > 논문지 
