Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Omolara, Abiodun Esther"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    A Hybridized Honey Encryption for Data Security using Residue Number System
    (International Journal of Information Security and Cybercrime, 2023-09-12) Giwa, Afoluwaso Tawakalitu; Abiodun, Oludare Isaac; Omolara, Abiodun Esther; Isiaka, Mope Rafiu
    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.

KWASU Library Services © 2023, All Right Reserved

  • Cookie settings
  • Send Feedback
  • with ❤ from dspace.ng