• Title/Summary/Keyword: CODE

Search Result 17,938, Processing Time 0.042 seconds

Secure and Efficient Code Encryption Scheme Based on Indexed Table

  • Cho, Sung-Kyu;Shin, Dong-Hwi;Jo, Hea-Suk;Choi, Dong-Hyun;Won, Dong-Ho;Kim, Seung-Joo
    • ETRI Journal
    • /
    • v.33 no.1
    • /
    • pp.60-70
    • /
    • 2011
  • Software is completely exposed to an attacker after it is distributed because reverse engineering is widely known. To protect software, techniques against reverse engineering are necessary. A code encryption scheme is one of the techniques. A code encryption scheme encrypts the binary executable code. Key management is the most important part of the code encryption scheme. However, previous schemes had problems with key management. In an effort to solve these problems in this paper, we survey the previous code encryption schemes and then propose a new code encryption scheme based on an indexed table. Our scheme provides secure and efficient key management for code encryption.

LS code pair setting and sequential allocation methods

  • Wook, Roh-Dong
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.221-224
    • /
    • 2001
  • A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

  • PDF

The Study about Channel code to Overcome Multipath of Underwater Channel (수중통신채널에서 다중경로 극복을 위한 오류정정부호에 대한 연구)

  • Kim, Nam-Soo;Kim, Min-Hyuk;Park, Tae-Doo;Kim, Chul-Seung;Jung, Ji-Won
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.33 no.5
    • /
    • pp.738-745
    • /
    • 2009
  • Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes receive signal to make error floor. In this paper, we propose the underwater communication system using various channel coding schemes such as RS coding, convolutional code, turbo code and concatenated code for overcoming the multipath effect in underwater channel. As shown in simulation results, characteristic of multipath error is similar to that of random error. So interleaver has not effect on error correcting. For correcting of error floor by multipath, it is necessary to use strong channel codes like turbo code. Turbo code is one of the iterative codes. And the performance of concatenated codes including RS code has better performance than using singular channel codes.

Code region extraction method using multiple thresholding for container BIC-code recognition (컨테이너 BIC-code 인식을 위한 다중 이진화를 이용한 code 영역 추출 방법)

  • Song, Jae-Wook;Jung, Na-Ra;Kang, Hyun-Soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2014.11a
    • /
    • pp.29-30
    • /
    • 2014
  • 본 논문에서는 컨테이너 BIC-code 자동인식 시스템의 전 처리 과정으로서 다중 임계값을 이용한 BIC-code 영역 추출 방법을 제안한다. 기후요소, 빛, 카메라 위치, 컨테이너의 색과 같은 다양한 요인으로 인해 고정된 임계값을 사용할 수 없다. 따라서 각 영상에 대해 다양한 임계값으로 실험하여 컨테이너 BIC-code 인식에 가장 우수한 임계값을 결정하여 영상을 이진화한다. 다음으로, 가장 우수한 임계값으로 이진화 한 영상에 대하여 레이블링, 닫힘 연산을 통해 BIC-code의 가로, 세로 여부를 판단하게 된다. 또한 레이블링 된 각 영역을 판단하여 잡음을 제거하고, 개별 code를 분리한다. 제안된 방법에 대한 실험결과 성공적인 코드 영역 분리가 가능함을 확인할 수 있었다.

  • PDF

Improvement of code acquisition time in DS/SS systems using a hybrid scheme (복합방식을 이용한 직접대역확산통신시스템의 코드획득 성능개선)

  • 조권도;김선영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.684-691
    • /
    • 1996
  • Since the period of a spreading code in DS/SS communication systems is generally long, it is necessary to make the code acquisition as fast as possible. The code acquisition time can be sued as a measure to evaluate the performance of code acquisition systems. The search rate of serial search codee acquisition system used in the coventional CDMA cellular system is lower than that of the matched filter technique. In order to reduce the code acquisition time, this paper proposes hybrid code acquisition system composed filters combined with serial search blocks. In the proposed system, the matched filter sweeps possible code phases fast and the acquired phase information is verified by the serial search block. The mean and the variance of its acquisition time are calculated and compared with those of double dwell serial search system. The results indicate better performance of the proposed system by yielding its small vaues of the mean and the variance of code acquisition time.

  • PDF

