Browsing by Author "Ayisat Wuraola Asaju-Gbolagade"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    An Enhanced Message Encryption Approach Using Residue Number System
    (Kasu Journal of Computer Science, 2024) Akeem Femi Kadri; Kafayat Odunayo Tajudeen; Ayisat Wuraola Asaju-Gbolagade
    Safe transmission of messages over the internet is ensured by data security. The data should be protected against unauthorized access and transmitted to the legal recipient safely and formally called cryptography. The well-known cryptography types are asymmetric and symmetric and different symmetric encryption algorithms such as Advanced Encryption Standard (AES), Data Encryption Standard (DES), Blowfish were proposed to protect the confidentiality of the transmitted and stored data. However, most of these symmetric techniques are vulnerable to brute-force attack because the cipher text remains unintelligible for the original data to be found. Consequently, this challenge prompted researchers to introduce Residue Number System for encryption. RNS helps to withstand the vulnerability of the encryption algorithms in brute-force attacks making transmitted and stored data more secure. Hence, this paper introduced encryption by using RNS to improve the security of transmitted data. Traditional moduli set set {𝑚1=2𝑛−1,𝑚2= 2𝑛 𝑎𝑛𝑑 𝑚3=2𝑛+1} and Chinese Remainder Theorem (CRT) were used to encrypt and decrypt the data based on information exchange. Furthermore, this is done by representing each character in the plaintext data is assigned a unique number value and which is done by converting each character into its ASCII value and the ASCII value is then converted to Excess-3 value. Thus, anytime an attacker tries to access the data, the RNS algorithm will generate residues data, this helps to discourage an attacker from further threat. The result showed that the proposed system was able to resist brute-force attacks compared to others systems. Values of n for the moduli set were dynamic against encryption and decryption of data.
  • Thumbnail Image
    Item
    Hybrid Algorithm for Symmetric Based Fully Homomorphic Encryption
    (ICAI: International Conference on Applied Informatics, 2021-10-23) Kamaldeen Jimoh Muhammed; Rafiu Mope Isiaka; Ayisat Wuraola Asaju-Gbolagade; Kayode Sakariyah Adewole; Kazeem Alagbe Gbolagade
    Fully Homomorphic Encryption (FHE) supports realistic computations on encrypted data and hence it is widely proposed to be used in cloud computing to protect the integrity and privacy of data stored in the cloud. The existing symmetric-based FHE schemes suffer from insecurity against known plaintext/ciphertext attacks and generate a large ciphertext size that required a large bandwidth to transfer the ciphertext over the network. To ameliorate these weaknesses is the aim of this paper. A hybrid algorithm for symmetric-based Fully Homomorphic Encryption that combines N-prime model and Matrix Operation for Randomization and Encryption with Secret Information Moduli Set (MORESIMS) is proposed. The results show that the proposed hybrid symmetric-based FHE framework satisfied homomorphism properties with robust inbuilt security that resists known plaintext, ciphertext and statistical attacks. The ciphertext size produced by the proposed hybrid framework is less than 4 times of its equivalent plaintext size with a considerable encryption execution time and fast decryption time. Thus, guaranteed to provide optimum performance and reliable solutions for securing integrity and privacy of user’s data in the cloud.