• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1297-1308
• /
• 2006

Multiplications in finite fields are one of the most important arithmetic operations for implementations of elliptic curve cryptographic systems. In this paper, we propose a new multiplication algorithm and VLSI architecture over $GF(2^m)$ using Gaussian normal basis. The proposed algorithm is designed by using a symmetric property of normal elements multiplication and transforming coefficients of normal elements. The proposed multiplication algorithm is applicable to all the five recommended fields $GF(2^m)$ for elliptic curve cryptosystems by NIST and IEEE 1363, where $m\in${163, 233, 283, 409, 571}. A new VLSI architecture based on the proposed multiplication algorithm is faster or requires less hardware resources compared with previously proposed normal basis multipliers over $GF(2^m)$. In addition, we gives an easy method finding a basic multiplication matrix of normal elements.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.3
• /
• pp.113-123
• /
• 2007

This paper presents a high-performance elliptic curve cryptographic processor over $GF(2^m)$. The proposed design adopts Lopez-Dahab Montgomery algorithm for elliptic curve point multiplication and uses Gaussian normal basis for $GF(2^m)$ field arithmetic operations. We select m=163 which is the smallest value among five recommended $GF(2^m)$ field sizes by NIST and it is Gaussian normal basis of type 4. The proposed elliptic curve cryptographic processor consists of host interface, data memory, instruction memory, and control. We implement the proposed design using Xilinx XCV2000E FPGA device. Based on the FPGA implementation results, we can see that our design is 2.6 times faster and requires significantly less hardware resources compared with the previously proposed best hardware implementation.

• Asian-Australasian Journal of Animal Sciences
• /
• v.18 no.8
• /
• pp.1080-1087
• /
• 2005

By screening specific genes related to the muscle growth of swine using cDNA microarray technology, a total of 5 novel genes (GF (growth factor) I, II, III, IV and V) were identified. Results of southern blotting to investigate the number of copies of these genes in the genome of swine indicated that GF I, GF III, and GF V existed as one copy and GF II, and GF IV existed as more than two copies. It was suggested that there are many isoforms of these genes in the genome of swine. Also, results of northern blotting to investigate whether these genes were expressed in grown muscle, using GF I, III, and V indicated that all the genes were much more expressed in the muscle of swine with body weight of 90 kg. Expression patterns of these genes in other organs, namely muscle and propagation and fat tissues, were investigated by extracting RNA from the tissues. These genes were not expressed in the propagation and fat tissues, but were expressed in the muscle tissue. To determine the mechanism of muscle growth, further studies should be preceded using the 3 specific genes related to muscle growth, that is GF I, III, and V.

• Korean Journal of Human Ecology
• /
• v.17 no.5
• /
• pp.963-973
• /
• 2008

Clothing pressure is closely connected with the degree of comfort of an athlete's tight-fitting garments. Therefore, the construction of sports garments is very important to the wearer's athletic performance. In this study, the fundamental relationship between the reduction rates of stretch fabrics and clothing pressure was explored with the aim of improving clothing comfort and obtaining a systematic pattern reduction for women's tight-fitting bodysuits. A women's bodysuit pattern was obtained by the draping method using a dressform. The basic pattern was divided into four parts and changed into reduced pattems according to the amount of fabric stretch determined by ASTM D2594. Clothing pressure was measured using an air-pack-type pressure sensor (model AMI 3037-2) at 20 locations (shoulder, 9 locations; bust, 5; and armhole, 6). Among the 15 garments tested, the mean pressure of the A1 bodysuit was 4.60 $gf/cm^2$, and that of the C5 bodysuit was 22.98 $gf/cm^2$. The mean pressures of the bodysuits with reduction rates of 10% and 20% were below 10 $gf/cm^2$, while those of suits with reduction rates of 30%,40%, and 50% (except C5) were below 20 $gf/cm^2$. The pressure at the shoulder was 9.50$\sim$32.24 $gf/cm^2$, which was higher than that at the bust (3.34$\sim$24.56 $gf/cm^2$) and the armhole (0.95$\sim$12.15 $gf/cm^2$). The mean pressures of the 15 bodysuits were divided into five groups using analysis of variance (ANOVA), and were found to be significantly different (p<0.001). Regression analysis afforded the following expression: mean pressure ($gf/cm^2$) = 1.607 + 0.369[reduction rate (%)].

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.2
• /
• pp.127-132
• /
• 2003

