• Title/Summary/Keyword: Least Significant Bit(LSB)

Search Result 64, Processing Time 0.025 seconds

Selective Shuffling for Hiding Hangul Messages in Steganography (스테가노그래피에서 한글 메시지 은닉을 위한 선택적 셔플링)

  • Ji, Seon-su
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.3
    • /
    • pp.211-216
    • /
    • 2022
  • Steganography technology protects the existence of hidden information by embedding a secret message in a specific location on the cover medium. Security and resistance are strengthened by applying various hybrid methods based on encryption and steganography. In particular, techniques to increase chaos and randomness are needed to improve security. In fact, the case where the shuffling method is applied based on the discrete cosine transform(DCT) and the least significant bit(LSB) is an area that needs to be studied. I propose a new approach to hide the bit information of Hangul messages by integrating the selective shuffling method that can add the complexity of message hiding and applying the spatial domain technique to steganography. Inverse shuffling is applied when extracting messages. In this paper, the Hangul message to be inserted is decomposed into the choseong, jungseong and jongseong. It improves security and chaos by applying a selective shuffling process based on the corresponding information. The correlation coefficient and PSNR were used to confirm the performance of the proposed method. It was confirmed that the PSNR value of the proposed method was appropriate when compared with the reference value.

Spatial Error Concealment Technique for Losslessly Compressed Images Using Data Hiding in Error-Prone Channels

  • Kim, Kyung-Su;Lee, Hae-Yeoun;Lee, Heung-Kyu
    • Journal of Communications and Networks
    • /
    • v.12 no.2
    • /
    • pp.168-173
    • /
    • 2010
  • Error concealment techniques are significant due to the growing interest in imagery transmission over error-prone channels. This paper presents a spatial error concealment technique for losslessly compressed images using least significant bit (LSB)-based data hiding to reconstruct a close approximation after the loss of image blocks during image transmission. Before transmission, block description information (BDI) is generated by applying quantization following discrete wavelet transform. This is then embedded into the LSB plane of the original image itself at the encoder. At the decoder, this BDI is used to conceal blocks that may have been dropped during the transmission. Although the original image is modified slightly by the message embedding process, no perceptible artifacts are introduced and the visual quality is sufficient for analysis and diagnosis. In comparisons with previous methods at various loss rates, the proposed technique is shown to be promising due to its good performance in the case of a loss of isolated and continuous blocks.

NDFT-based Image Steganographic Scheme with Discrimination of Tampers

  • Wang, Hongxia;Fan, Mingquan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.12
    • /
    • pp.2340-2354
    • /
    • 2011
  • A new and secure image steganographic scheme based on nonuniform discrete Fourier transform (NDFT) is proposed in this paper. First, the chaotic system is introduced to select embedding points randomly in NDFT domain suitable range, and NDFT is implemented on every non-overlapping block of eight consecutive pixels. Second, the secret messages are scrambled by chaotic systems, and embedded into frequency coefficients by quantization method. The stego-image is obtained by inverse NDFT (INDFT). Besides, in order to discriminate tampers, the low frequency wavelet coefficients of 7 most significant bits (MSBs) of the stego-image are converted into the binary sequence after nonuniform scalar quantization. Then the obtained binary sequence is scrambled by the chaotic systems, and embedded into the least significant bit (LSB) of the stego-image. Finally, the watermarked stego-image can be obtained by a new improved LSB steganographic method. The embedded secret messages can be extracted from the watermarked stego-image without the original cover image. Experimental results show the validity of the proposed scheme, and dual statistics attacks are also conducted to indicate the security.

A Blind Watermarking Algorithm using CABAC for H.264/AVC Main Profile (H.264/AVC Main Profile을 위한 CABAC-기반의 블라인드 워터마킹 알고리즘)

  • Seo, Young-Ho;Choi, Hyun-Jun;Lee, Chang-Yeul;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2C
    • /
    • pp.181-188
    • /
    • 2007
  • This paper proposed a watermark embedding/extracting method using CABAC(Context-based Adaptive Binary Arithmetic Coding) which is the entropy encoder for the main profile of MPEG-4 Part 10 H.264/AVC. This algorithm selects the blocks and the coefficients in a block on the bases of the contexts extracted from the relationship to the adjacent blocks and coefficients. A watermark bit is embedded without any modification of coefficient or with replacing the LSB(Least Significant Bit) of the coefficient with a watermark bit by considering both the absolute value of the selected coefficient and the watermark bit. Therefore, it makes it hard for an attacker to find out the watermarked locations. By selecting a few coefficients near the DC coefficient according to the contexts, this algorithm satisfies the robustness requirement. From the results from experiments with various kinds and various strengths of attacks the maximum error ratio of the extracted watermark was 5.02% in maximum, which makes certain that the proposed algorithm has very high level of robustness. Because it embeds the watermark during the context modeling and binarization process of CABAC, the additional amount of calculation for locating and selecting the coefficients to embed watermark is very small. Consequently, it is highly expected that it is very useful in the application area that the video must be compressed right after acquisition.

