• Journal of the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.27-33
• /
• 2018

This paper presents a new adaptive LSB steganography for high capacity in spatial color images. The number of least signi ficant bit (LSB) of each RGB component in a color image pixel, to replace with the data bits to be hidden, was determine d through analysis of the worst case peak signal noise ratio (PSNR). In addition, the combination of the number of bits is determined adaptively according to image content. That is, 70% of the data to be hidden is proposed to be replaced with 3 bit LSB of two components, 2 bit LSB of the rest component, and 30% be replaced with 4 bit LSB of each RGB compon ent. To find edge areas in an image, delta sorting in local area is also suggested. Using the proposed method, the data cap acity is 9.2 bits per pixel (bpp). The average PSNR value of the tested images with concealed data of up to 60Kbyte was 43.9 db and also natural histograms were generated.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.57-63
• /
• 1998

This paper describes a CMOS digital-to-analog converter to apply a newly-developed digital-to-analog conversion algorithm. The CMOS digital-to-analog converter has been designed by using 1.2$\mu\textrm{m}$ MOSIS SCMOS parameter and simulated for the performance. The simulated results have shown that the digital-to-analog converter has 200MHz of the maximum conversion rate, 7.41mW of the DC power consumption, and ${\pm}$0.08LSB of INL and ${\pm}$0.098LSB of DNL in 8-b.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3A
• /
• pp.399-405
• /
• 2000

In this paper, we deal with block cipher algorithm IDEA(international data encryption algorithm), previously known as typical block cipher system. first of all, analysing key scheduler we classify the key sequences with the used key bit and the unused key bits in each round. with this properties we propose the two method, which are differential analysis using differences of plaintext pairs and linear analysis using LSB bit of plaintexts and key sequences.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.507-513
• /
• 2018

Steganography is a technique that uses hidden messages to prevent anyone apart from knowing the existence of a secret message, except the sender and trusted recipients. This paper applies 24 bit color image as cover medium. And a 24-bit color image has three components corresponding to red, green and blue. This paper proposes an image steganography method that uses Triple-A algorithm to hide the secret (Hangul) message by arbitrarily selecting the number of LSB bits and the color channel to be used. This paper divides the secret character into the chosung, jungsung and jongsung, and applies crossover, encryption and arbitrary insertion positions to enhance robustness and confidentiality. Experimental results of the proposed method show that insertion capacity and correlation are excellent and acceptable image quality level. Also, considering the image quality, it was confirmed that the size of LSB should be less than 2.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.3
• /
• pp.277-282
• /
• 2018

The goal of the secret message communication on the internet is to maintain invisibility and confidentiality. Digital steganography is a technique in which a secret message is inserted in a cover medium and transmitted to a destination so that a third party can not perceive the existence of the message itself. Steganography is an efficient method for ensuring confidentiality and integrity together with encryption techniques. In order to insert a secret (Hangul) message, I propose a image steganography method that the secret character is separated and converted into binary code with reference to the encryption table, the cover image is divided into two areas, and the secret message and the right l-LSB information of the second area are encrypted and crossed, concealing the k-LSB of the first region. The experimental results of the proposed method show that the PSNR value is 52.62 and the acceptable image quality level.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.799-801
• /
• 2001

Wong 은 디지털 영상의 인증과 무결성을 위해 해쉬 함수와 암호화 알고리즘을 공간 영역상에서 적용하였다. 본 논문에서는 웨이블릿 변환 영역 상에서 Wong 의 방법을 토대로 하여 fragile 워터마킹 방법을 제안한다. 즉, 삽입할 워터마크를 LSB 만 아니라 웨이블릿 계수의 비트 플래인을 고정시키지 않고 삽입함으로써, 워터마크의 삽입이 LSB에 고정되는 Wong 방법의 단점을 보완하였다. 실험결과 약간의 변형에도 영상의 변형 유무와 변형된 위치를 확인할 수 있었다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.6
• /
• pp.289-300
• /
• 2001

본 논문에서는 유한 필드 GF(2$_{m}$ ) 상에서 모듈러 곱셈 A($\chi$)B($\chi$) mod P($\chi$)을 수행하는 새로운 선형 문제-크기(full-size) 시스톨릭 어레이 구조인 LSB-first 곱셈기를 제안한다. 피연산자 B($\chi$)의 LSB(least significant bit)를 먼저 사용하는 LSB-first 모듈러 곱셈 알고리즘으로부터 새로운 비트별 순환 방정식을 구한다. 데이터의 흐름이 규칙적인 순환 방정식을 공간-시간 변환으로 새로운 시스톨릭 곱셈기를 설계하고 분석한다. 기존의 곱셈기와 비교할 때 제안한 곱셈기의 면적-시간 성능이 각각 10%와 18% 향상됨을 보여준다. 또한 같은 설계방법으로 곱셈과 제곱연산을 동시에 수행하는 새로운 시스톨릭 곱셈/제곱기를 제안한다. 유한 필드상의 지수연산을 위해서 제안한 시스톨릭 곱셈/제곱기를 사용할 때 곱셈기만을 사용 할 때보다 면적-시간 성능이 약 26% 향상됨을 보여준다.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.181-185
• /
• 2005

In this paper, the DWT(Discrete Wavelet Transform) based watermarking method for authentication and detection of image modification was proposed. The proposed algorithm inserts watermark into high frequency domain after 1-level wavelet transform by exchanging wavelet coefficients and embeds the characteristic values of high frequency domain of original image into the LSB part of watermarked image. Therefore, By extracting LSB values and watermark in the high frequency domain from the watermarked image, we can authenticate the image and detect modified positions.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.575-578
• /
• 2003

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of zero-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZP-DFS, which needs no additional memory when running SPIHT algorithm. It traverses a spatial-tree according to DFS and eliminates additional memory as it uses test-functions for encoding and LSB bits of coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in hardware implementation because no additional memory is required. Moreover. it exploits parallelism to process each spatial-tree that it can be applied well in real-time image compression.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.321-327
• /
• 2004

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of toro-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZC-BFS, which needs no additional memory when running SPIHT algorithm. It explicitly performs a breadth first search of the spatial-tree using peano-code and eliminates additional memory as it uses pre-status significant test for encoding and LSB bits of some coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in fast and simple hardware implementation and reduces the cost of production because no lists and additional memory are required.