• Journal of the Chungcheong Mathematical Society
• /
• v.32 no.2
• /
• pp.171-177
• /
• 2019

We associate a positive integer n and a subgroup H of the group G(n) with a polynomial $J_{n,H}(x)$, which is called the Galois polynomial. It turns out that $J_{n,H}(x)$ is a polynomial with integer coefficients for any n and H. In this paper, we provide an equivalent condition for a subgroup H to provide the Galois polynomial which is irreducible over ${\mathbb{Q}}$.

• Honam Mathematical Journal
• /
• v.39 no.2
• /
• pp.259-265
• /
• 2017

Galois polynomials are defined as a generalization of the Cyclotomic polynomials. Galois polynomials have integer coefficients as the cyclotomic polynomials. But they are not always irreducible. In this paper, Galois polynomials are partly classified according to the type of subgroups which defines the Galois polynomial.

• Communications of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.1-6
• /
• 2017

In this paper, the fundamental theorem of Galois Theory is used to generalize cyclotomic polynomials and construct irreducible polynomials associated with the n-th primitive roots of unity.

• Honam Mathematical Journal
• /
• v.40 no.2
• /
• pp.281-291
• /
• 2018

We associate a positive integer n and a subgroup H of the group $({\mathbb{Z}}/n{\mathbb{Z}})^{\times}$ with a polynomial $J_n,H(x)$, which is called the Galois polynomial. It turns out that $J_n,H(x)$ is a polynomial with integer coefficients for any n and H. In this paper, we provide an equivalent condition for a subgroup H to provide the Galois polynomial which is irreducible over ${\mathbb{Q}}$ in the case of $n=p^{e_1}_1{\cdots}p^{e_r}_r$ (prime decomposition) with all $e_i{\geq}2$.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.23-31
• /
• 1996

Our main purpose in this paper is to determine the Galois group of the given irreducible septic polynomial ove Q by using three resolvant polynomials and the discriminant of the given polynomial.

• Journal of the Chungcheong Mathematical Society
• /
• v.31 no.3
• /
• pp.309-319
• /
• 2018

Galois polynomials are defined as a generalization of the cyclotomic polynomials. The definition of Galois polynomials (and cyclotomic polynomials) is based on the multiplicative group of integers modulo n, i.e. ${\mathbb{Z}}_n^*$. In this paper, we define Galois polynomials which are based on the quotient group ${\mathbb{Z}}_n^*/H$.

• Honam Mathematical Journal
• /
• v.37 no.4
• /
• pp.469-472
• /
• 2015

The n-th cyclotomic polynomial ${\Phi}_n(x)$ is irreducible over $\mathbb{Q}$ and has integer coefficients. The degree of ${\Phi}_n(x)$ is ${\varphi}(n)$, where ${\varphi}(n)$ is the Euler Phi-function. In this paper, we define Semi-Cyclotomic Polynomial $J_n(x)$. $J_n(x)$ is also irreducible over $\mathbb{Q}$ and has integer coefficients. But the degree of $J_n(x)$ is $\frac{{\varphi}(n)}{2}$. Galois Theory will be used to prove the above properties of $J_n(x)$.

• Convergence Security Journal
• /
• v.18 no.4
• /
• pp.27-33
• /
• 2018

Stream cipher is an one-time-pad type encryption algorithm that encrypt plaintext using simple operation such as XOR with random stream of bits (or characters) as symmetric key and its security depends on the randomness of used stream. Therefore we can design more secure stream cipher algorithm by using mathematical analysis of the stream such as period, linear complexity, non-linearity, correlation-immunity, etc. The key stream in stream cipher is generated in linear feedback shift register(LFSR) having characteristic polynomial. The primitive polynomial is the characteristic polynomial which has the best security property. It is used widely not only in stream cipher but also in SEED, a block cipher using 8-degree primitive polynomial, and in Chor-Rivest(CR) cipher, a public-key cryptosystem using 24-degree primitive polynomial. In this paper we present the concept and various properties of primitive polynomials in Galois field and prove the theorem finding the number of irreducible polynomials and primitive polynomials over $F_p$ when p is larger than 2. This kind of research can be the foundation of finding primitive polynomials of higher security and developing new cipher algorithms using them.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.856-859
• /
• 2005

This paper presents a method of constructing the highly efficiency arithmetic operation unit systems(AOUS) based on fields. The proposed AOUS is more regularity and extensibility than previous methods. Also, the proposed AOUS be able to apply basic multimedia hardware. The future research is demanded to more compact and advanced arithmetic operation algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.6
• /
• pp.580-598
• /
• 1987

This paper presents a method to realize the sequential multiple-valued Logic on Galois field. First, We develop so that Taylor series can be corresponded the irreducible polynomial to realize over the finite field, and produce the matrix. This paper object expanded a basic concept of the conbinational Logic circuit so as to apply in the sequential Logic circuit. First of all, We suggest a theory for constructing sequential multiple-valued Logic circuit. Then, We realized the construction with the single input and the multi-output that expanded its function construction. In case of the multi-output, the circuit process by the partition function concept as the mutual independent. This method can be reduced a enormous computer course to need a traditional extention that designed the sequential multi-valued Logic circuit.