발간년도 : [2024]
| 논문정보 |
|
| 논문명(한글) |
[Vol.19, No.4] Study of Key Generation Process in RSA Public Key Cryptosystem |
|
| 논문투고자 |
Jae-Yeon Choi |
|
| 논문내용 |
The RSA cryptosystem, a public key cryptosystem, is currently the most widely used asymmetric cryptosystem, although elliptic curves and discrete logarithm systems are being developed. RSA has many applications, but in reality, it is most commonly used for the following purposes: Small-scale data encryption for key transmission and digital signatures on the Internet. However, it should be noted that RSA encryption is not intended to replace symmetric cryptosystems, as it is several times slower than cryptosystems such as AES, and this is because performing RSA or other public key algorithms requires a lot of computation. Therefore, the main purpose of the cryptosystem is to securely exchange session keys with symmetric cryptosystems. In practice, RSA is often used with symmetric cryptosystems such as AES, which actually perform bulk data encryption. The basic one-way function of RSA is the integer factorization problem. Multiplying two large prime numbers is computationally easy, but factoring the resulting product is very difficult. Euler's theorem and Euler's pi function play an important role in RSA. In the following, we first explain how encryption, decryption, and key generation work, and then discuss the practical aspects of RSA. |
|
| 첨부논문 |
|
|
|
|
|
자료실 > 논문지 
