Analisis Perbandingan Ketahanan Metode Steganografi LSB dan BPCS Menggunakan Metode Steganalisis Binary Similarity Measures
DOI:
https://doi.org/10.24002/jbi.v3i1.317Abstract
Abstract. Least significant bit (LSB) and Bit Plane Complexity Segmentation (BPCS) are two of the most commonly used steganoraphy methods. LSB is relatively simple and can be quickly implemented while BPCS offers an advantage in the capacity of storing hidden messages. These two methods are considered good if and only if the hidden messages in each of them are robust from a steganalysis implementation. This research specifically performs the robustness checks for both methods by using the Binary Similarity Measures (BSM). BSM measures the correlations between bits in a bit-plane to detect the message hidden in an image. Our test results show that the larger the size of the message hidden by using the BPCS method, the smaller is its detection probability. On the contrary, the size of the hidden message is directly proportional to its probability of being discovered in the LSB method.
Keywords: steganography, Least Significant Bit, Bit Plane Complexity Segmentation, steganalysis, Binary Similarity Measures
Â
Abstrak. Least Significant Bit (LSB) dan Bit Plane Complexity Segmentation (BPCS) merupakan dua metode steganografi yang umum digunakan. LSB dapat diimplementasikan secara cepat dan sederhana sedangkan BPCS menawarkan kelebihan dalam penampungan kapasitas pesan rahasia. Agar dapat dikatakan sebagai metode steganografi yang baik maka kedua metode tersebut harus dapat mempertahankan pesan yang disisipkan dari serangan metode steganalisis. Penelitian yang dilakukan bertujuan untuk mengetahui ketahanan dari masing-masing metode menggunakan metode steganalisis Binary Similarity Measures (BSM). BSM mengukur korelasi antar bit-bit dalam suatu bit-plane untuk mengetahui keberadaan pesan pada citra. Hasil penelitian mengungkapkan bahwa semakin besar pesan yang disisipkan pada suatu citra menggunakan metode BPCS, maka kemungkinan terdeteksinya pesan akan berkurang. Hal ini berbanding terbalik dengan metode LSB dimana ukuran pesan yang disisipkan berbanding lurus dengan kemungkinan terdeteksinya pesan tersebut.
Kata Kunci: Steganografi, Least Significant Bit, Bit Plane Complexity Segmentation, Steganalisis, Binary Similarity Measures
Published
Issue
Section
License
Copyright of this journal is assigned to Jurnal Buana Informatika as the journal publisher by the knowledge of author, whilst the moral right of the publication belongs to author. Every printed and electronic publications are open access for educational purposes, research, and library. The editorial board is not responsible for copyright violation to the other than them aims mentioned before. The reproduction of any part of this journal (printed or online) will be allowed only with a written permission from Jurnal Buana Informatika.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.