• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.2
• /
• pp.48-54
• /
• 2014

For the element ${\alpha}{\in}GF(p^n)$, two kinds of bases are known. One is a conventional polynomial basis of the form $\{1,{\alpha},{\alpha}^2,{\cdots},{\alpha}^{n-1}\}$, and the other is a normal basis of the form $\{{\alpha},{\alpha}^p,{\alpha}^{p^2},{\cdots},{\alpha}^{p^{n-1}}\}$. In this paper we consider the method of generating normal bases which construct the finite field $GF(p^n)$, as an n-dimensional extension of the finite field GF(p). And we analyze the code sequence generating algorithm and derive the implementation functions of code sequence generator based on the normal bases. We find the normal polynomials of degrees, n=5 and n=7, which can generate normal bases respectively, design, and construct the code sequence generators based on these normal bases. Finally, we produce two code sequence groups(n=5, n=7) by using Simulink, and analyze the characteristics of the autocorrelation function, $R_{i,i}(\tau)$, and crosscorrelation function, $R_{i,j}(\tau)$, $i{\neq}j$ between two different code sequences. Based on these results, we confirm that the analysis of generating algorithms and the design and implementation of the code sequence generators based on normal bases are correct.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.3-12
• /
• 1999

The public key crytptosystem is represented by RSA based on the difficulty of integer factorization and ElGamal cryptosystem based on the intractability of the discrete logarithm problem in a cyclic group G. The index-calculus algorithm for discrete logarithms in GF${$q^n$}^+$ requires an polynomial factorization. The Niederreiter recently developed deterministic facorization algorithm for polynomial over GF$q^n$ In this paper we implemented the arithmetic of finite field with c-language and gibe an implementation of the Niederreiter's algorithm over GF$2^n$ using normal bases.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.533-538
• /
• 2013

The damage caused by Recent frequently occurring locality torrential rains is increasing rapidly. In case of densely populated metropolitan area, casualties and property damage is a serious due to landslides and debris flows and floods. Therefore, the importance of predictions about the torrential is increasing. Precipitation characteristic of the bad weather in Korea is divided into typhoons and torrential rains. This seems to vary depending on the duration and area. Rainfall is difficult to predict because regional precipitation is large volatility and nonlinear. In this paper, Very short-term precipitation forecasting pattern model is implemented using KLAPS data used by Korea Meteorological Administration. we designed very short term precipitation forecasting pattern model using GA-based RBFNNs. the structural and parametric values such as the number of Inputs, polynomial type,number of fcm cluster, and fuzzification coefficient are optimized by GA optimization algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.9
• /
• pp.937-946
• /
• 2002

In this paper, we present a stable solution of the transient electromagnetic scattering from the conducting objects. This method does not utilize the conventional marching-on in time (MOT) solution. Instead we solve the time domain integral equation by expressing the transient behavior of the induced current in terms of weighted Laguerre polynomials. By using this basis functions for the temporal variation, the time derivative in the integral equation can be handled analytically. Since these temporal basis functions converge to zero as time progresses, the transient response of the induced current does not have a late time oscillation. To show the validity of the proposed method, we solve a time domain electric feld integral equation and compare the results of MOT, Mie solution, and the inverse discrete Fourier transform (IDFT) of the solution obtained in the frequency domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.892-897
• /
• 2008

In this paper, a new architecture for digit-parallel/bit-serial GF$(2^m)$ multiplier with low latency is proposed. The proposed multiplier operates in polynomial basis of GF$(2^m)$ and produces multiplication results at a rate of one per D clock cycles, where D is the selected digit size. The digit-parallel/bit-serial multiplier is faster than bit-serial ones but with lower area complexity than bit-parallel ones. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.337-342
• /
• 2010

In this paper, a new architecture for digit-parallel/bit-serial GF($2^m$) multiplier with low complexity is proposed. The proposed multiplier operates in polynomial basis of GF($2^m$) and produces multiplication results at a rate of one per D clock cycles, where D is the selected digit size. The digit-parallel/bit-serial multiplier is faster than bit-serial ones but with lower area complexity than bit-parallel ones. The most significant feature of the digit-parallel/bit-serial architecture is that a trade-off between hardware complexity and delay time can be achieved. But the traditional digit-parallel/bit-serial multiplier needs extra hardware for high speed. In this paper a new low complexity efficient digit-parallel/bit-serial multiplier is presented.

• Water for future
• /
• v.18 no.1
• /
• pp.85-94
• /
• 1985

A method is developed for the separation of the major base flow in a river hydrograph combining the numerical techniques and the empirical methods. The linearized Boussinesq equation and the storage function are used to obtain the base flow recession. The shape of base flow curve made by the recharge of the groundwater table aquifer resulting from rainfall in determined by the Singh and Stall's graphical method, and the continuous from for the curve is approximated by the multiple and polynomial regression. this procedure was successfully tested for the separation of base flow and the establishment of hydrograph in a natural watershed. It was found that the direct numerical method applied to the homogeneous linear second order ordinary differential equation system is not suited to obtain the recession curve, and the case that the loss is generated in the partially penetrating stream can not be solved by the method of this study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1209-1217
• /
• 2008

In this paper, we present a new bit-parallel multiplier for performing the bit-parallel multiplication of two polynomials in the finite fields $GF(2^m)$. Prior to construct the multiplier circuits, we consist of the vector code generator(VCG) to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial after performing the parallel multiplication of a multiplicand polynomial with a irreducible polynomial. The basic cells of VCG have two AND gates and two XOR gates. Using these VCG, we can obtain the multiplication results performing the bit-parallel multiplication of two polynomials. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields $GF(2^4)$. Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper use the VCGs with the basic cells repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSI.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.3-10
• /
• 2008

The choice of basis for representation of element in $GF(2^m)$ affects the efficiency of a multiplier. Among them, a multiplier using redundant representation efficiently supports trade-off between the area complexity and the time complexity since it can quickly carry out modular reduction. So time of a previous multiplier using redundant representation is faster than time of multiplier using others basis. But, the weakness of one has a upper space complexity compared to multiplier using others basis. In this paper, we propose a new efficient multiplier with consideration that polynomial exponentiation operations are frequently used in cryptographic hardwares. The proposed multiplier is suitable fer left-to-right exponentiation environment and provides efficiency between time and area complexity. And so, it has both time delay of $T_A+({\lceil}{\log}_2m{\rceil})T_x$ and area complexity of (2m-1)(m+s). As a result, the proposed multiplier reduces $2(ms+s^2)$ compared to the previous multiplier using equally-spaced polynomials in area complexity. In addition, it reduces $T_A+({\lceil}{\log}_2m+s{\rceil})T_x$ to $T_A+({\lceil}{\log}_2m{\rceil})T_x$ in the time complexity.($T_A$:Time delay of one AND gate, $T_x$:Time delay of one XOR gate, m:Degree of equally spaced irreducible polynomial, s:spacing factor)

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.4
• /
• pp.46-53
• /
• 2008

In this study, we developed RBFN(Radial Basis Function Networks) based load modeling method with harmonic components. The developed method considers harmonic information as well as fundamental frequency and voltage considered as essential factors in conventional method. Thus, the reposed method makes it possible to effectively estimate load characteristics in power lines with harmonics. RBFN has some advantage such as simple structure and rapid computation ability compared with multi-layer perceptorn which is extensively applied for load modeling. To verify the effectiveness, the proposed method has been intensively tested with various dataset acquired under the different frequency and voltage and compared it with conventional methods such as polynomial method, MLPN and RBFN with no harmonic components.