• Title/Summary/Keyword: gf

Search Result 954, Processing Time 0.03 seconds

(The Design of Parallel Ternary-Valued Multiplier Using Current Mode CMOS) (전류모드 CMOS를 사용한 병렬 3치 승산기 설계)

  • Sim, Jae-Hwan;Byeon, Gi-Yeong;Yun, Byeong-Hui;Lee, Sang-Mok;Kim, Heung-Su
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.39 no.2
    • /
    • pp.123-131
    • /
    • 2002
  • In this paper, a new standard basis parallel ternary-valued multiplier circuit designed using current mode CMOS is presented. Prior to constructing the GF(3$^{m}$) multiplier circuit, we provide a GF(3) adder and a GF(3) multiplier with truth tables and symbolize them, and also design them using current mode CMOS circuit. Using the basic ternary operation concept, a ternary adder and a multiplier, we develop the equations to multiply arbitrary two elements over GF(3$^{m}$). Following these equations, we can design a multiplier generalized to GF(3$^{m}$). For the proposed circuit in this paper, we show the example in GF(3$^{3}$). In this paper, we assemble the operation blocks into a complete GF(3$^{m}$) multiplier. Therefore the proposed circuit is easy to generalize for m and advantageous for VLSI. Also, it need no memory element and the latency not less fewer than other circuit. We verify the proposed circuit by functional simulation and show its result.

A Low Complexity Bit-Parallel Multiplier over Finite Fields with ONBs (최적정규기저를 갖는 유한체위에서의 저 복잡도 비트-병렬 곱셈기)

  • Kim, Yong-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.4
    • /
    • pp.409-416
    • /
    • 2014
  • 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)$. The finite field $GF(2^m)$ with type I optimal normal basis(ONB) has the disadvantage not applicable to some cryptography since m is even. The finite field $GF(2^m)$ with type II ONB, however, such as $GF(2^{233})$ are applicable to ECDSA recommended by NIST. In this paper, we propose a bit-parallel multiplier over $GF(2^m)$ having a type II ONB, which performs multiplication over $GF(2^m)$ in the extension field $GF(2^{2m})$. The time and area complexity of the proposed multiplier is the same as or partially better than the best known type II ONB bit-parallel multiplier.

Anti-inflammatory Effect of HaGF peptide of Harmonia axyridis (무당벌레에서 유래된 HaGF peptide를 이용한 염증 억제 효과)

  • Kim, Dong-Hee;Kim, Hyeon-Jeong;Lee, Jin-Young;Hwang, Jae-Sam;Kim, In-Woo;Lee, Seul-Gi;Jeong, Hyeon-Guk;An, Bong-Jeun
    • Journal of Life Science
    • /
    • v.23 no.4
    • /
    • pp.495-500
    • /
    • 2013
  • Harmonia axyridis is known to display diverse biological activities, such as growth promotion. However, few studies have investigated the effect of H. axyridis on inflammation of the skin. In this study, we explored the anti-inflammatory effect of the Harmoniasin gene fragment (HaGF) peptide from H. axyridis on macrophage cells. During the entire experimental period, 5, 25, 50, and 100 ${\mu}g/ml$ of HaGF showed no cytotoxicity. However, at these concentrations, HaGF inhibited the activity of iNOS and COX-2 by 51% and 49%, respectively. In addition, the HaGF extract reduced the release of inflammatory cytokines, including TNF-a and IL-6. Therefore, HaGF has been LPS-induced macrophage Raw 264.7 cells could be expected from the inhibitory effects of the inflammatory.