Image Steganography Using Random Permutation and Image Difference (임의 순열과 영상차를 이용한 영상 스테가노그래피)

  • Kim, Chanran;Lee, Sang Hwa;Park, Hanhoon;Park, Jong-Il
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2016.06a
    • /
    • pp.231-234
    • /
    • 2016
  • 본 논문에서는 전송하고자 하는 원영상 대신에 전혀 다른 영상을 전송하여 원영상 정보를 보호하는 스테가노그래피(steganography) 기법을 제안한다. 전송할 영상의 자연스러움을 잃어버리지 않으면서 원영상을 복구할 수 있는 차영상 정보를 LSB(Least Significant Bit)에 담고, 픽셀간의 위치 관계를 무작위로 섞어 줌으로써, 원영상을 보호하는 기법을 제안한다. 본 논문에서는 우선 원영상과 전송할 영상 (cover image)의 차영상을 생성하고, 각 픽셀의 차이값을 큰 범위로 양자화하여 차영상의 데이터 크기를 줄인다. 그리고, 각 픽셀의 차이값을 전송할 영상의 4 픽셀에 걸쳐서 하위 2bit 에 나누어 담는다. 8bit 영상에서 하위 2 bit 를 다루기 때문에, 각 채널 밝기값의 최대 차이값은 3 으로 설정되어 자연스럽게 영상을 생성할 수 있다. 끝으로 신호의 보호를 위하여 차영상의 픽셀과 전송할 영상의 픽셀간의 대응위치를 무작위 순열로 변환하여 외부에서 쉽게 복원할 수 없도록 한다. 이러한 스테가노그래피 제안 기법을 통하여 원영상 대신에 커버 영상을 전송함으로써, 자연스러운 정보전송이 가능하며, 외부의 감시와 복원에 안전한 정보보호 기능이 강화될 수 있다. 여러 영상에 대한 실험을 통한 제안 기법에 의하면, 전송되는 커버 영상이 자연스럽기 때문에 외부에서 정보가 숨겨진 사실을 느끼지 못하며, 송수신 장치에 내장된 무작위 순열을 통하여 외부에서는 원영상 정보를 복구하는 것도 매우 어렵게 되어 있음을 확인하였다. 본 제안 기법은 군사통신이나 중요한 정보를 다루는 기관에서의 정보 전달 및 정보보호 시스템에서 사용될 수 있다.

  • PDF

An Algorithm for Switching from Arithmetic to Boolean Masking with Low Memory (저메모리 기반의 산술 마스킹에서 불 마스킹 변환 알고리즘)

  • Kim, HanBit;Kim, HeeSeok;Kim, TaeWon;Hong, SeokHie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.1
    • /
    • pp.5-15
    • /
    • 2016
  • Power analysis attacks are techniques to analyze power signals to find out the secrets when cryptographic algorithm is performed. One of the most famous countermeasure against power analysis attacks is masking methods. Masking types are largely classified into two types which are boolean masking and arithmetic masking. For the cryptographic algorithm to be used with boolean and arithmetic masking at the same time, the converting algorithm can switch between boolean and arithmetic masking. In this paper we propose an algorithm for switching from boolean to arithmetic masking using storage size at less cost than ones. The proposed algorithm is configured to convert using the look-up table without the least significant bit(LSB), because of equal the bit of boolean and arithmetic masking. This makes it possible to design a converting algorithm compared to the previous algorithm at a lower cost without sacrificing performance. In addition, by applying the technique at the LEA it showed up to 26 percent performance improvement over existing techniques.

