• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.33-41
• /
• 2008

Due to the advantage of wavelet transform such as the compatibility with JPEG2000, multi-resolution decomposition, and application of HVS(Human Visual System), watermarking algorithm based on wavelet transform (DWT) is recently mast interesting research subject. However, mast of researches are focused on theoretical aspects for the robustness rather than practical usage, and. may be not suitable too much complicated to use in practice. In this paper, robust logo watermarking algorithm based on DWT is proposed for large and huge data processing. The proposed method embeds the logo watermark by mapping of $8{\times}8$ blocks in order of the number of '1' of the original image and the randomized watermark image with LFSR. The original image is transformed by 2 level wavelet. The experimental results shows that the watermark is embedded successfully, and the proposed algorithm has the valuable robustness from the image processing like JPEG compression, low pass filter, high pass filter and changes in brightness and contrast.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.3
• /
• pp.1-15
• /
• 2003

${Cachin}^{[1]}$ defined the security of steganography theoretically at first, then ${Katzenbeisser}^{[2]}$ and ${Hopper}^{[3]}$ also discussed it on the different aspects. Unfortunately, because many steganographic systems couldnt overcome the statistical gap between a stego-cover and a pure cover, the secure steganography hasn' been evaluated yet. By the effectivel steganalysis algorithm, statistical test which was suggested by Westfel $d^{［4］}$, the attacker Wendy could select the stego-covers out of suspicious covers. Our newly developed algorithm which minimizes the changes of a pure cover by using the block cipher withstands a statistical test and has a similar embedding capacity in comparison with a simple LSB substitution steganography.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.298-302
• /
• 2011

In this paper, we propose an efficient encryption algorithm for ensuring data privacy and security for cloud computing in mobile environments. As part of the evaluation of the proposed algorithm, we have implemented the algorithm in a PC environment and compared with the well-known encryption algorithm of the Data Encryption Standard (DES). The conventional DES algorithm is hard to maintain privacy, due to the fact that its initial and final permutation are known to the network To prevent this critical weakness, a triple DES algorithm has been reported, but it has a disadvantage of long encryption time. In this study, we propose random interleaving algorithm that uses the permutation table for improving privacy further. The proposed algorithm is found to run faster than the triple DES algorithm and also offers improved security in a wireless communication system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.123-129
• /
• 2006

In this paper, we concentrate on reducing the complexity for efficient encoder. We design structural LDPC code using circulant matrix and permutation matrix and eIRA code. It is possible to design low complex encoder by using shift register and differential encoder and interleaver than general LDPC encoder that use matrix multiplication operation. The code designed by this structure shows similar performance as random code. And the proposed codes can considerably reduce a number of XOR gates.

• Journal of the Korean Chemical Society
• /
• v.40 no.1
• /
• pp.11-19
• /
• 1996

The cationic polymerization of energetic substituted oxetanes which have pendant energetic group such as azido and nitrato are investigated theoretically, using semiempirical HF/3-21G, MINDO/3, MNDO and AM1 method. The stereo- and electronic structure of binary molecular complex composed of energetic substituted oxetane and boron trifluoride can be explain by molecular orbital theory. The reactivity of propagation in the copolymerization of oxetanes can be presented by the positive charge on carbon(C2) atom of oxetane and energy level of the lowest unoccupied molecular orbital(LUMO) of propagating species of oxetanes. The reactivity ratios for copolymerization of oxetanes are a random copolymer-zation which is agree with MO calculated and experimental results. The relative equlibrium concentration of cyclic oxonium and open carbenium ions is found to be a major determinant of mechanism, owing to the rapid equilibrium of these cation forms and the expectation based on calculation that in the prepolymer propagation step, SN1 mechanism will be at least as fast as that for SN2 mechanism.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.15-23
• /
• 2004

Westfeld analyzed a sequential LSB embedding steganography effectively through the $\chi$$^2$statistical test which measures the frequencies of PoVs(pairs of values). Fridrich also proposed another statistical analysis, so-called RS steganalysis by which the embedding message rate can be estimated. This method is based on the partition of pixels as three groups; Regular, Singular, Unusable groups. In this paper, we propose a new steganographic scheme which preserves the above two statistics. The proposed scheme embeds the secret message in the innocent image by randomly adding one to real pixel value or subtracting one from it, then adjusts the statistical measures to equal those of the original image.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.1-14
• /
• 2010

With the rapid growth of 3D content industry fields, 3D content-based hashing (or hash function) has been required to apply to authentication, trust and retrieval of 3D content. A content hash can be a random variable for compact representation of content. But 3D content-based hashing has been not researched yet, compared with 2D content-based hashing such as image and video. This paper develops a robust 3D content-based hashing based on key-dependent 3D surface feature. The proposed hashing uses the block surface coefficient using shape coordinate of 3D SSD and curvedness for 3D surface feature and generates a binary hash by a permutation key and a random key. Experimental results verified that the proposed hashing has the robustness against geometry and topology attacks and has the uniqueness of hash in each model and key.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.861-869
• /
• 2003

The rapid growth of multimedia network systems has caused overflowing illegal copies of digital contents. Among digital contents, watermarking technique can be used to protect ownership about the image. Copyright protection involves the authentication of image ownership and the identification of illegal copies of image. In this paper, a new digital watermarking technique using HVS and adaptive scale factor based on the wavelet transform is proposed to use the binary image watermark. The original image is decomposed by 3-level wavelet transform. It is embedded to baseband and high frequency band. The embedding in the baseband is considered robustness, the embedding in the high frequency band is concerned about HVS and invisibility. The watermarking of a visually recognizable binary image used the HVS and random permutation to protect the copyright. From the experimental results, we confirm that the proposed technique is strong to various attacks such as joint photographic experts ground(JPEG) compression, cropping, collusion, and inversion of lines.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.3
• /
• pp.427-437
• /
• 2017

Impossible differential characteristics distinguish the corresponding block cipher from random substitution and can also be used for key recovery attack. Recently Cui et al. proposed an automatic method for searching impossible differential characteristics of several ARX - based block ciphers using Mixed Integer Linear Programming(MILP). By optimizing the method proposed by Cui et al., It was possible to find new impossible differential characteristics which could not be founded by the method by using less linear constraint expression than the existing method. It was applied to the SPECK family and LEA using the modified method. We found 7-rounds for SPECK32, SPECK48, SPECK64, SPECK96 and 8-rounds impossible differential characteristics of SPECK128. These impossible differential characteristics are all newly found. We also found existing 10-rounds of impossible differential characteristic and new 10-rounds of impossible differential characteristics of LEA.