• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.6
• /
• pp.303-309
• /
• 2014

Chaos communication system can improve a system security due to characteristics of non-periodic, non-predictability, broadband signal and easy implementation. Also, chaos signal is sensitive to initial conditions of chaos map. By these reasons, security of chaos communication system is superior to digital communication system. BER performance of COOK modulation system is better than other chaos modulation systems, even if COOK modulation system uses an asynchronous receiver. However, security and safety of COOK modulated signal are worse than other chaos modulation systems, because information bits can be easily predicted from COOK modulated signal. In this paper, for security improvement of COOK modulated signal, we propose a novel Scrambling COOK modulation system by applying the scrambling method. Conventional COOK modulated signal can be predicted, because chaos signal is generated when data is only 1. However, proposed system cannot be predicted, because chaos signal is generated when data is 0 or 1. Therefore, security and safety of transmitted signal in scrambling COOK modulation system is superior to conventional COOK modulation system.

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

For effective DC-free coding in the optical storage systems, the Guided Scrambling algorithm is widely used. To reduce digital discrepancy of the coded sequence, functions of digital sum value (DSV) are used as criteria to choose the best candidate. Among these criteria, the minimum digital sum value (MDSV), minium squared weight (MSW), and minimum threshold overrun (MTO) are popular methods for effective DC-suppression. In this paper, we formulate integer programming models that are equivalent to MDSV, MSW, and MTO GS coding. Incorporating the MDSV integer programming model in MaxMin setting, we develop an integer programming model that computes the worst case MDSV bound given scrambling polynomial and control bit size. In the simulation, we compared the worst case MDSV bound for different scrambling polynomial and control bit sizes. We find that careful selection of scrambling polynomial and control bit size are important factor to guarantee the worst case MDSV performance.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.943-957
• /
• 2001

In this paper, we propose an efficient encryption algorithm, without exchanging session keys of a symmetric cryptosystem. The proposed scheme, called as the FAKE(Fast Asymmetric Key Encryption), first scrambles an entire input message and then encrypts small parts of the scrambled message using an asymmetric key encryption scheme. We use the all-or-nothing transform based on the hash function as a scrambling function, which was proposed by Shin, et al. Furthermore, the proposed scheme can additionally provide a digital signature service with only small overhead.

• Journal of Internet Technology
• /
• v.21 no.4
• /
• pp.1013-1024
• /
• 2020

In this paper, we introduce an image encryption algorithm that can be used in combination with compression algorithms. Existing encryption algorithms focus on either encryption strength or speed without compression, whereas the proposed algorithm improves compression efficiency while ensuring security. Our encryption algorithm decomposes images into pixel values and pixel intensity subsets, and computes the order of permutations. An encrypted image becomes unpredictable after permutation. Order permutation reduces the discontinuity between signals in an image, increasing compression efficiency. The experimental results show that the security strength of the proposed algorithm is similar to that of existing algorithms. Additionally, we tested the algorithm on the JPEG and the JPEG2000 with variable compression ratios. Compared to existing methods applied without encryption, the proposed algorithm significantly increases PSNR and SSIM values.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.859-882
• /
• 2021

In the proposed paper, a new algorithm based on Nonlinear Feedback Shift Register (NLFSR) and modified RC4A (Rivest Cipher 4A) cipher is introduced. NLFSR is used for image pixel scrambling while modified RC4A algorithm is used for pixel substitution. NLFSR used in this algorithm is of order 27 with maximum period 2^27-1 which was found using Field Programmable Gate Arrays (FPGA), a searching method. Modified RC4A algorithm is the modification of RC4A and is modified by introducing non-linear rotation operator in the Key Scheduling Algorithm (KSA) of RC4A cipher. Analysis of occlusion attack (up to 62.5% pixels), noise (salt and pepper, Poisson) attack and key sensitivity are performed to assess the concreteness of the proposed method. Also, some statistical and security analyses are evaluated on various images of different size to empirically assess the robustness of the proposed scheme.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1992.11a
• /
• pp.55-70
• /
• 1992

