• Title/Summary/Keyword: gf

Search Result 957, Processing Time 0.02 seconds

Molecular Analysis and Expression Patterns of the 14-3-3 Gene Family from Oryza Sativa

  • Yao, Yuan;Du, Ying;Jiang, Lin;Liu, Jin-Yuan
    • BMB Reports
    • /
    • v.40 no.3
    • /
    • pp.349-357
    • /
    • 2007
  • The ubiquitous family of 14-3-3 proteins functions as regulators in a variety of physiological processes. Eight rice 14-3-3 genes, designated OsGF14a through h, were identified from an exhaustive search of the genome database. Comparisons of deduced amino acid sequences reveal a high degree of identity among members of the OsGF14 family and reported Arabidopsis 14-3-3 proteins. A phylogenetic study indicates that OsGF14s contain both $\varepsilon$ and non-$\varepsilon$ forms, which is also confirmed by a structural analysis of OsGF14 genes. Furthermore, transcripts of OsGF14b, OsGF14c, OsGF14d, OsGF14e, OsGF14f and OsGF14g were detected in rice tissues. Their different expression patterns, the different effects of environmental stresses and plant hormones on their transcription levels, and the different complementary phenotypes in yeast 14-3-3 mutants not only indicates that OsGF14s are responsive to various stress conditions and regulated by multiple signaling pathways, but also suggests that functional similarity and diversity coexist among the members of OsGF14 family.

Efficient Implementations of Index Calculation Methods of Elliptic Curves using Weil's Theorem (Weil 정리를 이용한 효율적인 타원곡선의 위수 계산법의 구현)

  • Kim, Yong-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.7
    • /
    • pp.693-700
    • /
    • 2016
  • It is important that we can calculate the order of non-supersingular elliptic curves with large prime factors over the finite field GF(q) to guarantee the security of public key cryptosystems based on discrete logarithm problem(DLP). Schoof algorithm, however, which is used to calculate the order of the non-supersingular elliptic curves currently is so complicated that many papers are appeared recently to update the algorithm. To avoid Schoof algorithm, in this paper, we propose an algorithm to calculate orders of elliptic curves over finite composite fields of the forms $GF(2^m)=GF(2^{rs})=GF((2^r)^s)$ using Weil's theorem. Implementing the program based on the proposed algorithm, we find a efficient non-supersingular elliptic curve over the finite composite field $GF(2^5)^{31})$ of the order larger than $10^{40}$ with prime factor larger than $10^{40}$ using the elliptic curve $E(GF(2^5))$ of the order 36.

Evaluation of Impregnating and Mechanical Properties for Glass Fiber/Polycarbonate Composites Depending on Molecular Weight of Matrix (유리섬유/폴리카보네이트 복합재료의 기지 분자량에 따른 함침 및 기계적 물성 평가)

  • Kim, Neul-Sae-Rom;Jang, Yeong-Jin;Lee, Eun-Soo;Kwon, Dong-Jun;Yang, Seong Baek;Lee, Jungeon;Yeum, Jeong Hyun
    • Composites Research
    • /
    • v.34 no.1
    • /
    • pp.1-7
    • /
    • 2021
  • Fiber-reinforced thermoplastic composites are applied to transport industries to lightweight of body, and applications will be expanded gradually. In this study, the impregnation and mechanical properties of continuous glass fiber (GF) reinforced polycarbonate (PC) composites were evaluated with different molecular weights of PC. The continuous GF reinforced PC composite were prepared by using GF fabric and PC film via continuous compression molding method. The melting flow index and tensile strength of PC matrix were evaluated with different molecular weights. Mechanical properties (tensile, flexural, and compressive) and pore rate of GF/PC composite were evaluated with different molecular weights of PC. The fracture behavior was analyzed to fracture surface of GF/PC composite using FE-SEM images. As these results, it was condition of representing the best mechanical property that the GF/PC composite was prepared by using PC of 20,000 g/mol as matrix.

Cell array multiplier in GF(p$^{m}$ ) using Current mode CMOS (전류모드 CMOS를 이용한 GF(P$^{m}$ )상의 셀 배열 승산기)

  • 최재석
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.3
    • /
    • pp.102-109
    • /
    • 2001
  • In this paper, a new multiplication algorithm which describes the methods of constructing a multiplierover GF(p$^{m}$ ) was presented. For the multiplication of two elements in the finite field, the multiplication formula was derived. Multiplier structures which can be constructed by this formula were considered as well. For example, both GF(3) multiplication module and GF(3) addition module were realized by current-mode CMOS technology. By using these operation modules the basic cell used in GF(3$^{m}$ ) multiplier was realized and verified by SPICE simulation tool. Proposed multipliers consisted of regular interconnection of simple cells use regular cellular arrays. So they are simply expansible for the multiplication of two elements in the finite field increasing the degree m.

  • PDF

