scholarly journals ANALISA PERBANDINGAN LSB STEGANOGRAFI ANTARA SHIFTING DAN RANDOM COLOR

Repositor ◽  
2021 ◽  
Vol 3 (2) ◽  
Author(s):  
Agus Eko Minarno
Keyword(s):  
Cover Image ◽  
Least Significant Bit ◽  
Secret Image

Steganografi merupakan teknik untuk menyembunyikan keberadaan data ke dalam data lain sehingga keberadaannya tidak diketahui. Sehingga selain pengirim dan penerima tidak ada yang mengetahui isi dari pesan tersebut dan tidak mudah untuk dicurigai. Beberapa algoritma yang cocok dengan teknik steganography, salah satunya yaitu algoritma LSB (Least Significant Bit). Algoritma LSB sendiri sudah dikembangkan oleh beberapa penelitian sebelumnya, yaitu menjadi algoritma LSB Random Color dan algoritma LSB Shifting. Dua algoritma tersebut merupakan algoritma yang terbaru dari algoritma LSB. Beberapa penelitian sebelumnya melakukan pengujian algoritma LSB random color dan algoritma LSB shifting dengan menggunakan data yang berbeda, dan hasil penelitian sebelumnya tidak melakukan perbandingan mana yang lebih baik dari dua algoritma tersebut. Dalam penelitian ini penulis membuat penelitian dengan judul analisa perbandingan LSB steganografi antara shifting dan random color. Pengujian diukur dengan menghitung nilai MSE dan PSNR pada file stegano image. Penelitian ini menggunakan 2 jenis file cover image yaitu berwarna dan hitam putih dengan jumlah masing-masing 3 file yang berbeda, dan menggunakan 1 file secret image yang sama. Sehingga diperoleh hasil perbandingan bahwasannya algoritma LSB random color memiliki performa lebih baik, meskipun mengunakan jenis file berwarna atau hitam putih

scholarly journals Design and Implementation of Lifting Based Wavelet and Adaptive LSB Steganography to Secret Data Sharing Through Image on FPGA

2018 ◽  
Vol 8 (03) ◽  
Author(s):  
Kokila B. Padeppagol ◽  
Sandhya Rani M H
Keyword(s):  
Wavelet Transform ◽  
Discrete Wavelet Transform ◽  
Image Data ◽  
Image Steganography ◽  
Cover Image ◽  
Discrete Wavelet ◽  
Least Significant Bit ◽  
Secret Data ◽  
Secret Image ◽  
Design And Implementation

Image steganography is an art of hiding images secretly within another image. There are several ways of performing image steganography; one among them is the spatial approach.The most popular spatial domain approach of image steganography is the Least Significant Bit (LSB) method, which hides the secret image pixel information in the LSB of the cover image pixel information. In this paper a LSB based steganography approach is used to design hardware architecture for the Image steganography. The Discrete Wavelet Transform (DWT) is used here to transform the cover image into higher and lower wavelet coefficients and use these coefficients in hiding the secret image. the design also includes encryption of secret image data, to provide a higher level of security to the secret image. The steganography system involving the stegno module and a decode module is designed here. The design was simulated, synthesized and implemented on Artix -7 FPGA. The operation hiding and retrieving images was successfully verified through simulations.

scholarly journals Analisa Perbandingan LSB Steganografi Random Color pada Operasi Bilangan Bit XOR

Repositor ◽  
2020 ◽  
Vol 2 (5) ◽  
pp. 627
Author(s):  
Rohsih Hana Sundari ◽  
Sofyan Arifianto ◽  
Zamah Sari
Keyword(s):  
Cover Image ◽  
Least Significant Bit ◽  
Secret Image

