• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.407-417
• /
• 2004

It is well known that the nonlinearity of vector Boolean functions F on n-dimensional vector space $GF(2)^n$ to $GF(2)^m$ is bounded above by $2^{n-1} - 2 ^{\frac{n}{2}-1}$. In this paper we derive upper bounds and a lower bound on the nonlinearity of vector Boolean functions in terms of auto-correlations. Strengths and weaknesses of each bounds are examined. Also, we modify the notions of the sum-of-square indicator and absolute indicator for Boolean functions to the case of vector Boolean functions to measure global avalanche characteristics of vector Boolean functions. Using those indicators we compare the global avalanche characteristics of DES (Data Encryption System) and Rijndael.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.12
• /
• pp.29-40
• /
• 2008

The efficient hardware design of finite field multiplication is an very important research topic for and efficient $f(x)=x^n+x^k+1$ implementation of cryptosystem based on arithmetic in finite field GF($2^n$). We used special generating trinomial to construct a bit-parallel multiplier over finite field with low space complexity. To reduce processing time, The hardware architecture of proposed multiplier is similar with existing Mastrovito multiplier. The complexity of proposed multiplier is depend on the degree of intermediate term $x^k$ and the space complexity of the new multiplier is $2k^2-2k+1$ lower than existing multiplier's. The time complexity of the proposed multiplier is equal to that of existing multiplier or increased to $1T_X(10%{\sim}12.5%$) but space complexity is reduced to maximum 25%.

• Journal of Ginseng Research
• /
• v.47 no.3
• /
• pp.420-428
• /
• 2023

Background: Ginsenoside F2 (GF2), a minor component of Panax ginseng, has been reported to possess a wide variety of pharmacological activities. However, its effects on glucose metabolism have not yet been reported. Here, we investigated the underlying signaling pathways involved in its effects on hepatic glucose. Methods: HepG2 cells were used to establish insulin-resistant (IR) model and treated with GF2. Cell viability and glucose uptake-related genes were also examined by real-time PCR and immunoblots. Results: Cell viability assays showed that GF2 up to 50 μM did not affect normal and IR-HepG2 cell viability. GF2 reduced oxidative stress by inhibiting phosphorylation of the mitogen-activated protein kinases (MAPK) signaling components such as c-Jun N-terminal kinase (JNK), extracellular signal-regulated kinase 1/2 (ERK1/2), and p38 MAPK, and reducing the nuclear translocation of NF-κB. Furthermore, GF2 activated PI3K/AKT signaling, upregulated the levels of glucose transporter 2 (GLUT-2) and GLUT-4 in IR-HepG2 cells, and promoted glucose absorption. At the same time, GF2 reduced phosphoenolpyruvate carboxykinase and glucose-6-phosphatase expression as well as inhibiting gluconeogenesis. Conclusion: Overall, GF2 improved glucose metabolism disorders by reducing cellular oxidative stress in IR-HepG2 cells via MAPK signaling, participating in the PI3K/AKT/GSK-3β signaling pathway, promoting glycogen synthesis, and inhibiting gluconeogenesis.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.771-774
• /
• 1998

In this paper proposes a new bit-parallel structure for a multiplier over GF((Pn)m), with k-nm. Mastrovito Multiplier, Karatsuba-ofman algorithm are applied to the multiplication of polynomials over GF(2n). This operation has a complexity of order O(k log p3) under certain constrains regardig k. A complete set of primitive field polynomials for composite fields is provided which perform modulo reduction with low complexity. As a result, multiplier for fields GF(Pk) with low gate counts and low delays are constructed. The architectures are highly modular and thus well suited for VLSI implementation.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.1
• /
• pp.33-40
• /
• 2004

The divide-and-conquer method is efficiently used in parallel multiplier over finite field $GF(2^n)$. Leone Proposed optimal stop condition for iteration of Karatsuba-Ofman algerian(KOA). Ernst et al. suggested Multi-Segment Karatsuba(MSK) method. In this paper, we analyze the complexity of a parallel MSK multiplier based on the method. We propose a new parallel MSK multiplier whose space complexity is same to each other. Additionally, we propose optimal stop condition for iteration of the new MSK method. In some finite fields, our proposed multiplier is more efficient than the KOA.

• Journal of IKEEE
• /
• v.3 no.2 s.5
• /
• pp.285-294
• /
• 1999

This paper presents a method for the generation of GRM coefncients over GF(3) by using a comparison of polarity. In general production method to GRM coefficients over GF(3) is searching for pn different polarity of an n-variable and from these optimal function according to the maximum number of zero coefficients is selected. This paper presents a method for the generation of GRM coefficients by means of compare to the number of zero coefficients without constructing the whole polarity GRM coefficients.

• Review of KIISC
• /
• v.2 no.4
• /
• pp.104-109
• /
• 1992

스위치 이론이나 디지탈 공학$^{2)}$, 정보보호학$^{6.8)}$등의 분야에서 자주 사용되는 많은 함수들은 유한체 GF$(q)^n$에서 GF(q)의 값을 취하는 함수들이다. 특히 q=2인 경우에 함수 f는 쉽게 진리표에 의해 표현된다. 본 글에서는 유한체 위에서 성립하는 행렬 구조를 갖는 대수적 표준형식 변환에 대하여 알아보고, 변환의 계산을 점화적으로 이행해보며, 난수함수의 복잡도에 관한 확률분포를 살펴본다. 대수적 표준형식은 함수의 비선형 위수나 복잡도에 관한 판단에 유용하게 응용할 수 있다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.113-119
• /
• 2004

Exponentiation is widely used in practical applications related with cryptography, and as the discrete log is easily solved in case of a low exponent n, a large exponent n is needed for a more secure system. However. since the time complexity for exponentiation algorithm increases in proportion to the n figure, the development of an exponentiation algorithm that can quickly process the results is becoming a crucial problem. In this paper, we propose a parallel exponentiation algorithm which can reduce the number of rounds with a fixed number of processors, where the field elements are in GF($2^m$), and also analyzed the round bound of the proposed algorithm. The proposed method uses window method which divides the exponent in a particular bit length and make idle processors in window value computation phase to multiply some terms of windows where the values are already computed. By this way. the proposed method has improved round bound.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.1-9
• /
• 2007

For an efficient implementation of cryptosystems based on arithmetic in a finite field $GF(2^n)$, their hardware implementation is an important research topic. To construct a multiplier with low area complexity, the divide-and-conquer technique such as the original Karatsuba-Ofman method and multi-segment Karatsuba methods is a useful method. Leone proposed an efficient parallel multiplier with low area complexity, and Ernst at al. proposed a multiplier of a multi-segment Karatsuba method. In [1], the authors proposed new $MSK_5$ and $MSK_7$ methods with low area complexity to improve Ernst's method. In [3], the authors proposed a method which combines $MSK_2$ and $MSK_3$. In this paper we propose an efficient multiplication method by combining $MSK_2,\;MSK_3\;and\;MSK_5$ together. The proposed method reduces $116{\cdot}3^l$ gates and $2T_X$ time delay compared with Gather's method at the degree $25{\cdot}2^l-2^l with l>0.