查看文章

The RSA algorithm (Rivest-Shamir-Adleman) is a public key cryptographic algorithm used in the process of encrypting symmetric cryptographic keys or private keys. The RSA algorithm relies on the difficulty of finding a large number to factor into prime factors. The RSA algorithm has a slower speed than the symmetric cryptographic algorithm, this means that the multiplication process of the numbers used is very large, more than 1024-bits. The number multiplication process requires special algorithms such as Montgomerry, Karatsuba, and Chinese Remainders. Based on this problem, this research attempts to develop an RSA algorithm library that uses the Schönhage-Strassen algorithm. The library will be developed using the SDLC (Software Development Life Cycle) methodology and the RAD (Ravid Application Development) method. After the library can be developed, the library will be tested with other multiplication algorithms, namely, Montgomerry, Karatsuba, and Chinese Remainder. The test results from this study have different values, where the Schönhage-Strassen algorithm has good performance, but not on all key variants.