Steganografi merupakan teknik untuk menyembunyikan keberadaan data ke dalam data lain sehingga keberadaannya tidak diketahui. Sehingga selain pengirim dan penerima tidak ada yang mengetahui isi dari pesan tersebut dan tidak mudah untuk dicurigai[1]. Beberapa algoritma yang cocok dengan teknik steganography, salah satunya yaitu algoritma LSB (Least Significant Bit). Algoritma LSB juga dikembangkan di beberapa penelitian seperti LSB Shifting dan LSB Random Color. LSB Random color merupakan algoritma yang menyisipkan nilai bit ke dalam warna pixel (RGB). Penyisipan pesan ke dalam cover image dilakukan dengan cara perkalian XOR pixel pada bit terakhir warna green dan bit terakhir nilai ASCI dari password. Hasil XOR akan menentukan posisi bit secret image dalam menggantikan nilai bit terakhir pada cover image. Penelitian ini bertujuan untuk  menganalisa dan membandingkan LSB steganografi random color pada operasi bilangan XOR dan tanpa operasi bilangan XOR. Proses menentukan posisi bit secret image pada LSB tanpa XOR akan dilakukan menggunakan nilai ASCII dari password. Pengujian diukur dengan menghitung nilai MSE dan PSNR pada file stegano image. Penelitian ini menggunakan 3 jenis file cover image berwarna dengan jumlah masing-masing file yang berbeda, dan menggunakan 1 file secret image yang sama. Hasil perbandingan membuktikan algoritma LSB random color tanpa XOR memiliki hasil yang lebih baik daripada random color tanpa XOR dengan nilai MSE sebesar 0,44375 dan PSNR sebesar 51,65945 dB, sedangkan random color dengan XOR bernilai MSE sebesar 0,47955 dan PSNR sebesar 51,32245 dB.

scholarly journals A New Digital Image Steganography Based on Center Embedded Pixel Positioning

2021 ◽  
Vol 21 (2) ◽  
pp. 89-104
Author(s):  
Dedi Darwis ◽  
Akmal Junaidi ◽  
Dewi Asiah Shofiana ◽  
Wamiliana
Keyword(s):  
Digital Image ◽  
Image Steganography ◽  
Cover Image ◽  
Least Significant Bit ◽  
Bottom Part ◽  
New Approach ◽  
Secret Image ◽  
Lsb Matching ◽  
Two Sides ◽  
Sequential Cropping

Abstract In this study we propose a new approach to tackle the cropping problem in steganography which is called Center Embedded Pixel Positioning (CEPP) which is based on Least Significant Bit (LSB) Matching by setting the secret image in the center of the cover image. The evaluation of the experiment indicated that the secret image can be retrieved by a maximum of total 40% sequential cropping on the left, right, up, and bottom of the cover image. The secret image also can be retrieved if the total asymmetric cropping area is 25% that covered two sides (either left-right, left-up or right-up). In addition, the secret image can also be retrieved if the total asymmetric cropping area is 70% if the bottom part is included. If asymmetric cropping area included three sides, then the algorithm fails to retrieve the secret image. For cropping in the botom the secret image can be extracted up to 70%.

scholarly journals Robust Secret Image Sharing Resistant to Noise in Shares

2021 ◽  
Vol 17 (1) ◽  
pp. 1-22
Author(s):  
Xuehu Yan ◽  
Lintao Liu ◽  
Longlong Li ◽  
Yuliang Lu
Keyword(s):  
Chinese Remainder Theorem ◽  
Recovery Phase ◽  
Error Correcting Codes ◽  
Secret Image Sharing ◽  
Data Loss ◽  
Least Significant Bit ◽  
Recovery Method ◽  
Secret Image ◽  
Image Sharing ◽  
Salt And Pepper

A secret image is split into   shares in the generation phase of secret image sharing (SIS) for a  threshold. In the recovery phase, the secret image is recovered when any   or more shares are collected, and each collected share is generally assumed to be lossless in conventional SIS during storage and transmission. However, noise will arise during real-world storage and transmission; thus, shares will experience data loss, which will also lead to data loss in the secret image being recovered. Secret image recovery in the case of lossy shares is an important issue that must be addressed in practice, which is the overall subject of this article. An SIS scheme that can recover the secret image from lossy shares is proposed in this article. First, robust SIS and its definition are introduced. Next, a robust SIS scheme for a  threshold without pixel expansion is proposed based on the Chinese remainder theorem (CRT) and error-correcting codes (ECC). By screening the random numbers, the share generation phase of the proposed robust SIS is designed to implement the error correction capability without increasing the share size. Particularly in the case of collecting noisy shares, our recovery method is to some degree robust to some noise types, such as least significant bit (LSB) noise, JPEG compression, and salt-and-pepper noise. A theoretical proof is presented, and experimental results are examined to evaluate the effectiveness of our proposed method.

