Teknik Peningkatan Performa Algoritma RSA dalam Pengamanan Data Dokumen

Abstract

Advances in information system technology have allowed for the extensive exchange of data between users without spatial and temporal restrictions, but they also carry security risks related to information confidentiality. To overcome this, cryptography has become a commonly used solution. One popular cryptographic technique is RSA (Rivest- Shamir-Adleman), a public-key cryptosystem that is powerful but requires significant computation time, especially at larger key lengths. In an effort to improve the performance of the RSA algorithm, various techniques such as iteration, Divide and Conquer, and Square and Multiply have been developed. Testing is performed on document text files of various key lengths to evaluate encryption and decryption performance. The results show that all three algorithms experience an increase in computation time as the key length increases. The iteration algorithm shows the best performance for short keys, while the square and multiply algorithm provides the highest efficiency on medium to long keys. Further testing recommends the use of square and multiply for keys 128 bits and above due to its superior efficiency. Therefore, it can be concluded that the selection of the right supporting algorithm can overcome RSA performance problems without compromising security, as well as provide suggestions for further security analysis and more efficient algorithm development.