|
" Improving Data Security with Honey Encryption and Residue Number System "
Afoluwaso Giwa, Tawakalitu
Gbolagade, Kazeem
| Document Type
|
:
|
Latin Dissertation
|
| Language of Document
|
:
|
English
|
| Record Number
|
:
|
1112004
|
| Doc. No
|
:
|
TLpq2512684619
|
| Main Entry
|
:
|
Afoluwaso Giwa, Tawakalitu
|
|
|
:
|
Gbolagade, Kazeem
|
| Title & Author
|
:
|
Improving Data Security with Honey Encryption and Residue Number System\ Afoluwaso Giwa, TawakalituGbolagade, Kazeem
|
| College
|
:
|
Kwara State University (Nigeria)
|
| Date
|
:
|
2020
|
| student score
|
:
|
2020
|
| Degree
|
:
|
M.S.
|
| Page No
|
:
|
92
|
| Abstract
|
:
|
In everyday life, data is being transmitted, either through offline or online. As technology advances online transmission of data gets more attentions, and as a result unauthorized people try to intrude the privacy of the data being transmitted, hence the security of this data is at stake. Many companies and organizations use various techniques to secure their data before sending it through unsecure network. Attackers try to hack this data using various method like brute-force attack. Different encryption algorithms were used to protect the privacy of the data. However, most of the existing methods are vulnerable to brute-force attack because, the ciphertext remain unintelligible and unmeaningful until original data is found. Consequently, this problem prompted researchers to introduce honey encryption (HE). Honey encryption helps eliminate vulnerability of the encryption algorithms in brute force attacks, so as to make transmitted data more secure and efficient. Though, Honey Encryption eliminate brute force attack completely but, its problem is that, it works only on numeric data. Hybridization of ‘HE’ with other encryption algorithm like AES (Advanced Encryption Standard) was carried out by some researchers, to also prevent text data from brute force attack which leads to computational problem and slow processing time. The problem of slow processing time make us proposed a hybridized HE with Residue Number System. A particular Moduli Set was used to generate the Key while CRT (Chinese Remainder Theorem) together with HE technique was used for decrypting the data, based on the Distribution Transformation Decoder. When the attacker attempts to access the encrypted data by entering the incorrect key, instead of rejecting the access, the HE algorithm generates an indistinguishable bogus but meaningful data, this helps to deter attacker from trying further. The proposed system was able to eliminate brute force attack and with less processing time compare to other systems. The graph of n-values for the moduli set used was plotted against encryption and decryption time, the message length was also varied and plotted against processing time, a graph was plotted to compare the efficiency of the proposed system to the existing one, and some observations were noted. Comparing the obtained results with the existing hybridized Honey Encryption, the proposed system processing time is faster and more secure because the ciphertext produced is deceiving and to decrypt it, it require lot of efforts like finding the sequence of algorithms used, getting the moduli set used, determine the value of n for the moduli set, knowing the character table and also determining the Distribution Transformation Encoder style of the Honey Encryption.
|
| Subject
|
:
|
Computer science
|
| |