• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5963-5980
• /
• 2017

Image scrambling is an important technology in information hiding, where the Arnold transformation is widely used. Several researchers have proposed the application of $H{\acute{e}}non$ map in square image scrambling, and certain improved technologies require scrambling many times to achieve a good effect without resisting chosen-plaintext attack although it can be directly applied to non-square images. This paper presents a non-square image scrambling algorithm, which can resist chosen-plaintext attack based on a chaotic two-dimensional Sine Logistic modulation map and $H{\acute{e}}non$ map (2D-SLHM). Theoretical analysis and experimental results show that the proposed algorithm has advantages in terms of key space, efficiency, scrambling degree, ability of anti-attack and robustness to noise interference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.187-193
• /
• 2006

Multicarrier systems has major shortcomings due to the large numbers of subcarrier. One of the shortcomings is the high peak-to-average power ratio(PAPR), which causes nonlinearity distortion in the transmitter, and degrades the performance of the system significantly. Partial transmit sequence(PTS) is one of the best approaches that can significantly improve the statistics of the PAPR of an orthogonal frequency division multiplexing(OFDM) signal. Guided scrambling(GS) is an extension of self-synchronizing scrambling. It is also capable of guiding the scrambling process to produce a balanced encoded bit stream. In this paper, we propose a sub-optimal algorithm to optimize the phase factor in PTS. In addition, we integrate GS coding with this method. The proposed Hybrid algorithm can get much more PAPR reduction at the expense of incur a few error extension and do not require transmission of side information.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.700-702
• /
• 1999

The protection of data which we want to keep secret from invalid users has become a main topic nowadays. This paper introduces a encryption scheme for protecting speech signals from eavesdropping. The proposed encryption scheme adopts a secure voice cryptographic algorithm based on the scrambling in frequency band. In order to improve the conventional speech signal encryption scheme, we have randomly permuted DCT coefficients of speech signal. Simulation results are included to show the performance of the proposed algorithm for secure transmission of speech signals.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1649-1655
• /
• 2005

For systems with coexisting cellular and hot-spot cells in broadband orhogonal frequency and code division multiplexing (OFCDM) systems, a suitable cell search algorithm is proposed fur the common pilot channel (CPICH) in the forward link using separated I/Q channel cell specific codes(CSSC), in which the cellular cell specific scrambling code (CCSSC) is assigned to the in-phase (Q) pilot channel of all cellular cells, and the exclusive hot-spot cell specific scrambling code (HSCSSC) group is assigned to the quadrature (Q) pilot channel of all hot-spot cells. Therefore, the proposed algorithm enables a mobile station (MS) to search quickly for the most desirable hot-spot cell due to reducing the effect of CCSSC, when a MS wants to use a mobile internet. The computer simulation results show that the proposed cell search algorithm can achieve faster cell search time performance, compared to conventional cell search methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.656-661
• /
• 2013

In Guided Scrambling (GS) encoding for the holographic storage, after scrambling augmented source word into codeword, the best codeword satisfying modulation constraint is determined. Modulation constraints considered in this paper are strength which is the minimum number of transition between '0' and '1' in each row and column of codeword array and the symbol balancedness of codeword array. In this paper, we show that GS encoding procedure can be formulated as an integer programming model and develop a fast neighborhood search heuristic for fast computation of control bits. In the simulation, we compared the performance of heuristic algorithm with the integer programming model for various array and control bit size combinations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1677-1688
• /
• 1993

Two dimensional amplitude scrambling algorithm using the hopping filter, which improve the drawback of conventional speech encryption scheme, is powerful encryption scheme in analog sppech signal. In this paper, we proposed the variable delay weight algorithm using hopping filter in order to solve the synchronization problem of two dimensional amplitude scrambling. Futhermore, analyzing the distortion of received signal which is transmitted in the gaussian noise channel, we determined the optimal encryption algorithm and optimal SNR using the simulation.