기존의 음성 정보 보호 방식의 단점인 비화의 감소, 키 수의 제한, 상관 관계를 이용한 제3자의 해독 둥의 문제점을 해결할 수 있는 호핑 필터를 이용한 이차원 진폭 스크램블링은 현대 아날로그 음성 신호에 있어서 강력한 비화 방식이다. 본 논문에서는 KAISER WINDOW FIR 필터를 이용하여 호핑 필터를 구성하였으며, 이차원진폭 스크램블링 알고리즘의 최대 단점인 동기(synchronization)문제를 해결하기 위하여 variable delay를 이용한 알고리즘을 제안하였다. 또한, 시뮬레이션을 통하여 디지탈 신호에도 응용·고찰하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.1
• /
• pp.139-149
• /
• 2007

Asynchronous OFCDM(Orthogonal Frequency and Code Division Multiplexing) systems must have a cell search process necessarily unlike synch개nous systems. this process is hewn initial synchronization and 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 yielded 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 group code with two or three block of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions. however, the effect of the reduction complexity leads to degradation of the performance therefore, look for combination to have the most minimum degradation. the proposed block type group code with suitable combinations is the nearly sane performance as conventional group code and has a complexity reduction that is to be compared and verified through the computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.267-275
• /
• 2003

In UMTS terminal modem uses 3 step search procedure for initial cell search, which comprises 1) slot synchronization, 2) code group identification and frame synchronization, and 3) scrambling-code identification. The performance of initial cell search procedure depends on search parameters like observation time and threshold. The purpose of this paper is to get the optimal observation time and threshold of each step for minimum mean acquisition time. In this paper we induce mean detection time of each step and mean acquisition timefrom the model of 3 step search procedure using state diagram. Also we propose initial cell search algorithm which utilize window search method against initial oscillator error, and select an appropriate observation time and threshold of each step by the analysis of simulation and induced result. It is shown that the mean acquisition time in multipath fading channel can be shorter than 500ms by using the determined observation time and threshold of each step.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6A
• /
• pp.379-385
• /
• 2003

In this paper, we propose a time constant control method for sieving local minimum problem of the multiuser detector using Hopfield neural network for synchronous multi-rate code division multiple access(CDMA) system in selective fading environments and its performance is compared with that of the parallel interference cancellation(PIC). We also assume that short scrambling codes of 256 chip length are used an uplink, suggest a simple correlation estimation algorithm and circuit complexity reduction method by using cyclostationarity property of short scrambling code.It is verified that multiuser detector using Hopfield neural network more efficiently cancels multiple access interference(MAI) and obtain better bit error rate and near-far resistant than conventional detector.

• Journal of Satellite, Information and Communications
• /
• v.3 no.2
• /
• pp.48-53
• /
• 2008

In the future, satellite communication systems, such as ISDB in Japan and DVB in Europe, are required to support higher transmission date rate for providing multimedia services including HDTV, high rate data communication etc. Considering the effectiveness of OFDM technique in efficient usage of frequency bandwidth and its robustness to the multi-path fading, several OFDM based standards have been proposed for satellite communication. However, the problem of high Peak to Average Power Ratio is one of the main obstacles for the implementation of OFDM based system. Many PAPR reduction schemes have been proposed for OFDM systems. Among these, the partial transmit sequences (PTS) is attractive as they obtain better PAPR property by modifying OFDM signals without distortion. In this paper, considering the complexity issue, we present a simplified minimum maximum (minimax) criterion and Sub-Optimal PTS algorithm to optimize the phase factor. This algorithm can be dynamically made tradeoff`f between performance and complexity on demand. In addition, we integrate guided scrambling (GS) with this method. Simulation in multiple antenna based OFDM system proves that the proposed Hybrid schemes can get much more PAPR reduction and do not require transmission of side information (SI). Thus it is helpful when implementing OFDM technique in satellite communication system.