• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.1-9
• /
• 2020

Many cryptographic and error control coding algorithms rely on finite field GF(2m) arithmetic. Hardware implementation of these algorithms needs an efficient realization of finite field arithmetic operations. Finite field multiplication is complicated among the basic operations, and it is employed in field exponentiation and division operations. Various algorithms and architectures are proposed in the literature for hardware implementation of finite field multiplication to achieve a reduction in area and delay. In this paper, a low area and delay efficient semi-systolic multiplier over finite fields GF(2m) using the modified Montgomery modular multiplication (MMM) is presented. The least significant bit (LSB)-first multiplication and two-level parallel computing scheme are considered to improve the cell delay, latency, and area-time (AT) complexity. The proposed method has the features of regularity, modularity, and unidirectional data flow and offers a considerable improvement in AT complexity compared with related multipliers. The proposed multiplier can be used as a kernel circuit for exponentiation/division and multiplication.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.754-755
• /
• 2017

This paper present a method of base conversion over finite fields which is the important and its application fields are maximization in the 21C knowledge based information society. The proposed method is more regularity and extensibility compare with previous relational method recently.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.1 s.173
• /
• pp.144-155
• /
• 2000

초록 The validity, of a single parameter such as stress intensity, factor K or J-integral in traditional fracture mechanics depends strongly on the geometry, and loading condition. Therefore the second parameter like T-stress measuring the stress constraint is additionally needed to characterize the general crack-tip fields. While many, research works have been done to verify, the J-T description of elastic-plastic crack-tip stress fields in plane strain specimens, limited works (especially. for bimaterials) have been performed to describe the structural surface crack-front stress fields with the two parameters. On this background, via detailed three dimensional finite element analyses for surface-cracked plates and straight pipes of homogeneous materials and bimaterials under various loadings, we investigate the extended validity or limitation of the two parameter approach. We here first develop a full 3D mesh generating program for semi-elliptical surface cracks, and calculate elastic T-stress from the obtained finite element stress field. Comparing the J-T predictions to the elastic-plastic stresses from 3D finite element analyses. we then confirm the extended validity of fracture mechanics methodology based on the J-T two parameters in characterizing the surface crack-front fields of welded plates and pipes under various loadings.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2201-2206
• /
• 2008

This paper presents a method of constructing the Linear Digital Switching Function(LDSF) over finite fields. The proposed method is as following. First of all, we extract the input/output relationship of linear characteristics for the given digital switching functions, Next, we convert the input/output relationship to Directed Cyclic Graph(DCG) using basic gates adder and coefficient multiplier that are defined by mathematical properties in finite fields. Also, we propose the new factorization method for matrix characteristics equation that represent the relationship of the input/output characteristics. The proposed method have properties of generalization and regularity. Also, the proposed method is possible to any prime number multiplication expression.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.451-456
• /
• 2004

Given a function on a scheme over a finite field, we can count the number of rational points of the scheme having the same values. We show that if the function, viewed as a morphism to the affine line, is proper and its higher direct image sheaves are tamely ramified at the infinity then the values are uniformly distributed up to some degree.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.917-930
• /
• 2009

We find all distinct representatives of isomorphism classes of genus-3 pointed trigonal curves and compute the number of isomorphism classes of a special class of genus-3 pointed trigonal curves including that of Picard curves over a finite field F of characteristic 2.

• The Pure and Applied Mathematics
• /
• v.18 no.3
• /
• pp.269-274
• /
• 2011

We investigate the divisor class group of surfaces over finite fields. For some surfaces the divisor class group depends on the characteristic of the field. We calculate the determinant of a matrix which will provide an information about the divisor class group of the surfaces.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.15 no.5
• /
• pp.29-33
• /
• 1978

In this paper, the properties of Galois fields defined over any finite field are analysed to derive Galois switching functions and the arithmetic operation methods over any finite field are showed. The polynomial expansions over finite fields by Lagrange's interpolation method are derived and proved. The results are applied to multivalued single variable logic networks.

• Journal of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1515-1528
• /
• 2019

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A{\subseteq}F^d_q$ and edges assigned the algebraic distance between pairs of vertices. We prove nontrivial results on locating specified subgraphs of maximum vertex degree at most t in dimensions $d{\geq}2t$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1773-1778
• /
• 2006

This paper propose the method of constructing the Digital Logic Systems based on the Improved Automatic Theorem Proving Techniques(IATP) over Finite Fields. The proposed method is as following. First, we discuss the background and the important mathematical properties for Finite Fields. Also, we discuss the concepts of the Automatic Theorem Proving Techniques(ATP) including the syntactic method and semantic method, and discuss the basic properties for the Alf. In this step, we define several definitions of the IAIP, Table Pseudo Function Tab and Equal. Next, we propose the T-gate as Building Block(BB) and describe the mathematical representation for the notation of T-gate. Then we discuss the important properties for the T-gate. Also, we propose the several relationships that are Identity relationship, Constant relationship, Tautology relationship and Mod R cyclic relationship. Then we propose Mod R negation gate and the manipulation of the don't care conditions. Finally, we propose the algorithm for the constructing the method of the digital logic systems over finite fields. The proposed method is more efficiency and regularity than my other earlier methods. Thet we prospect the future research and prospects.