Image Feature Representation Using Code Vectors for Retrieval

  • Nishat, Ahmad;Zhao, Hui;Park, Jong-An;Park, Seung-Jin;Yang, Won-II
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.3
    • /
    • pp.122-130
    • /
    • 2009
  • The paper presents an algorithm which uses code vectors to represent comer geometry information for searching the similar images from a database. The comers have been extracted by finding the intersections of the detected lines found using Hough transform. Taking the comer as the center coordinate, the angles of the intersecting lines are determined and are represented using code vectors. A code book has been used to code each comer geometry information and indexes to the code book are generated. For similarity measurement, the histogram of the code book indexes is used. This result in a significant small size feature matrix compared to the algorithms using color features. Experimental results show that use of code vectors is computationally efficient in similarity measurement and the comers being noise invariant produce good results in noisy environments.

  • PDF

Code-Reuse Attack Detection Using Kullback-Leibler Divergence in IoT

  • Ho, Jun-Won
    • International journal of advanced smart convergence
    • /
    • v.5 no.4
    • /
    • pp.54-56
    • /
    • 2016
  • Code-reuse attacks are very dangerous in various systems. This is because they do not inject malicious codes into target systems, but reuse the instruction sequences in executable files or libraries of target systems. Moreover, code-reuse attacks could be more harmful to IoT systems in the sense that it may not be easy to devise efficient and effective mechanism for code-reuse attack detection in resource-restricted IoT devices. In this paper, we propose a detection scheme with using Kullback-Leibler (KL) divergence to combat against code-reuse attacks in IoT. Specifically, we detect code-reuse attacks by calculating KL divergence between the probability distributions of the packets that generate from IoT devices and contain code region addresses in memory system and the probability distributions of the packets that come to IoT devices and contain code region addresses in memory system, checking if the computed KL divergence is abnormal.

An MAC Protocol based on Code Status Sensing and Acquisition Indication in CDMA Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.181-184
    • /
    • 2007
  • In this paper, a CSSMA/AI MAC protocol in packet CDMA network is presented. The main features of this protocol are the code status sensing and reservation for reducing the packet collision. The base station broadcasts the code status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected code and waits the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission for the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet on a reserved code for the successive frames.

A ASIC design of the Improved PN Code Acquisition System for DS/CDMA (DS-CDMA용 개선된 PN 코드 포착 시스템의 ASIC 설계)

  • Jo, Byeong-Rok;Park, Jong-U
    • The KIPS Transactions:PartD
    • /
    • v.9D no.1
    • /
    • pp.161-166
    • /
    • 2002
  • The existing method in PN code acquisition process have a problem in PN code acquisition time because PN code searching is accomplished in one epoch. In this paper, we propose algorithm that can reduce PN code acquisition time because PN code searching is accomplished in each other two epoches. The designed ASIC chip using proposed algorithm confirmed that the area (the number of gates) increase more than existing method in PN code acquisition, but the performance of PN code acquisition is better than existing method.

An Error Control Line Code Based on an Extended Hamming Code (확대 Hamming 부호를 이용한 오류제어선로부호)

  • 김정구;정창기;이수인;주언경
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.5
    • /
    • pp.912-919
    • /
    • 1994
  • A new error control line code based on an extended Hamming code is proposed and its performance is analyzed in this paper. The proposed code is capable of single error correction and double error detection since its minimum Hamming distance is 4. In addition, the error detection capability can be oncreased due to the redundancy bit used for line coding. As a result, the proposed code shows lower code rate, but better spectral characteristics in low frequency region and lower residual bit error rate than the conventional error correction line code using Hamming (7, 4) code.

  • PDF