• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.729-740
• /
• 2018

In this paper, we define near-minimal shadow and study the existence problem of extremal Type I additive self-dual codes over GF(4) with near-minimal shadow. We prove that there is no such codes if the code length n = 6m+1($m{\geq}0$), $n=6m+5(m{\geq}1)$.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.3
• /
• pp.197-203
• /
• 2009

Finite field arithmetic is very important in the area of cryptographic applications and coding theory, and it is efficient to use normal bases in hardware implementation. Using the fact that $GF(2^{mk})$ having a type-I optimal normal basis becomes the extension field of $GF(2^m)$, we, in this paper, propose a new serial multiplier which reduce the critical XOR path delay of the best known Reyhani-Masoleh and Hasan's serial multiplier by 25% and the number of XOR gates of Kwon et al.'s multiplier by 2 based on the Reyhani-Masoleh and Hasan's serial multiplier for type-I optimal normal basis.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• 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.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.47 no.3
• /
• pp.267-272
• /
• 2011

The behavior of abrasive wear on counterpart roughness of glass fiber reinforcement polyurethane resin (GF/PUR) composites were investigated at ambient temperature by pin-on-disc friction test. The friction coefficient, cumulative wear volume and surface roughness of these materials against SiC abrasive paper were determined experimentally. The major failure mechanisms were lapping layers, ploughing, delamination, deformation of resin and cracking by scanning electric microscopy (SEM) photograph of the tested surface. As increasing the counterpart roughness the GF/PUR composites indicated higher friction coefficient. The surface roughness of the GF/PUR composites was increased as the sliding velocity was higher and the counterpart roughness was rougher in wear test.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.3
• /
• pp.1-8
• /
• 2002

Modular Multiplication in Galois Field GF(2/sup m/) is a basic operation for many applications, particularly for public key cryptography. This paper presents a new architecture that can process modular multiplication on GF(2/sup m/) per m clock cycles using a cellular automata. Proposed architecture is more efficient in terms of the space and time than that of systolic array. Furthermore it can be efficiently used for the hardware design for exponentiation computation.

• International Journal of Concrete Structures and Materials
• /
• v.8 no.1
• /
• pp.27-41
• /
• 2014

The use of carbon fibers (CF) and glass fibers (GF) were combined to strengthen concrete flexural members. In this study, data of tensile tests of 94 hybrid carbon-glass FRP sheets and 47 carbon and GF rovings or sheets were thoroughly investigated in terms of tensile behavior. Based on comparisons between the rule of mixtures and test data, positive hybrid effects were identified for various (GF/CF) ratios. Unlike the rule of mixtures, the hybrid sheets with relatively low (GF/CF) ratios also produced pseudo-ductility. From the calibrated results obtained from experiments, a new analytical model for the stress-strain relationship of hybrid FRP sheets was proposed. Finally, the hybrid effects were verified by structural tests of concrete members strengthened with hybrid FRP sheets and either carbon or glass FRP sheets.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.41 no.1
• /
• pp.78-84
• /
• 2005

The main goal of this work is to study the effects of temperature and volume fraction of fiber on the Charpy impact test with GF/PP composites. The critical fracture energy and failure mechanisms of GF/PP composites are investigated in the temperature range of 60^{\circ}C$ to -50^{\circ}C$ by impact test. The critical fracture energy increased as the fiber volume fraction ratio increased. The critical fracture energy shows a maximum at ambient temperature and it tends to decreases as temperature goes up or goes down. Major failure mechanisms can be classified such as fiber matrix debonding, fiber pull-out and/or delamination and matrix deformation.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1998.12a
• /
• pp.527-536
• /
• 1998

블록암호의 설계에서 S-box는 가장 중요한 요소이다. S-box의 크기는 기존공격에 대한 안전도와 수행 시 필요한 메모리량, 수행속도가 동시에 고려되어 선택되어야 한다. 일반적으로 S-box의 입출력의 크기가 커지면 안전도와 메모리 소요량은 크게 증가하며 수행속도는 저하된다. 한편, GF(2$^{n}$ )에서의 멱함수(power permutation)는 DC, LC에 강하므로 여러 암호에 적용되었으나 최근 고계차분공격(higher order differential attack)과 보간공격 (interpolation attack)에 의해 공격된 바 있다. 본문에서는 DC, LC, 고계차분공격, 보간공격에 안전한 S-box로서 GF(2$^{n}$ )에서의 멱함수인 $\chi$$^{-2}$ $^{k}$ (k < n)를 구성하고, n이 짝수일 때 메모리 소요량이 보다 적은 구현방법으로서 GF(2$^{n}$ 2/)의 연산을 이용하는 방법을 제시한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.270-274
• /
• 2009

In this paper, we propose an efficient computation method over GF($2^m$) for memory-constrained devices. While previous methods concentrated only on fast multiplication, we propose to reduce the amount of required memory by cleverly changing the order of suboperations. According to our experiments, the new method reduces the memory consumption by about 20% compared to the previous methods, and it achieves a comparable speed with them.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.915-923
• /
• 2015

Self-dual codes have been actively studied because of their connections with other mathematical areas including t-designs, invariant theory, group theory, lattices, and modular forms. We presented the building-up construction for self-dual codes over GF(q) with $q{\equiv}1$ (mod 4), and over other certain rings (see [19], [20]). Since then, the existence of the building-up construction for the open case over GF(q) with $q=p^r{\equiv}3$ (mod 4) with an odd prime p satisfying $p{\equiv}3$ (mod 4) with r odd has not been solved. In this paper, we answer it positively by presenting the building-up construction explicitly. As examples, we present new optimal self-dual [16, 8, 7] codes over GF(7) and new self-dual codes over GF(7) with the best known parameters [24, 12, 9].