scholarly journals Flip Extended Visual Cryptography for Gray-Scale and Color Cover Images

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 65
Author(s):  
Lu Wang ◽  
Bin Yan ◽  
Hong-Mei Yang ◽  
Jeng-Shyang Pan
Keyword(s):  
Privacy Protection ◽  
Visual Cryptography ◽  
Color Images ◽  
Cover Image ◽  
Error Diffusion ◽  
Gray Scale ◽  
Secret Image ◽  
Transaction Security

Visual cryptography (VC) has found numerous applications in privacy protection, online transaction security, and voting security, etc. To counteract potential cheating attacks, Lin et al. proposed flip visual cryptography in 2010, where a second secret image can be revealed by stacking one share with a flipped version of another share. The second secret image can be designed as an additional verification mechanism. However, Lin’s scheme produces meaningless shares and is only applicable to binary secret images. It is interesting to explore whether it is possible to extend the flip VC to having cover images (i.e., extended VC) and these cover images are color images. This problem is challenging since too many restricting conditions need to be met. In this paper, we designed a flip VC for gray-scale and color cover images based on constraint error diffusion. We show that it is possible to meet all the constraints simultaneously. Compared with existing schemes, our scheme enjoys the following features: Color cover images, no computation needed for decoding, and no interference from cover image on the recovered secret image.

scholarly journals Two-level hiding an encrypted image

2020 ◽  
Vol 18 (2) ◽  
pp. 961
Author(s):  
Faten H. MohammedSediq Al-Kadei
Keyword(s):  
Research Area ◽  
Cover Image ◽  
Perceptual Quality ◽  
Fingerprint Image ◽  
Bank Account ◽  
Secret Image ◽  
Encrypted Image ◽  
Encrypted Images ◽  
In The Beginning ◽  
Rgb Image

<p><span>Encryption and hiding images are becoming a hot research area and a broad prospect for application. This article uses a secure algorithm with Low Significant Bit method to hide an encrypted high-resolution color bitmap image in two selectively color images (i.e., two cover images). The paper introduces a two-level hiding encrypted image using MATLAB-GUI programming language. In the beginning, with a key image using XOR bit operation, the original RGB image is encrypted. After that, the encrypted image is hidden into the first cover image. The cover image is then hidden into another cover to make the secret image safer without changing the perceptual quality for both covers. Then, the algorithm is tested on many bitmap images, which can be an important image, fingerprint image, samples of secret medicine, or bank account pattern. The correlation histograms demonstrate a high correlation for all encrypted images. The PSNR is used to find steganography quality for the two cover images after hiding the secret image showing a high quality for the two levels of hiding operation</span></p>

scholarly journals A Novel (2, 3)-Threshold Reversible Secret Image Sharing Scheme Based on Optimized Crystal-Lattice Matrix

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2063
Author(s):  
Jiang-Yi Lin ◽  
Ji-Hwei Horng ◽  
Chin-Chen Chang
Keyword(s):  
Crystal Lattice ◽  
Three Dimensional ◽  
Lattice Models ◽  
Cover Image ◽  
Secret Image Sharing ◽  
Secret Data ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Growth Phenomenon

The (k, n)-threshold reversible secret image sharing (RSIS) is technology that conceals the secret data in a cover image and produces n shadow versions. While k (kn) or more shadows are gathered, the embedded secret data and the cover image can be retrieved without any error. This article proposes an optimal (2, 3) RSIS algorithm based on a crystal-lattice matrix. Sized by the assigned embedding capacity, a crystal-lattice model is first generated by simulating the crystal growth phenomenon with a greedy algorithm. A three-dimensional (3D) reference matrix based on translationally symmetric alignment of crystal-lattice models is constructed to guide production of the three secret image shadows. Any two of the three different shares can cooperate to restore the secret data and the cover image. When all three image shares are available, the third share can be applied to authenticate the obtained image shares. Experimental results prove that the proposed scheme can produce secret image shares with a better visual quality than other related works.

