Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Jurnal Buana Informatika Community Empowerment
I Putu Edy Suardiyana Putra
Institut Pariwisata Dan Bisnis Internasional, Denpasar, Indonesia
Arts Humanities Computer Science & IT Education Public Health Social Sciences

Published : 4 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 4 Documents
Search

 1 
Analisis Perbandingan Ketahanan Metode Steganografi LSB dan BPCS Menggunakan Metode Steganalisis Binary Similarity Measures Sanjaya ER, Ngurah Agus; Suardiyana Putra, I Putu Edy
Jurnal Buana Informatika Vol 3, No 1 (2012): Jurnal Buana Informatika Volume 3 Nomor 1 Januari 2012
Publisher : Universitas Atma Jaya Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

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
Analisis Perbandingan Ketahanan Metode Steganografi LSB dan BPCS Menggunakan Metode Steganalisis Binary Similarity Measures Sanjaya ER, Ngurah Agus; Suardiyana Putra, I Putu Edy
Jurnal Buana Informatika Vol 3, No 1 (2012): Jurnal Buana Informatika Volume 3 Nomor 1 Januari 2012
Publisher : Universitas Atma Jaya Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24002/jbi.v3i1.317

Abstract

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
Analisis Perbandingan Ketahanan Metode Steganografi LSB dan BPCS Menggunakan Metode Steganalisis Binary Similarity Measures Ngurah Agus Sanjaya ER; I Putu Edy Suardiyana Putra
Jurnal Buana Informatika Vol. 3 No. 1 (2012): Jurnal Buana Informatika Volume 3 Nomor 1 Januari 2012
Publisher : Universitas Atma Jaya Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24002/jbi.v3i1.317

Abstract

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
Assisting the management of digital library in Tegal Harum Village Denpasar Denok Lestari; Ni Luh Supartini; Ni Made Ayu Sulasmini; I Putu Edy Suardiyana Putra
Community Empowerment Vol 7 No 8 (2022)
Publisher : Universitas Muhammadiyah Magelang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31603/ce.7613

Abstract

This community service activity under the scheme of applying science and technology for the community is in partnership with the village of Tegal Harum, Denpasar Bali, in the field of digital library management. The Sastra Mahottama Library in Tegal Harum Village, apart from providing conventional services, also provides digital library services through the SIPESAT application (Digital Library Application) in Tegal Harum Village, which makes it easier for people to borrow various types of e-books according to their needs. Problems faced by the library managers are related to the classification and cataloguing of library materials, as well as increasing the capacity of human resources for digital library managers. The implementation using the classical and individual methods lasts for one month at the Tegal Harum village office. Activities consist of situation analysis, training, and evaluation stages. The implications of service activities are the results of the classification and cataloguing of 30% of reading collections as well as increasing knowledge and skills in using digital library applications.
Co-Authors Denok Lestari Ngurah Agus Sanjaya ER Ni Luh Supartini Ni Made Ayu Sulasmini