EXPRESSION OF PLACENTA GROWTH FACTOR IN THE ORAL SQUAMOUS CELL CARCINOMA (구강 편평세포암종에서 태반성장인자의 발현)

  • Lee, Sang-Gu;Kim, Chul-Hwan
    • Maxillofacial Plastic and Reconstructive Surgery
    • /
    • v.31 no.1
    • /
    • pp.27-34
    • /
    • 2009
  • Angiogenesis is essential for solid tumor growth and progression. Among the pro-angiogenetic factors, vascular endothelial growth factor(VEGF), also known as vascular permeability factor, is the most important as a mitogen for vascular endothelium. The VEGF family of molecules currently consists of six growth factors, VEGF-A, VEGF-B, VEGF-C, VEGF-D, VEGF-E, and placenta growth factor(PlGF). Over-expression of PlGF is associated with angiogenesis under pathological conditions such as ischemia, inflammation, and cancer. Hence, the goal of this study is to identify the correlation of clinicopathlogical factors and the up-regulation of PlGF expression in oral squamous cell carcinoma. We studied the immunohistochemical staining of PlGF, PlGF gene expression and a real time quantitative RT-PCR in 20 specimens of 20 patients with oral squamous cell carcinoma. The results were as follows. 1. In the immunohistochemical study of poorly differentiated and invasive oral squamous cell carcinoma, the high level staining of PlGF was observed. And the correlation between immunohistopathological PlGF expression and histological differentiation of specimens was significant (Pearson correlation analysis, significance [r] >0.6, P < .05). 2. In the PlGF gene RT-PCR analysis, PlGF expression was more in tumor tissue than in adjacent normal tissue. Paired-samples analysis determined the difference of PlGF mRNA expression level between the cancer tissue and the normal tissue (Student's t - test, P < .05) These findings suggest that up-regulation of the PlGF gene may play a role in progression and local metastasis in invasive oral squamous cell carcinoma.

Ginsenoside F2 Restrains Hepatic Steatosis and Inflammation by Altering the Binding Affinity of Liver X Receptor Coregulators

  • Kyurae Kim;Myung-Ho Kim;Ji In Kang;Jong-In Baek;Byeong-Min Jeon;Ho Min Kim;Sun-Chang Kim;Won-Il Jeong
    • Journal of Ginseng Research
    • /
    • v.48 no.1
    • /
    • pp.89-97
    • /
    • 2024
  • Background: Ginsenoside F2 (GF2), the protopanaxadiol-type constituent in Panax ginseng, has been reported to attenuate metabolic dysfunction-associated steatotic liver disease (MASLD). However, the mechanism of action is not fully understood. Here, this study investigates the molecular mechanism by which GF2 regulates MASLD progression through liver X receptor (LXR). Methods: To demonstrate the effect of GF2 on LXR activity, computational modeling of protein-ligand binding, Time-resolved fluorescence resonance energy transfer (TR-FRET) assay for LXR cofactor recruitment, and luciferase reporter assay were performed. LXR agonist T0901317 was used for LXR activation in hepatocytes and macrophages. MASLD was induced by high-fat diet (HFD) feeding with or without GF2 administration in WT and LXRα-/- mice. Results: Computational modeling showed that GF2 had a high affinity with LXRα. LXRE-luciferase reporter assay with amino acid substitution at the predicted ligand binding site revealed that the S264 residue of LXRα was the crucial interaction site of GF2. TR-FRET assay demonstrated that GF2 suppressed LXRα activity by favoring the binding of corepressors to LXRα while inhibiting the accessibility of coactivators. In vitro, GF2 treatments reduced T0901317-induced fat accumulation and pro-inflammatory cytokine expression in hepatocytes and macrophages, respectively. Consistently, GF2 administration ameliorated hepatic steatohepatitis and improved glucose or insulin tolerance in WT but not in LXRα-/- mice. Conclusion: GF2 alters the binding affinities of LXRα coregulators, thereby interrupting hepatic steatosis and inflammation in macrophages. Therefore, we propose that GF2 might be a potential therapeutic agent for the intervention in patients with MASLD.

A Study on Irreducible Polynomial for Construction of Parallel Multiplier Over GF(q$^{n}$ ) (GF($q^n$)상의 병렬 승산기 설계를 위한 기약다항식에 관한 연구)

  • 오진영;김상완;황종학;박승용;김홍수
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.741-744
    • /
    • 1999
  • In this paper, We represent a low complexity of parallel canonical basis multiplier for GF( q$^{n}$ ), ( q> 2). The Mastrovito multiplier is investigated and applied to multiplication in GF(q$^{n}$ ), GF(q$^{n}$ ) is different with GF(2$^{n}$ ), when MVL is applied to finite field. If q is larger than 2, inverse should be considered. Optimized irreducible polynomial can reduce number of operation. In this paper we describe a method for choosing optimized irreducible polynomial and modularizing recursive polynomial operation. A optimized irreducible polynomial is provided which perform modulo reduction with low complexity. As a result, multiplier for fields GF(q$^{n}$ ) with low gate counts. and low delays are constructed. The architectures are highly modular and thus well suited for VLSI implementation.

  • PDF

Triple Error Correcting Reed Solomon Decoder Design Using Galois Subfield Inverse Calculator And Table ROM

  • An Hyeong-Keon;Hong Young-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1C
    • /
    • pp.8-13
    • /
    • 2006
  • A new RS(Reed Solomon) Decoder design method, using Galois Subfield GF($2^4$) Multiplier, is described. The Decoder is designed using Normalized error position stored ROM. Here New Inverse Calculator in GF($2^8$) is designed, which is simpler and faster than the classical GF($2^8$) direct inverse calculator, using the Galois Subfield GF($2^4$) Arithmatic operator.

ALGORITHM FOR THE CONSTRUCTION OF THE STATE TRANSITION DIAGRAM OF A SACA OVER GF($2^p$)

  • Choi, Un-Sook;Cho, Sung-Jin
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1331-1342
    • /
    • 2009
  • In this paper, we analyze the behavior of the state transition of nongroup CA with a single attractor over GF($2^p$)(p > 1), and propose the algorithm for the construction of the state transition diagram of a Single Attractor CA(SACA) over GF($2^p$) which is very different from the construction algorithm for the state transition diagram of GF(2) SACA.

  • PDF

A fast inversion algorithm in $GF((2^n)^m)$ using normal basis (정규 기저를 이용한 $GF((2^n)^m)$에서의 효율적인 역원 알고리즘)

  • 장구영;김호원;강주성
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2003.12a
    • /
    • pp.174-178
    • /
    • 2003
  • 본 논문은 기존의 정규 기저를 이용한 역원 알고리즘인 IT 알고리즘과 TYT 알고리즘을 개선한 GF(q$^{m}$ )*(q = 2$^n$)에서의 효율적인 역원 알고리즘을 제안한다. 제안된 알고리즘은 작은 n에 대해 GF(q)*의 원소에 대한 역원을 선행 계산으로 저장하고, m-1을 몇 개의 인수와 나머지로 분해함으로써 역원 알고리즘에 필요한 곱셈의 수를 줄일 수 있는 방법이다. 즉, 작은 양의 데이터에 대한 메모리 저장 공간을 이용하여, GF(q$^{m}$ )*에서의 역원을 계산하는 데 필요한 곱셈의 수를 줄일 수 있음을 보여준다.

  • PDF

Operations in finite fields using Modified method (Modified 방법을 이용한 유한체의 연산)

  • 김창한
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.8 no.2
    • /
    • pp.27-36
    • /
    • 1998
  • 최근들어 타원곡선 암호법(ECC)이 RSA암호법을 대체할 것으로 기대되면서ECC의 연산속도를 결정하는 중요한 요소인 유한체의 연산 속도에 관심이 고조되고 있다. 본 논문에서는 Modified 최적 정규 기저의 성질 규명과 GF(q)(q=2$^{k}$ , k=8또는 16)위에서 GF(q$^{m}$ )(m: 홀수)의 Mofdified trinomial 기가 존재하는 m들을 제시하고, GF(r$^{n}$ )위에서 GF(r$^{nm}$ )dml Modified 최적 정규기저와 Modified trinomial 기저를 이용한 연산의 회수와 각 기저를 이용한 연산의 회수와 각 기저를 이용한 유한체 GF(q$^{m}$ )의 연산을 S/W화한 결과를 비교 하였다.