Lactic Acid Bacteria Increases Hypolipidemic Effect of Crocin Isolated from Fructus of Gardenia jasminoides

  • Lee In-Ah;Min Sung-Won;Kim Dong-Hyun
    • Journal of Microbiology and Biotechnology
    • /
    • v.16 no.7
    • /
    • pp.1084-1089
    • /
    • 2006
  • The fructus of Gardenia jasminoides Ellis (GF) has been widely used as a natural colorant in Asian countries, and also as a Chinese traditional medicine for its homeostatic, antiphlogistic, analgesic, and antipyretic effects. In the present study, its main component, crocin, was fermented with lactic acid bacteria (LAB) and their antihyperlipidemic activity was measured. The GF extract, fermented GF (F-GF), crocin, and fermented crocin (F-crocin) significantly inhibited the increase of serum triglyceride (TG) level in corn oil feeding-induced triglyceridemic mice, as well as that of serum TG and total and LDL cholesterol levels in Triton WR-1339-induced hyperlipidemic mice. These agents also showed hypolipidemic activity in hyperlipidemic mice induced by high fat diet for 5 weeks. F-GF and F-crocin exhibited more potent hyperlipidemic effects than GF and crocin. The results suggest that the hypolipidemic effect of GF and crocin can be synergistically activated by LAB, and that F-GF and F-crocin may improve hyperlipidemia in clinic, compared with GF and crocin.

Distribution of Clothing Pressure under the Brassiere (브래지어 착용시 흥부에서의 의복압 분포)

  • 이미진;김양원
    • The Research Journal of the Costume Culture
    • /
    • v.10 no.2
    • /
    • pp.178-185
    • /
    • 2002
  • The purpose of this study was to measure distribution of clothing pressure on breast in brassiere according to body shape and motion, and the position of hook-and-eye on brassiere, and to get basic data for comfortable brassiere design. Clothing pressure was measured from 8 female subjects under wearing trials in climatic chamber. When brassiere was tied together with inner or outer hook-and-eye, clothing pressure under the condition were 10.2 and 9.6 gf/cm², respectively. With the degree between main body and arms increased from 0° to 45° and 90°to the front, clothing pressure decreased from 10.2 to 9.6 gf/cm², and then increased to 10.4 gf/cm² When the decree was increased from 45° to 70° to the flank, the pressure increased from 9.3 to 10.6 gf/cm². Fat body shape recorded 10.8 gf/cm², and lean body shape recorded 9.5 gf/cm² of clothing pressure by wearing brassiere. Clothing pressures of brassiere were 7.8g gf/cm² in front, 9.5 gf/cm² in side, 12.8 gf/cm² in the back side. Therefore, clothing pressure of brassiere was influenced to the greater extent by body shape and measuring points on human body than by the position of hook-and-eye and body motion.

  • PDF

Design of an Operator Architecture for Finite Fields in Constrained Environments (제약적인 환경에 적합한 유한체 연산기 구조 설계)

  • Jung, Seok-Won
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.3
    • /
    • pp.45-50
    • /
    • 2008
  • The choice of an irreducible polynomial and the representation of elements have influence on the efficiency of operators for finite fields. This paper suggests two serial multiplier for the extention field GF$(p^n)$ where p is odd prime. A serial multiplier using an irreducible binomial consists of (2n+5) resisters, 2 MUXs, 2 multipliers of GF(p), and 1 adder of GF(p). It obtains the mulitplication result after $n^2+n$ clock cycles. A serial multiplier using an AOP consists of (2n+5) resisters, 1 MUX, 1 multiplier of CF(p), and 1 adder of GF(p). It obtains the mulitplication result after $n^2$+3n+2 clock cycles.

Classification of Exponent Permutations over finite fields GF($2^n$) and its applications (유한체 상의 지수 함수의 분류와 암호학에의 응용)

  • Park, Sang-Woo;Kim, Kwang-Jo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.6 no.4
    • /
    • pp.97-106
    • /
    • 1996
  • In this paper, we define an equivalence relation on the group of all permutations over the finite field GF($2^n$) and show each equivalence class has common cryptographic properties. And, we classify all exponent permutations over GF($2^7$) and GF($2^8$). Then, three applications of our results are described. We suggest a method for designing $n\;{\times}\;2n$ S(ubstitution)-boxes by the concatenation of two exponent permutations over GF($2^n$) and study the differential and linear resistance of them. And we can easily indicate that the conjecture of Beth in Eurocrypt '93 is wrong, and discuss the security of S-box in LOKI encryption algorithm.

The polynomial factorization over GF($2^n$) (GF($2^n$) 위에서의 다항식 일수분해)

  • 김창한
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.3
    • /
    • pp.3-12
    • /
    • 1999
  • The public key crytptosystem is represented by RSA based on the difficulty of integer factorization and ElGamal cryptosystem based on the intractability of the discrete logarithm problem in a cyclic group G. The index-calculus algorithm for discrete logarithms in GF${$q^n$}^+$ requires an polynomial factorization. The Niederreiter recently developed deterministic facorization algorithm for polynomial over GF$q^n$ In this paper we implemented the arithmetic of finite field with c-language and gibe an implementation of the Niederreiter's algorithm over GF$2^n$ using normal bases.