• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1538-1544
• /
• 2006

This paper proposes a non-systolic parallel $AB^2+C$ Computing unit based on irreducible AOP order m of $GF(2^m)$. Proposed circuit have only AND gates and EX-OR gates, composes of cyclic shift operation, multiplication operation power operation power-sum operation and addition operation using a merry irreducible AOP. Suggested operating a method have an advantage high speed data processing, low power and integration because of only needs AND gates and EX-OR gates. $AB^2+C$ computing unit has delay-time of $T_A+(1+[log^m_2])T_X$.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.4
• /
• pp.35-41
• /
• 2000

In this paper, the multiplicative algorithm of two polynomals over finite field GF(2$^{m}$ ) is presented. The proposed algorithm permits an efficient realization of the parallel multiplication using iterative arrays. At the same time, it permits high-speed operation. This multiplier is consisted of three operation unit: multiplicative operation unit, the modular operation unit, the primitive irreducible operation unit. The multiplicative operation unit is composed of AND gate, X-OR gate and multiplexer. The modular operation unit is constructed by AND gate, X-OR gate. Also, an efficient pipeline form of the proposed multiplication scheme is introduced. All multipliers obtained have low circuit complexity permitting high-speed operation and interconnection of the cells are regular, well-suited for VLSI realization.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.1
• /
• pp.41-48
• /
• 1999

This paper presents a production method to GRM coefficients which is consists of 3n polarities to n variables over GF(3). General production method is searching for transformation matrix for a single variable and then kronecker products for n times. This paper presents a production method of GRM coefficients using DD(Decision Diagrma). Change of coefficients to a single variable are apply to DD and extended to n variables.

• Fisheries and Aquatic Sciences
• /
• v.22 no.11
• /
• pp.24.1-24.7
• /
• 2019

Sporophylls from sea mustard, Undaria pinnatifida, which are by-products in seaweed production industries, were taken from Hansan Island, Tongyeong, and Gijang, Busan, and investigated for their fucoidan content and corresponding antioxidant activities. The extracted fucoidan yield from sporophylls of sea mustard samples from Tongyeong (TF) and Gijang (GF) were 12.1% and 13.6%, respectively. The antioxidant activities assessment of TF and GF extracts showed relative significant difference between samples, suggesting effect of location on bioactivities of fucoidan samples. GF was 50-68% more effective than TF against DPPH and superoxide radicals samples which may be attributed to the difference in their degree of sulfation and monosaccharide composition. Meanwhile, TF exhibited greater scavenging activity against hydroxyl radicals compared to GF which could be due to protein impurities.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.3
• /
• pp.211-219
• /
• 2002

In this paper, a new architecture that can simultaneously process modular multiplication and squaring on GF(2$^{m}$ ) in m clock cycles by using the cellular automata is presented. This can be used efficiently for the design of the modular exponentiation on the finite field which is the basic computation in most public key crypto systems such as Diffie-Hellman key exchange, EIGamal, etc. Also, the cellular automata architecture is simple, regular, modular, cascadable and therefore, can be utilized efficiently for the implementation of VLSI.

• International Journal of Oral Biology
• /
• v.41 no.3
• /
• pp.119-123
• /
• 2016

Acetylcholine receptors (AChR) including muscarinic and nicotinic AChR are widely expressed and mediate a variety of physiological cellular responses in neuronal and non-neuronal cells. Notably, a functional cholinergic system exists in oral epithelial cells, and nicotinic AChR (nAChR) mediates cholinergic anti-inflammatory responses. However, the pathophysiological roles of AChR in periodontitis are unclear. Here, we show that activation of AChR elicits increased cytosolic $Ca^{2+}([Ca^{2+}]_i)$, transient cytotoxicity, and induction of receptor activator of nuclear factor kappa-B ligand (RANKL) expression. Intracellular $Ca^{2+}$ mobilization in human gingival fibroblast-1 (hGF-1) cells was measured using the fluorescent $Ca^{2+}$ indicator, fura-2/AM. Cytotoxicity and induction of gene expression were evaluated by measuring the release of glucose-6-phosphate dehydrogenase and RT-PCR. Activation of AChR in hGF-1 cells by carbachol (Cch) induced $[Ca^{2+}]_i$ increase in a dose-dependent manner. Treatment with a high concentration of Cch on hGF-1 cells caused transient cytotoxicity. Notably, treatment of hGF-1 cells with Cch resulted in upregulated RANKL expression. The findings may indicate potential roles of AChR in gingival fibroblast cells in bone remodeling.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.337-342
• /
• 2010

In this paper, a new architecture for digit-parallel/bit-serial GF($2^m$) multiplier with low complexity is proposed. The proposed multiplier operates in polynomial basis of GF($2^m$) and produces multiplication results at a rate of one per D clock cycles, where D is the selected digit size. The digit-parallel/bit-serial multiplier is faster than bit-serial ones but with lower area complexity than bit-parallel ones. The most significant feature of the digit-parallel/bit-serial architecture is that a trade-off between hardware complexity and delay time can be achieved. But the traditional digit-parallel/bit-serial multiplier needs extra hardware for high speed. In this paper a new low complexity efficient digit-parallel/bit-serial multiplier is presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.12
• /
• pp.981-989
• /
• 1990

Thos paper summarized previously proposed several public key distribution systems and proposes a new public key distribution system to generate an common secret conference key for public key distribution systems three or more user. The now system is based on discrete exponentiation, that is all operations involve reduction modulo p for large prime p and we study some novel characteristics for computins multiplicative inverse in GF(p). We use one-way communication to distribute work keys, while the other uses two-way communication. The security of the new system is based on the difficulty of determining logarithms in a finite field GF(p) and stronger than Diffie-Hellman public key distribution system.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.780-790
• /
• 2011

This paper presents an efficient differential power analysis (DPA) countermeasure for the $Eta_T$ pairing algorithm over GF($2^n$). The proposed algorithm is based on a random value addition (RVA) mechanism. An RVA-based DPA countermeasure for the $Eta_T$ pairing computation over GF($3^n$) was proposed in 2008. This paper examines the security of this RVA-based DPA countermeasure and defines the design principles for making the countermeasure more secure. Finally, the paper proposes an efficient RVA-based DPA countermeasure for the secure computation of the $Eta_T$ pairing over GF($2^n$). The proposed countermeasure not only overcomes the security flaws in the previous RVAbased method but also exhibits the enhanced performance. Actually, on the 8-bit ATmega128L and 16-bit MSP430 processors, the proposed method can achieve almost 39% and 43% of performance improvements, respectively, compared with the best-known countermeasure.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.4
• /
• pp.81-87
• /
• 1989

A cellular array multiplier for performing the multiplication of two elements in the finite field GF($2^m$) is presented in this paper. This multiplier is consisted of three operation part ; the multiplicative operation part, the modular operation part, and the primitive irreducible polynomial operation part. The multiplicative operation part and the modular operation part are composed by the basic cellular arrays designed AND gate and XOR gate. The primitive iirreducible operation part is constructed by XOR gates, D flip-flop circuits and a inverter. The multiplier presented here, is simple and regular for the wire routing and possesses the properties of concurrency and modularity. Also, it is expansible for the multiplication of two elements in the finite field increasing the degree m and suitable for VLSI implementation.