• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.549-554
• /
• 2002

In this paper, for n=2m and odd prime p, new generalized bent functions from the finite field $F_{p^n}$ to the prime field $F_p$ are constructed from the partial spreads for $F_{p^n}$. Closed form expressions for the proposed generalized bent functions and their trace transform are derived in the form of the trace functions.

• Review of KIISC
• /
• v.6 no.1
• /
• pp.33-44
• /
• 1996

본 고에서는 참고문헌 [9]을 바탕으로 선형복잡도 특성이 우수하고 이상적인 자기상관함수 특성을 갖는 GMW 계열의 특성을 분석한다. 이를 위하여 먼저 LFSR 계열의 특성방정식을 제시한 후, 트레이스함수를 이용하여 GMW 계열을 정의한다. 그리고 GMW 계열의 자기상관함수를 구하며, 차수가 6인 GMW 계열의 생성기의 구조를 제시한다. 마지막으로 GMW 계열의 선형복잡도와 갯수를 구하는 수식을 유도한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.281-284
• /
• 2008

소프트웨어 버스마크는 프로그램을 식별하는데 사용될 수 있는 프로그램의 고유한 특징을 말한다. 본 논문에서는 자바 메소드의 정적 트레이스 정보에 기반한 자바 버스마킹 기법을 제안한다. 정적 트레이스는 런타임 실행 절차를 반영한다는 점에서 동적 버스마크의 장점이 있고, 정적 분석으로 추출하기 때문에 라이브러리나 함수 단위에 적용가능하다는 정적 버스마크의 장점도 있다. 본 논문에서 제안한 버스마킹 기법을 평가하기 위해서 서로 다른 프로그램을 구별할 수 있는 신뢰도와 프로그램 최적화나 난독화에 견딜 수 있는 강인도에 대한 실험을 하였다. 실험 결과로부터 본 논문에서 제안하는 버스마크가 신뢰도를 유지하면서 기존 방법보다 강인한 버스마크임을 확인할 수 있다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1994.11a
• /
• pp.132-156
• /
• 1994

본 논문에서는 비선형 합성 함수를 이용하여 생성된 난수 계열의 특성을 분석한다. 먼저 트레이스 함수 등을 정의하고, 선형 복잡도 및 생성기 구조 분석시 요구되는 관련 이론을 도출하고, 특정 난수 계열이 주어진 경우 이계열을 생성할 수 있는 최소 길이의 LFSR을 합성할 수 있는 USR 합성 알고리듬을 제시한다. 동일한 계열을 위상 천이한 계열간의 비선형 결합으로 생성된 난수 계열과 다른 계열간의 비선형 결합으로 생성된 난수 계열에 대한 주기 및 선형 복잡도 등의 특성을 분석하고 생성기의 구조를 제시한다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.10
• /
• pp.85-94
• /
• 2004

In this paper, a register allocation techlique that translates memory accesses to register accesses Is presented to enhance embedded software performance. In the proposed method, a source code is profiled to generate a memory trace. From the profiling results, target functions with high dynamic call counts are selected, and the proposed register allocation technique is applied only to the target functions to save the compilation time. The memory trace of the target functions is searched for the memory accesses that result in cycle count reduction when replaced by register accesses, and they are translated to register accesses by modifying the intermediate code and allocating Promotion registers. The experiments where the performance is measured in terms of the cycle count on MediaBench and DSPstone benchmark programs show that the proposed method increases the performance by 14% and 18% on the average for ARM and MCORE, respectively.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.373-382
• /
• 2004

In this paper, a register promotion technique that translates memory accesses to register accesses is presented to enhance embedded software performance. In the proposed method, a source code is profiled to generate a memory trace. From the profiling results, target functions with high dynamic call counts are selected, and the proposed register promotion technique is applied only to the target functions to save the compilation time. The memory trace of the target functions is searched for the memory accesses that result in cycle count reduction when replaced by register accesses, and they are translated to register accesses by modifying the intermediate code and allocating promotion registers. The experiments on MediaBench and DSPstone benchmark programs show that the proposed method increases the performance by 14% and 18% on the average for ARM and MCORE, respectively.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.13-19
• /
• 2011

Games gave the calculation method for the crosscorrelation function of a Kasami sequence and a No sequence that have been generated by the same primitive polynomial. In this paper, we calculate the crosscorrelation function of a Kasami sequence and a No sequence that have been generated by the same primitive polynomial with the periodic crosscorrelation function of two base sequences. Our method is different from the Games's method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.6
• /
• pp.891-897
• /
• 2013

The spectrum and the number of the values of the cross-correlation function between the maximal period binary sequences have been extensively studied because of their importance in communications applications. In this paper, we propose the new family of the sequences using the decimation $d=2^{m-1}(3{\cdot}2^{m}-1)$. And we find the spectrum of the cross-correlation function of the sequences and analyze the number of times each value occurs for $0{\leq}{\tau}{\leq}2^{n}-2$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1138-1144
• /
• 2013

Cross-correlation functions of maximal period sequences have been studied for decades. In this paper, we find the cross-correlation values of non-linear sequences $S_a^r(t)=Tr_1^m\{[Tr_m^n(a{\alpha}^t+{\alpha}^{dt})]^r\}$ having the maximal period $2^n-1$ for Niho type decimation $d=2^{m-2}(2^m+3)$, where n=2m. In particular, we call d Niho type decimation in case $d{\equiv}1(mod\;2^m-1)$. And we analyze the cross-correlation distributions of $S_a^r(t)$ when the phase shift ${\tau}=(2^m+1)k(0{\leq}k{\leq}2^m-2)$ and provide experiment results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.627-633
• /
• 2013

An important problem in the transmission performance and efficiency is to find the values and the number of the cross-correlation function between two different maximal sequences. In this paper, we present the new maximal sequences which are obtained by the new decimations $d=\frac{2^{m-st-1}}{2^s-1}(2^n+2^{st+s+1}-2^{m+st+1}-1)$ from some maximal sequences. We will also find the values and the number of occurrences of each value of the cross-correlation function from the proposed decimations.