All-Optical Gray Code to Binary Coded Decimal Converter (전광 그레이코드 이진코드 변환기)

  • Jung, Young-Jin;Park, Nam-Kyoo;Jhon, Young-Min;Woo, Deok-Ha;Lee, Seok
    • Korean Journal of Optics and Photonics
    • /
    • v.19 no.1
    • /
    • pp.60-67
    • /
    • 2008
  • An all-optical 4-bit Gray code to binary coded decimal (BCD) converter by means of commercially available numerical analysis tool (VPI) was demonstrated, for the first time to our knowledge. Circuit design approach was modified appropriately in order to fit the electrical method on an all-optical logic circuit based on a cross gain modulation (XGM) process so that signal degradation due to the non-ideal optical logic gates can be minimized. Without regenerations, Q-factor of around 4 was obtained for the most severely degraded output bit (least significant bit-LSB) with 2.5 Gbps clean input signals having 20 dB extinction ratio. While modifying the two-level simplification method and Karnaugh map method to design a Gray code to BCD converter, a general design concept was also founded (one-level simplification) in this research, not only for the Gray code to BCD converter but also for any general applications.

A Secure Digital Watermarking Scheme based on RSA Function (RSA 함수에 기반한 안전한 워터마킹 기법)

  • Lee, Jean-Ho;Kim, Tai-Yun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.3
    • /
    • pp.220-228
    • /
    • 2001
  • Digital watermarking is a technique for the purpose of protecting the ownership of the image by embedding invisible watermarks in a digital imnge. To guarantee the security of the digital watermarking scheme for copyright protection, it is required to satisfy some requirements robustness and perceptual invisibility which provided by the location of embedded bits, the public watermarking algorithm, and the hidden use of the key, which can protect unauthorized accesses from illegal users. For this, in this paper we propose a new copyright watermarking scheme, which is based on one-way hash functions using RSA functions and modular operations. RSA functions are widely used in cryptographic systems. Our watermarking scheme is robust against LSB(Jeast significant bit) attacks and gamma corresction attack, and is also perceptually invisible. We demonstrate the characteristics of our proposed watermarking scheme through experiments.

  • PDF

Detection of LSB Matching Revisited Using Pixel Difference Feature

  • Li, Wenxiang;Zhang, Tao;Zhu, Zhenhao;Zhang, Yan;Ping, Xin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.10
    • /
    • pp.2514-2526
    • /
    • 2013
  • This paper presents a detection method for least significant bit matching revisited (LSBMR) steganography. Previous research shows that the adjacent pixels of natural images are highly correlated and the value 0 appears most frequently in pixel difference. Considering that the message embedding process of LSBMR steganography has a weighted-smoothing effect on the distribution of pixel difference, the frequency of the occurrence of value 0 in pixel difference changes most significantly whereas other values approximately remain unchanged during message embedding. By analyzing the effect of LSBMR steganography on pixel difference distribution, an equation is deduced to estimate the frequency of difference value 0 using the frequencies of difference values 1 and 2. The sum of the ratio of the estimated value to the actual value as well as the ratio of the frequency of difference value 1 to difference value 0 is used as the steganalytic detector. Experimental results show that the proposed method can effectively detect LSBMR steganography and can outperform previous proposed methods.

A 10-bit 100 MSPS CMOS D/A Converter with a Self Calibration Current Bias Circuit (Self Calibration Current Bias 회로에 의한 10-bit 100 MSPS CMOS D/A 변환기의 설계)

  • 이한수;송원철;송민규
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.11
    • /
    • pp.83-94
    • /
    • 2003
  • In this paper. a highly linear and low glitch CMOS current mode digital-to-analog converter (DAC) by self calibration bias circuit is proposed. The architecture of the DAC is based on a current steering 6+4 segmented type and new switching scheme for the current cell matrix, which reduced non-linearity error and graded error. In order to achieve a high performance DAC . novel current cell with a low spurious deglitching circuit and a new inverse thermometer decoder are proposed. The prototype DAC was implemented in a 0.35${\mu}{\textrm}{m}$ n-well CMOS technology. Experimental result show that SFDR is 60 ㏈ when sampling frequency is 32MHz and DAC output frequency is 7.92MHz. The DAC dissipates 46 mW at a 3.3 Volt single power supply and occupies a chip area of 1350${\mu}{\textrm}{m}$ ${\times}$750${\mu}{\textrm}{m}$.