• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 V
• /
• pp.2633-2636
• /
• 2003

This study focuses on the new hardware design of fast and low-complexity multiplier over GF(2$\^$m/). The proposed multiplier based on the irreducible all one polynomial (AOP) of degree m, to reduced the system's complexity. It composed of Cyclic Shift, Partial Product, and Modular Summation Blocks. Also it consists of (m＋1)$^2$2-input AND gates and m(m＋1) 2-input XOR gates. Out architecture is very regular, modular and therefore, well-suited for VLSI implementation.

• 대한수학회지
• /
• 제44권1호
• /
• pp.35-54
• /
• 2007

Let $M_c$ = M(2, 0, c) be the moduli space of O(l)-semistable rank 2 torsion-free sheaves with Chern classes $c_1=0\;and\;c_2=c$ on a K3 surface X, where O(1) is a generic ample line bundle on X. When $c=2n\geq4$ is even, $M_c$ is a singular projective variety equipped with a holomorphic symplectic structure on the smooth locus. In particular, $M_c$ has trivial canonical divisor. In [22], O'Grady asks if there is any symplectic desingularization of $M_{2n}$ for $n\geq3$. In this paper, we show that there is no crepant resolution of $M_{2n}$ for $n\geq3$. This obviously implies that there is no symplectic desingularization.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.514-518
• /
• 2004

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. A method computing inverse of an element over $GF(3^{m})$ which corresponds to a polynomial over $GF(3^{m})$ with order less than equal to m-l. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

• 대한수학회보
• /
• 제52권2호
• /
• pp.525-530
• /
• 2015

Let D be an integrally closed domain with quotient field K, X be an indeterminate over D, $f=a_0+a_1X+{\cdots}+a_nX^n{\in}D[X]$ be irreducible in K[X], and $Q_f=fK[X]{\cap}D[X]$. In this paper, we show that $Q_f$ is a maximal ideal of D[X] if and only if $(\frac{a_1}{a_0},{\cdots},\frac{a_n}{a_0}){\subseteq}P$ for all nonzero prime ideals P of D; in this case, $Q_f=\frac{1}{a_0}fD[X]$. As a corollary, we have that if D is a Krull domain, then D has infinitely many height-one prime ideals if and only if each maximal ideal of D[X] has height ${\geq}2$.

• 대한임베디드공학회논문지
• /
• 제11권4호
• /
• pp.227-233
• /
• 2016

Efficient finite field arithmetic is essential for fast implementation of error correcting codes and cryptographic applications. Among the arithmetic operations over finite fields, the multiplication is one of the basic arithmetic operations. Therefore an efficient design of a finite field multiplier is required. In this paper, two new bit-parallel systolic multipliers for $GF(2^m)$ fields defined by AOP(all-one polynomial) have proposed. The proposed multipliers have a little bit greater space complexity but save at least 22% area complexity and 13% area-time (AT) complexity as compared to the existing multipliers using AOP. As compared to related works, we have shown that our multipliers have lower area-time complexity, cell delay, and latency. So, we expect that our multipliers are well suited to VLSI implementation.

• Kyungpook Mathematical Journal
• /
• 제61권1호
• /
• pp.11-21
• /
• 2021

We study the structure of rings whose factor rings modulo nonzero proper ideals are right duo; such rings are called right FD. We first see that this new ring property is not left-right symmetric. We prove for a non-prime right FD ring R that R is a subdirect product of subdirectly irreducible right FD rings; and that R/N∗(R) is a subdirect product of right duo domains, and R/J(R) is a subdirect product of division rings, where N∗(R) (J(R)) is the prime (Jacobson) radical of R. We study the relation among right FD rings, division rings, commutative rings, right duo rings and simple rings, in relation to matrix rings, polynomial rings and direct products. We prove that if a ring R is right FD and 0 ≠ e2 = e ∈ R then eRe is also right FD, examining that the class of right FD rings is not closed under subrings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2680-2700
• /
• 2017