scholarly journals Modified Lsb For Hiding Encrypted Kurdish Text Into Digital Image

2019 ◽  
Vol 7 (4) ◽  
pp. 254
Author(s):  
Nada E. Tawfiq
Keyword(s):  
Digital Image ◽  
Text Message ◽  
Cover Image ◽  
Second Phase ◽  
Original Image ◽  
Text File ◽  
Least Significant Bit ◽  
Text Information ◽  
Embedded Technique ◽  
Lsb Substitution

Image files can hide text without their size being affected too much. This process called steganography which allows hiding text in images without any suspicions from intruders. This paper addresses an improved LSB substitution algorithm for hiding Kurdish text information written in text file into digital image as steganography technique. The algorithm consists of two main phases, the first phase holds the encryption of the Kurdish text message and the embedded technique while the second phase hold the message extraction followed by decryption to get the original code of each character. The algorithm contains many procedures to enhance this process. Least Significant Bit method is used to hide the Kurdish text, in order to keep the features and characteristics of the original image. Applying the proposed approach shows that it seems work in a best case by hiding and retrieving text from the digital image which is used as a carrier of this text. Delphi 2010 was used to simulate both encrypt-embedded phase and extract-decrypt phase, and the results were obtained with high and security which proved the efficiency of the algorithm, where the hidden Kurdish text didn’t make any distortion or change over the cover image.

Hiding Images Using Dynamic Bit-Replacement and Human Visual System

2002 ◽  
pp. 190-205
Author(s):  
Chin-Chen Chang ◽  
Kuo-Feng Hwang
Keyword(s):  
Visual System ◽  
Human Visual System ◽  
Main Idea ◽  
Cover Image ◽  
Two Dimensional ◽  
Hiding Capacity ◽  
Partial Encryption ◽  
Secret Image ◽  
Threshold Mechanism ◽  
Human Eyes

A simple image hiding scheme in spatial domain is proposed in this chapter. The main idea is to utilize a threshold mechanism to embed as much information of the secret image into the cover image as possible. The changing of the cover image is hard to be discovered by the human eyes because the threshold mechanism is setup especially to fit the human visual system. The experimental results show that the human visual system has improved the quality in terms of perceptibility. On the hiding capacity issue, the proposed method has capability to embed two times the size of the secret image of previous work. A partial encryption strategy is used for the security of the secret image. In addition, a two-dimensional permutation function, torus automorphism, is also introduced in this chapter.

scholarly journals A n-out-of-n Sharing Digital Image Scheme by Using Color Palette

Electronics ◽  
2019 ◽  
Vol 8 (7) ◽  
pp. 802
Author(s):  
Ching-Nung Yang ◽  
Qin-Dong Sun ◽  
Yan-Xiao Liu ◽  
Ci-Ming Wu
Keyword(s):  
Digital Image ◽  
Shadow Image ◽  
Cover Image ◽  
Secret Message ◽  
Secret Image Sharing ◽  
Color Palette ◽  
Secret Image ◽  
Image Sharing

A secret image sharing (SIS) scheme inserts a secret message into shadow images in a way that if shadow images are combined in a specific way, the secret image can be recovered. A 2-out-of-2 sharing digital image scheme (SDIS) adopts a color palette to share a digital color secret image into two shadow images, and the secret image can be recovered from two shadow images, while any one shadow image has no information about the secret image. This 2-out-of-2 SDIS may keep the shadow size small because by using a color palette, and thus has advantage of reducing storage. However, the previous works on SDIS are just 2-out-of-2 scheme and have limited functions. In this paper, we take the lead to study a general n-out-of-n SDIS which can be applied on more than two shadow. The proposed SDIS is implemented on the basis of 2-out-of-2 SDIS. Our main contribution has the higher contrast of binary meaningful shadow and the larger region in color shadows revealing cover image when compared with previous 2-out-of-2 SDISs. Meanwhile, our SDIS is resistant to colluder attack.

Sign in / Sign up

Export Citation Format

Share Document