A Hybridized Honey Encryption for Data Security using Residue Number System

Abstract

Different encryption algorithms such as Advanced Encryption Standard (AES), Rivest, Shamir, Adleman (RSA) were proposed to protect the privacy of the data. However, most of these existing methods are vulnerable to a brute-force attack because the cipher text remains unintelligible until the original data is found. Consequently, this problem prompted researchers to introduce honey encryption (HE). HE helps to withstand the vulnerability of the encryption algorithms in brute force attacks making transmitted data more secure and efficient. Hence to reduce processing time we proposed a hybridized HE with Residue Number System. Traditional Moduli Set {2n-1, 2n, 2n+1} was used to generate the Key while Chinese Remainder Theorem (CRT), and HE technique were used for decrypting the data, based on the Distribution Transformation Decoder. Thus, anytime an attacker tries to access the data, so long the length of the guessed key is the same as the original key, the HE algorithm will generate meaningful but fake data, this helps to deter an attacker from further threat. The result showed that the proposed system was able to withstand brute force attacks with less processing time compared to other systems. N-values for the moduli set used were varied against encryption and decryption time. Comparing the obtained results with the existing system, the proposed system processing time was faster and more secure.