Finite field arithmetic over GF($2^m$) is used in a variety of applications such as cryptography, coding theory, computer algebra. It is mainly used in various cryptographic algorithms such as the Elliptic Curve Cryptography (ECC), Advanced Encryption Standard (AES), Twofish etc. The multiplication in a finite field is considered as highly complex and resource consuming operation in such applications. Many algorithms and architectures are proposed in the literature to obtain efficient multiplication operation in both hardware and software. In this paper, a modified serial multiplication algorithm with interleaved modular reduction is proposed, which allows for an efficient realization of a sequential polynomial basis multiplier. The proposed sequential multiplier supports multiplication of any two arbitrary finite field elements over GF($2^m$) for generic irreducible polynomials, therefore made versatile. Estimation of area and time complexities of the proposed sequential multiplier is performed and comparison with existing sequential multipliers is presented. The proposed sequential multiplier achieves 50% reduction in area-delay product over the best of existing sequential multipliers for m = 163, indicating an efficient design in terms of both area and delay. The Application Specific Integrated Circuit (ASIC) and the Field Programmable Gate Array (FPGA) implementation results indicate a significantly less power-delay and area-delay products of the proposed sequential multiplier over existing multipliers.

• 한국컴퓨터정보학회논문지
• /
• 제20권2호
• /
• pp.1-10
• /
• 2015

본 논문에서는 유한체 $GF(3^m)$상에서 모든 항에 0이 아닌 계수를 갖는 기약 다항식에 대하여 m이 홀수 및 짝수인 경우 $GF(3^m)$상의 곱셈 알고리즘을 제시하였으며, 제시한 곱셈 알고리즘을 이용하여 고속의 병렬 입-출력 모듈구조의 곱셈기를 설계하였다. 제시한 곱셈기의 구성은 $(m+1)^2$개의 동일한 기본 셀들로 설계되었으며, 셀에 메모리를 사용하지 않았으므로 회로가 간단하며 셀당 $T_A+T_X$의 지연시간을 갖는다. 본 논문에서 제안한 곱셈기는 규칙성과 셀 배열에 의한 모듈성을 가지므로 m이 큰 회로의 확장이 용이하며 VLSI회로 실현에 적합할 것이다.

• 정보보호학회논문지
• /
• 제12권3호
• /
• pp.87-94
• /
• 2002

본 논문에서는 GF($2^m$)상에서 새로운 MSB 우선 곱셈 알고리즘을 제안하고, 셀룰라 오토마타(Cellular Automata, CA) 를 기반으로 한 곱셈기를 설계한다. 본 논문에서 제안한 곱셈기는 PBCA(Periodic Boundary CA)의 특성을 AOP(All One Polynomial)의 특성과 조화시킴으로써 기존의 구조에 비하여 정규성을 높이고 지연 시간을 줄일 수 있는 구조이다. 제안된 곱셈기는 공개키 암호화의 핵심이 되는 지수기의 구현을 위한 효율적인 기본구조로 사용될 것으로 기대된다.

• 대한수학회보
• /
• 제26권2호
• /
• pp.169-173
• /
• 1989

Let V={(x,y,z):f=z$^{n}$ -npz+(n-1)q=0 for n .geq. 3} be a compled analytic subvariety of a polydisc in $C^{3}$ where p=p(x,y) and q=q(x,y) are holomorphic near (x,y)=(0,0) and f is an irreducible Weierstrass polynomial in z of multiplicity n. Suppose that V has an isolated singular point at the origin. Recall that the z-discriminant of f is D(f)=c(p$^{n}$ -q$^{n-1}$) for some number c. Suppose that D(f) is square-free. then we prove that by Theorem 2.1 .mu.(p$^{n}$ -q$^{n-1}$)=.mu.(f)-(n-1)+n(n-2)I(p,q)+1 where .mu.(f), .mu. p$^{n}$ -q$^{n-1}$are the corresponding Milnor numbers of f, p$^{n}$ -q$^{n-1}$, respectively and I(p,q) is the intersection number of p and q at the origin. By one of applications suppose that W$_{t}$ ={(x,y,z):g$_{t}$ =z$^{n}$ -np$_{t}$ $^{n-1}$z+(n-1)q$_{t}$ $^{n-1}$=0} is a smooth family of complex analytic varieties near t=0 each of which has an isolated singularity at the origin, satisfying that the z-discriminant of g$_{t}$ , that is, D(g$_{t}$ ) is square-free. If .mu.(g$_{t}$ ) are constant near t=0, then we prove that the family of plane curves, D(g$_{t}$ ) are equisingular and also D(f$_{t}$ ) are equisingular near t=0 where f$_{t}$ =z$^{n}$ -np$_{t}$ z+(n-1)q$_{t}$ =0.}$ =0.