Security in delivering messages is essential, because it is useful to keep the confidentiality of the information distributed. Therefore, the message encoding or H-Rabin cryptography is necessary so that the negligent party does not easily detect or know the contents of the data. H-Rabin's excess of cryptography is to rely more on its security at the power of factoring one large integer into three large prime factor factors, making it safer than some attacks. The H-Rabin encryption process generates a larger file size. This leads to slower file delivery. Therefore, Golomb Rice's compression method is necessary to deliver fast and accurate file delivery. Golomb Rice has a very suitable code for situations where the occurrence of small value in the input flow is significantly more likely than the large value. In this study, the authors performed cryptocompression, which was a merger of the H-Rabin cryptographic algorithms and the Golomb Rice compression algorithm. The research will be conducted two phases of testing, namely the stage of encryption and compression process, and then continued with the process of decompression and decryption. The system implementation uses the C# programming language. The results showed that the H-Rabin cryptographic algorithm with the Golomb Rice compression algorithm was able to perform the message security process and be able to restore the already secured messages. From the test results that have been done that the file type does not affect processing time. In the compression result, the Ratio of Compression (RC), Compression of Ratio (CR), Space Savings (SS), and Bitrate of cipher files using the same H-Rabin key has no distinct value even though the original file size is used differently.
展开▼
