Kombinasi Algoritma Kriptografi RSA, Algoritma Fermat dan Algoritma Kompresi Huffman pada Pesan Teks

Abstract

One of the aspects that must be considered in the process of sending messages is the security aspect, the message sender wants the message can be kept confidential from parties who are not interested, not a security issue is to be thought. Users are also thinking about the size of the message sent so as to accelerate the delivery of messages. This research combines the RSA cryptographic algorithm, Fermat and Huffman compression on text messages, each message in the security process, generating prime numbers and compression. To make the process of securing a message on RSA cryptography algorithm started from the formation of the key generation algorithm Fermat primes, while the Huffman compression algorithm used for the compression process of the message. The process of merging the three algorithms is done in two stages, namely the encryption-compression stage is used to process the message security and compression, while decompression-decryption stage is used to return the message to its original shape both the content and size. RSA cryptography algorithm will always result in a larger message size of plaintext, while the Huffman compression algorithm is a reduction of the size of text messages. Percentage of the compression ratio is influenced by appearance of the same character when the encrypted message (ciphertext), while the speed of the compression process is influenced by the length of the character.