Implementation of Steganography Modified Least Significant Bit using the Columnar Transposition Cipher and Caesar Cipher Algorithm in Image Insertion
Steganography technique is a technique to hide data or information into other media such as digital images, text, sound, or video. One of the simplest methods of Steganography in the concept of Steganography is the Least Significant Bit. The Least Significant Bit (LSB) method hides the message by in...
Gespeichert in:
Veröffentlicht in: | Journal of physics. Conference series 2021-06, Vol.1898 (1), p.12003 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Steganography technique is a technique to hide data or information into other media such as digital images, text, sound, or video. One of the simplest methods of Steganography in the concept of Steganography is the Least Significant Bit. The Least Significant Bit (LSB) method hides the message by inserting the message at the lower or rightmost bits in the cover work file as a medium to hide the message. Caesar Cipher is one method that replaces each letter in the plaintext with letters that are at odds with certain numbers in the alphabet. Columnar transposition Cipher is one method in which messages are written in rows of a specified length, then are read column by column in the order of reading based on a keyword. The message is inserted into the cover image with the target pixel determination to be inserted based on the results of the Caesar Cipher process of the Columnar Transposition Cipher index to the random value of the Multiply With Carry Generator algorithm. The system implementation uses the C# programming language. The results of this study indicate that the implementation of a combination of Caesar Cipher, Columnar Transposition Cipher, and Multiply With Carry Generator can maintain the confidentiality, integrity, and security of data. |
---|---|
ISSN: | 1742-6588 1742-6596 |
DOI: | 10.1088/1742-6596/1898/1/012003 |