Implementasi Algoritma Quicksort Untuk Pembangkitan Kunci Algoitma RSA Pada Pengamanan Data Audio

Abstract

The RSA algorithm has two keys, namely the public key and the private key. This algorithm has security which lies in the difficulty in calculating discrete algorithms. Both encryption and decryption keys are integers. The RSA algorithm is a type of asymmetric cryptography algorithm, which consists of two keys, namely the public key for encryption and the private key for decryption. In the RSA algorithm, the distributed key is a public key which is not required to be kept secret while the private key is either stored or not distributed. Everyone who has the public key can perform the encryption process but the results of the encryption can only be read by the person who has the private key. To increase the strength of the algorithm, the key used to perform the encryption and decryption process will be modified first using a randomization algorithm, namely the Quicksort Algorithm. The Quicksort algorithm is a sorting algorithm developed by Tony Hoare, the average sorting performance is O (n log n) to sort n items. The purpose of using the Quicksort algorithm is to make the resulting key more difficult to guess, making it difficult for cryptanalysts to read the message or information.