Cryptosystems have received very much attention in recent years as importance of information security is increased. Most of Cryptosystems are defined over finite or Galois fields GF($2^m$) . In particular, the finite field GF($2^m$) is mainly used in public-key cryptosystems. These cryptosystems are constructed over finite field arithmetics, such as addition, subtraction, multiplication, and multiplicative inversion defined over GF($2^m$) . Hence, to implement these cryptosystems efficiently, it is important to carry out these operations defined over GF($2^m$) fast. Among these operations, since multiplicative inversion is much more time-consuming than other operations, it has become the object of lots of investigation. Recently, many methods for computing multiplicative inverses at hi호 speed has been proposed. These methods are based on format's theorem, and reduce the number of required multiplication using normal bases over GF($2^m$) . The method proposed by Itoh and Tsujii[2] among these methods reduced the required number of times of multiplication to O( log m) Also, some methods which improved the Itoh and Tsujii's method were proposed, but these methods have some problems such as complicated decomposition processes. In practical applications, m is frequently selected as a power of 2. In this parer, we propose a fast method for computing multiplicative inverses in GF($2^m$) , where m = ($2^n$) . Our method requires fewer ultiplications than the Itoh and Tsujii's method, and the decomposition process is simpler than other proposed methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.4
• /
• pp.83-89
• /
• 2006

In H/W implementation for the finite field, the use of normal basis has several advantages, especially, the optimal normal basis is the most efficient to H/W implementation in GF($2^m$). In this paper, we propose a new, simpler, parallel multiplier over GF($2^m$) having a type II optimal normal basis, which performs multiplication over GF($2^m$) in the extension field GF($2^{2m}$). The time and area complexity of the proposed multiplier is same as the best of known type II optimal normal basis parallel multiplier.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.277-280
• /
• 2000

q가 소수의 거듭제곱의 형태일 때 GF(q)상에서의 1차원 셀룰라 오토마타의 여러 가지 특성들을 연구한다. 이러한 셀룰라 오토마타의 특성다항식에 관한 몇가지 특성들이 제시한다. Intermediate Boundary CA를 정의하고 Null Boundary CA와의 관계를 살펴본다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.266-268
• /
• 2003

본 논문에서는 정규 기저 표현(normal bases representation)을 갖는 GF(2$^n$) 상에서의 병렬 멱승 연산에 있어서, 프로세서 수가 고정된 경우에 라운드 수를 개선하는 방안에 대하여 기술한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.434-436
• /
• 2003

본 논문에서는 디자인패턴 개념을 이용하여 GF(2$^{m}$ )상에서의 타원곡선 암호알고리즘을 객체지향적으로 설계하는 방법에 대해서 논해보고, 이틀 이용하여 타원곡선 암호 라이브러리 구현에 핵심이 되는 연산 클래스에 대한 전체적인 framework 및 UML을 제시한다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.84-87
• /
• 2002

최근 정보보호의 중요성이 커짐에 따라 암호이론에 대한 관심이 증가되고 있다. 이 중 Galois 체 GF(2$^{m}$ )은 대부분의 암호시스템에서 사용되며, 특히 공개키 기반 암호시스템에서 주로 사용된다. 이들 암호시스템에서는 GF(2$^{m}$ )에서 정의된 연산, 즉 덧셈, 뺄셈, 곱셈 및 곱셈 역원 연산을 기반으로 구축되므로, 이들 연산을 고속으로 계산하는 것이 중요하다. 이들 연산 중에서 곱셈 역원이 가장 time-consuming하다. Fermat의 정리를 기반으로 하고, GF(2$^{m}$ )에서 정규기저를 사용해서 곱셈 역원을 고속으로 계산하기 위해서는 곱셈 횟수를 감소시키는 것이 가장 중요하며, 이와 관련된 방법들이 많이 제안되어 왔다. 이 중 Itoh와 Tsujii가 제안한 방법[2]은 곱셈 횟수를 O(log m)까지 감소시켰다. 본 논문에서는 Itoh와 Tsujii가 제안한 방법을 이용해서, m=2$^n$인 경우에 곱셈 역원을 고속으로 계산하는 방법을 제안한다. 본 논문의 방법은 필요한 곱셈 횟수가 Itoh와 Tsujii가 제안한 방법 보다 적으며, m-1의 분해가 기존의 방법보다 간단하다.