z-logo
open-access-imgOpen Access
Data Hiding in Digital Image for Efficient Information Safety Based on Residue Number System
Author(s) -
Joseph B. Eseyin,
Kazeem Alagbe Gbolagade
Publication year - 2021
Publication title -
asian journal of research in computer science
Language(s) - English
Resource type - Journals
ISSN - 2581-8260
DOI - 10.9734/ajrcos/2021/v8i430208
Subject(s) - steganography , encryption , computer science , chinese remainder theorem , information hiding , cryptography , embedding , theoretical computer science , digital image , computer security , data transmission , digital signature , image (mathematics) , computer engineering , algorithm , computer hardware , image processing , artificial intelligence , hash function
The mass dispersal of digital communication requires the special measures of safety. The need for safe communication is greater than ever before, with computer networks now managing almost all of our business and personal affairs. Information security has become a major concern in our digital lives. The creation of new transmission technologies forces a specific protection mechanisms strategy particularly in data communication state.  We proposed a steganography method in this paper, which reads the message, converting it into its Residue Number System equivalent using the Chinese Remainder Theorem (CRT), encrypting it using the Rivest Shamir Adleman (RSA) algorithm before embedding it in a digital image using the Least Significant Bit algorithm of steganography and then transmitting it through to the appropriate destination and from which the information required to reconstruct the original message is extracted. These techniques will enhance the ability to hide data and the hiding of ciphers in steganographic image and the implementation of CRT will make the device more efficient and stronger. It reduces complexity problems and improved execution speed and reduced the time taken for processing the encryption and embedding competencies.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here