• Annual Conference of KIPS
• /
• 2013.11a
• /
• pp.277-279
• /
• 2013

스크램블링(Scrambling)은 네트워크에서 영상을 전송할 때 보안을 위해 데이터를 특정한 키에 의해 암호화 하여 전송함으로써, 수신자만이 원본 영상으로 복원할 수 있도록 하는 기술이다. 스크램블링은 전송에서 TDES, AES 뿐만아닌 SEED, AIRA의 암호화 알고리즘을 사용한다. 이 경우 암복호화에 많은 시간이 소요되어 실시간 전송환경에서는 전송속도 저하에 따른 QoS 문제가 발생한다. 이와 같은 문제를 해결하기 위해 기존 연구에서는 속도가 빠른 해쉬 함수를 이용하여 스크램블링 암호화 하는 기법을 제안하였다. 하지만 원본 이미지의 일부가 노출될 경우 이후 원본프레임이 노출될 수 있는 문제점을 가지고 있다. 본 논문에서는 이러한 문제점을 방지하기 위해 다중 해쉬 키 프레임을 이용한 Multi Hash key Frame based Scrambling Encryption 알고리즘을 제안한다. 성능평가에서는 제안하는 스크램블링 기법에 대한 암복호화 비용과 성능을 측정하였으며, 기존기법과 비교하였을 때 원본 노출로 인한 대입공격 취약성 부분을 기존 해쉬 함수의 보안 안전성만큼 향상시켰다.

• Bulletin of the Korean Chemical Society
• /
• v.24 no.6
• /
• pp.763-770
• /
• 2003

The $BH_5$ molecule, which is suggested as an intermediate of the acidolysis of $BH_4^-$, contains a weak two-electron-three-center bond and it requires extremely high-level of theories to calculate the energy and structure correctly. The structures and energies of $BH_5$ and the transition state for the hydrogen scrambling have been studied using recently developed multi-coefficient correlated quantum mechanical methods (MCCMs). The dissociation energies and the barrier heights agree very well with the previous results at the CCSD(T)/ TZ(3d1f1g, 2p1d) level. We have also calculated the potential energy curves for the dissociation of $BH_5$ to $BH_3$ and $H_2$. The lower levels of theory were unable to plot correct potential curves, whereas the MCCM methods give very good potential energy curves and requires much less computing resources than the CCSD(T)/ TZ(3d1f1g,2p1d) level. The potential energy of the $BH_5$ scrambling has been obtained by the multiconfiguration molecular mechanics algorithm (MCMM), and the rates are calculated using the variational transition state theory including multidimensional tunneling approximation. The rate constant at 300 K is 2.1 × $10^9s^{-1}$, and tunneling is very important.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.1-8
• /
• 2006

In the asynchrous OFCDM(Orthogonal Frequency and Code Division Multiplexing) system, a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC (Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yeilded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification code(PCSSCG:Patial Cell Specific Scrambling Code Group) of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions with the nearly same performance. The proposed method is to be compared and verified through the computer simulation.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.575-581
• /
• 2010

With widespread use of the Internet and improvements in streaming media and compression technology, digital music, video, and image can be distributed instantaneously across the Internet to end-users. However, most conventional Digital Right Management are often not secure and not fast enough to process the vast amount of data generated by the multimedia applications to meet the real-time constraints. The SVC offers temporal, spatial, and SNR scalability to varying network bandwidth and different application needs. Meanwhile, for many multimedia services, security is an important component to restrict unauthorized content access and distribution. This suggests the need for new cryptography system implementations that can operate at SVC. In this paper, we propose a new scrambling encryption for reserving the characteristic of scalability in MPEG4-SVC. In the base layer, the proposed algorithm is applied and performed the selective scambling. And it encrypts various MVS and intra-mode scrambling in the enhancement layer. In the decryption, it decrypts each encrypted layers by using another encrypted keys. Throughout the experimental results, the proposed algorithms have low complexity in encryption and the robustness of communication errors.