• Title/Summary/Keyword: one-bit transform

Search Result 64, Processing Time 0.022 seconds

Experimental Design of S box and G function strong with attacks in SEED-type cipher (SEED 형식 암호에서 공격에 강한 S 박스와 G 함수의 실험적 설계)

  • 박창수;송홍복;조경연
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.1
    • /
    • pp.123-136
    • /
    • 2004
  • In this paper, complexity and regularity of polynomial multiplication over $GF({2^n})$ are defined by using Hamming weight of rows and columns of the matrix ever GF(2) which represents polynomial multiplication. It is shown experimentally that in order to construct the block cipher robust against differential cryptanalysis, polynomial multiplication of substitution layer and the permutation layer should have high complexity and high regularity. With result of the experiment, a way of constituting S box and G function is suggested in the block cipher whose structure is similar to SEED, which is KOREA standard of 128-bit block cipher. S box can be formed with a nonlinear function and an affine transform. Nonlinear function must be strong with differential attack and linear attack, and it consists of an inverse number over $GF({2^8})$ which has neither a fixed pout, whose input and output are the same except 0 and 1, nor an opposite fixed number, whose output is one`s complement of the input. Affine transform can be constituted so that the input/output correlation can be the lowest and there can be no fixed point or opposite fixed point. G function undergoes linear transform with 4 S-box outputs using the matrix of 4${\times}$4 over $GF({2^8})$. The components in the matrix of linear transformation have high complexity and high regularity. Furthermore, G function can be constituted so that MDS(Maximum Distance Separable) code can be formed, SAC(Strict Avalanche Criterion) can be met, and there can be no weak input where a fixed point an opposite fixed point, and output can be two`s complement of input. The primitive polynomials of nonlinear function affine transform and linear transformation are different each other. The S box and G function suggested in this paper can be used as a constituent of the block cipher with high security, in that they are strong with differential attack and linear attack with no weak input and they are excellent at diffusion.

Efficiency Algorithm of Multispectral Image Compression in Wavelet Domain (웨이브릿 영역에서 다분광 화상데이터의 효율적인 압축 알고리듬)

  • Ban, Seong-Won;Seok, Jeong-Yeop;Kim, Byeong-Ju;Park, Gyeong-Nam;Kim, Yeong-Chun;Jang, Jong-Guk;Lee, Geon-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.4
    • /
    • pp.362-370
    • /
    • 2001
  • In this paper, we proposed multispectral image compression method using CIP (classified inter-channel prediction) and SVQ (selective vector quantization) in wavelet domain. First, multispectral image is wavelet transformed and classified into one of three classes considering reflection characteristics of the subband with the lowest resolution. Then, for a reference channel which has the highest correlation and the same resolution with other channels, the variable VQ is performed in the classified intra-channel to remove spatial redundancy. For other channels, the CIP is performed to remove spectral redundancy. Finally, the prediction error is reduced by performing SVQ. Experiments are carried out on a multispectral image. The results show that the proposed method reduce the bit rate at higher reconstructed image quality and improve the compression efficiency compared to conventional methods. Index Terms-Multispectral image compression, wavelet transform, classfied inter-channel prediction, selective vetor quantization, subband with lowest resolution.

  • PDF

Multispectral Image Compression Using Classified Interband Bidirectional Prediction and Extended SPHT (영역별 대역간 양방향 예측과 확장된 SPIHT를 이용한 다분광 화상데이터의 압축)

  • Kim, Seung-Jin;Ban, Seong-Won;Kim, Byung-Ju;Park, Kyung-Nam;Kim, Young-Choon;Lee, Kuhn-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.5
    • /
    • pp.486-493
    • /
    • 2002
  • In this paper, we proposed the effective multispectral image compression method using CIBP(classified interband bidrectional prediction) and extended SPIHT(set partition in hierarchical trees) in wavelet domain. We determine separately feature bands that have the highest correlation with other bands in the visible range and in the infrared range of wavelengths. Feature bands are coded to remove the spatial redundancy with SPIHT in the wavelet domain. Prediction bands that have high correlation with feature bands are wavelet transformed and they are classified into one of three classes considering reflection characteristics of the baseband. For Prediction bands, CIBP is performed to reduce the spectral redundancy. for the difference bands between prediction bands and the predicted bands, They are ordered to upgrade the compression efficiency of extended SPIHT with the largest error magnitude. The arranged bands are coded to compensate the prediction error with extended SPIHT. Experiments are carried out on the multispectral images. The results show that the proposed method reconstructs higher quality images than images reconstructed by the conventional methods at the same bit rate.

A digital Audio Watermarking Algorithm using 2D Barcode (2차원 바코드를 이용한 오디오 워터마킹 알고리즘)

  • Bae, Kyoung-Yul
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.2
    • /
    • pp.97-107
    • /
    • 2011
  • Nowadays there are a lot of issues about copyright infringement in the Internet world because the digital content on the network can be copied and delivered easily. Indeed the copied version has same quality with the original one. So, copyright owners and content provider want a powerful solution to protect their content. The popular one of the solutions was DRM (digital rights management) that is based on encryption technology and rights control. However, DRM-free service was launched after Steve Jobs who is CEO of Apple proposed a new music service paradigm without DRM, and the DRM is disappeared at the online music market. Even though the online music service decided to not equip the DRM solution, copyright owners and content providers are still searching a solution to protect their content. A solution to replace the DRM technology is digital audio watermarking technology which can embed copyright information into the music. In this paper, the author proposed a new audio watermarking algorithm with two approaches. First, the watermark information is generated by two dimensional barcode which has error correction code. So, the information can be recovered by itself if the errors fall into the range of the error tolerance. The other one is to use chirp sequence of CDMA (code division multiple access). These make the algorithm robust to the several malicious attacks. There are many 2D barcodes. Especially, QR code which is one of the matrix barcodes can express the information and the expression is freer than that of the other matrix barcodes. QR code has the square patterns with double at the three corners and these indicate the boundary of the symbol. This feature of the QR code is proper to express the watermark information. That is, because the QR code is 2D barcodes, nonlinear code and matrix code, it can be modulated to the spread spectrum and can be used for the watermarking algorithm. The proposed algorithm assigns the different spread spectrum sequences to the individual users respectively. In the case that the assigned code sequences are orthogonal, we can identify the watermark information of the individual user from an audio content. The algorithm used the Walsh code as an orthogonal code. The watermark information is rearranged to the 1D sequence from 2D barcode and modulated by the Walsh code. The modulated watermark information is embedded into the DCT (discrete cosine transform) domain of the original audio content. For the performance evaluation, I used 3 audio samples, "Amazing Grace", "Oh! Carol" and "Take me home country roads", The attacks for the robustness test were MP3 compression, echo attack, and sub woofer boost. The MP3 compression was performed by a tool of Cool Edit Pro 2.0. The specification of MP3 was CBR(Constant Bit Rate) 128kbps, 44,100Hz, and stereo. The echo attack had the echo with initial volume 70%, decay 75%, and delay 100msec. The sub woofer boost attack was a modification attack of low frequency part in the Fourier coefficients. The test results showed the proposed algorithm is robust to the attacks. In the MP3 attack, the strength of the watermark information is not affected, and then the watermark can be detected from all of the sample audios. In the sub woofer boost attack, the watermark was detected when the strength is 0.3. Also, in the case of echo attack, the watermark can be identified if the strength is greater and equal than 0.5.