• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1441-1446
• /
• 2010

This paper presents a method of constructing the divider using sequential logic systems over finite fields(or galois fields). The proposed the sequential logic systems is constructed by as following. First of all, we obtain the linear characteristics between present state and next state based on mathematical properties of finite fields and sequential logic systems. Next, we realize the sequential logic systems over finite fields using above linear characteristics and characteristic polynomial which is expressed using by matrix. Also, we apply to implement divider using the proposed sequential logic systems over finite fields.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.880-883
• /
• 2005

This paper presents a method of constructing the sequential logic machines over finite fields(or galois fields). The proposed the sequential logic machines is constructed by as following. First of all, we obtain the linear characteristics between present state and next state based on mathematical properties of finite fields and sequential logic machines. Next, we realize the sequential logic machines over finite field GF(P) using above linear characteristics and characteristic polynomial that expressed using by matrix.

• Korean Journal of Mathematics
• /
• v.19 no.3
• /
• pp.263-272
• /
• 2011

In the paper [1], an explicit correspondence between certain cubic irreducible polynomials over $\mathbb{F}_q$ and cubic irreducible polynomials of special type over $\mathbb{F}_{q^2}$ was established. In this paper, we show that we can mimic such a correspondence for quintic polynomials. Our transformations are rather constructive so that it can be used to generate irreducible polynomials in one of the finite fields, by using certain irreducible polynomials given in the other field.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.317-322
• /
• 2010

This paper presents an algorithm generating inverse element over finite fields GF($3^m$), and constructing method of inverse element generator based on inverse element generating algorithm. An inverse computing method of an element over GF($3^m$) which corresponds to a polynomial over GF($3^m$) with order less than equal to m-1. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.924-925
• /
• 2014

This paper present a method of GRM constant generation in case of prime number P=3 over finite fields. Also we discuss the method which is the optimal GRM generation compare with polarity. The proposed method is the efficiency and optimization compare with earlier method.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.3
• /
• pp.443-449
• /
• 2015

In this paper we propose a method of computing the number of points on the reduction of non-hyperelliptic modular curves of genus greater than or equal to 3 over finite fields.

• Bulletin of the Korean Mathematical Society
• /
• v.20 no.2
• /
• pp.81-85
• /
• 1983

It is the purpose of this paper to give some remarks on finite fields. We shall show that the little theorem of Fermat, Euler's criterion for quadratic residue mod p, and other few theorems in the number theory can be derived from the theorems in theory of finite field K=GF(p), where p is a prime. The forms of some irreducible ploynomials over K-GF(p) will be given explicitly.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.3
• /
• pp.299-307
• /
• 2009

We count the isomorphism classes of elliptic curves over finite fields $\mathbb{F}_{3^{n}}$ and list a representative of each isomorphism class. Also we give the number of rational points for each supersingular elliptic curve over $\mathbb{F}_{3^{n}}$.

• Journal of KSNVE
• /
• v.3 no.2
• /
• pp.169-178
• /
• 1993

Internal & External duct acoustic fields are calculated by using a finite element method. The geometry is assumed as an axisymmetric duct. External acoustic field; outside the duct, and combined internal & external acoustic fields are solved. For both cases a far field's nonreflecting boundary condition is enforced by using a wave envelope element, which is a kind of finite element. First, a pulsating sphere and an oscillating sphere problem are calculated to verify the external problems, and the results are compared with exact solutions. When the wave envelope element is applied at the far boundary, the calculated finite element solutions show good agreements with the exact solutions. Secondly, the combined internal & external duct acoustic fields are calculated and visualized when monopole sources are distributed inside the duct. It is observed that the directivity of sound intensity outside the duct is beaming toward the axis for high frequency sources.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2724-2729
• /
• 2010

This paper presents a method of constructing the sequential digital systems over finite fields. We assign all elements in finite fields to digit codes using mathematical properties of finite fields. Also, we discuss the operational characteristics and properties of the building block T-gate which is used to implement the sequential digital systems over finite fields. Then, we implemented sequential digital systems without feed-back. The sequential digital systems without feed-back is constructed as following steps. First, we assign the states in state-transition diagram to state digit codes, then obtain the state function and predecessor table which is explaining the relationship between present states and previous states. Next, we obtained the next-state function from state function and predecessor table. Finally we realize the circuit using T-gate and decoder. The proposed method is more efficiency and systematic than previous method.