• Journal of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1529-1547
• /
• 2021

In this series, we investigate the calculation of mean values of derivatives of Dirichlet L-functions in function fields using the analogue of the approximate functional equation and the Riemann Hypothesis for curves over finite fields. The present paper generalizes the results obtained in the first paper. For µ ≥ 1 an integer, we compute the mean value of the µ-th derivative of quadratic Dirichlet L-functions over the rational function field. We obtain the full polynomial in the asymptotic formulae for these mean values where we can see the arithmetic dependence of the lower order terms that appears in the asymptotic expansion.

• Communications of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.65-74
• /
• 2022

A valued field (K, ν) is called defectless if each of its finite extensions is defectless. In [1], Aghigh and Khanduja posed a question on defectless extensions of henselian valued fields: "if every simple algebraic extension of a henselian valued field (K, ν) is defectless, then is it true that (K, ν) is defectless?" They gave an example to show that the answer is "no" in general. This paper explores when the answer to the mentioned question is affirmative. More precisely, for a henselian valued field (K, ν) such that each of its simple algebraic extensions is defectless, we investigate additional conditions under which (K, ν) is defectless.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.37-43
• /
• 2020

In this paper, we propose an efficient AB² multiplication algorithm using SPB(shifted polynomial basis) over finite fields. Using the feature of the SPB, we split the equation for AB² multiplication into two parts. The two partitioned equations are executable at the same time, and we derive an algorithm that processes them in parallel. Then we propose an efficient semi-systolic AB² multiplier based on the proposed algorithm. The proposed multiplier has less area-time (AT) complexity than related multipliers. In detail, the proposed AB² multiplier saves about 94%, 87%, 86% and 83% of the AT complexity of the multipliers of Wei, Wang-Guo, Kim-Lee, Choi-Lee, respectively. Therefore, the proposed multiplier is suitable for VLSI implementation and can be easily adopted as the basic building block for various applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.510-520
• /
• 2011

In this paper, we propose a new multiplication algorithm for primitive polynomial with all 1 of coefficient in case that m is odd and even on finite fields $GF(3^m)$, and compose the multiplier with parallel input-output module structure using the presented multiplication algorithm. The proposed multiplier is designed $(m+1)^2$ same basic cells that have a mod(3) addition gate and a mod(3) multiplication gate. Since the basic cells have no a latch circuit, the multiplicative circuit is very simple and is short the delay time $T_A+T_X$ per cell unit. The proposed multiplier is easy to extend the circuit with large m having regularity and modularity by cell array, and is suitable to the implementation of VLSI circuit.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.9-17
• /
• 2013

In this paper, we propose a new multiplication algorithm for two polynomials using primitive polynomial with all 1 of coefficient on finite fields GF($2^m$), and design the multiplier with high-speed parallel input-output module structure using the presented multiplication algorithm. The proposed multiplier is designed $m^2$ same basic cells that have a 2-input XOR gate and a 2-input AND gate. Since the basic cell have no a latch circuit, the multiplicative circuit is very simple and is short the delay time $D_A+D_X$ per cell unit. The proposed multiplier is easy to extend the circuit with large m having regularity and modularity by cell array, and is suitable to the implementation of VLSI circuit.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.3-15
• /
• 2008

In this paper we study exponentiation in finite fields $F{_p}{^{k}}$(k is odd) with very special exponents such as they occur in algorithms for computing square roots. Our algorithmic approach improves the corresponding exponentiation independent of the characteristic of $F{_p}{^{k}}$. To the best of our knowledge, it is the first major improvement to the Tonelli-Shanks algorithm, for example, the number of multiplications can be reduced to at least 60% on average when $p{\equiv}1$ (mod 16). Several numerical examples are given that show the speed-up of the proposed methods.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.3
• /
• pp.509-520
• /
• 2003

Let p be a prime number, $Q_{p}$ the field of p-adic numbers, K a finite extension of $Q_{p}$, $\bar{K}}$ a fixed algebraic closure of K and $C_{p}$ the completion of K with respect to the p-adic valuation. Let E be a closed subfield of $C_{p}$, containing K. Given elements $t_1$...,$t_{r}$ $\in$ E for which the field K($t_1$...,$t_{r}$) is dense in E, we construct integral bases of E over K.

• Journal of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.417-426
• /
• 2017

We explicitly determine fundamental units and regulators of an infinite family of cyclic quartic function fields $L_h$ of unit rank 3 with a parameter h in a polynomial ring $\mathbb{F}_q[t]$, where $\mathbb{F}_q$ is the finite field of order q with characteristic not equal to 2. This result resolves the second part of Lehmer's project for the function field case.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.279-284
• /
• 1997

Let L/F be a finite separable extension of Henselian valued fields with same residue fields $\overline{L} = \overline{F}$. Let D be an inertially split division algebra over L, and let $^cD$ be the underlying division algebra of the corestriction $cor_{L/F} (D)$ of D. We show that the index $ind(^cD) of ^cD$ divides $[Z(\overline{D}) : Z(\overline {^cD})] \cdot ind(D), where Z(\overline{D})$ is the center of the residue division ring $\overline{D}$.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2000.10a
• /
• pp.162-168
• /
• 2000

A two-dimensional numerical model based on a finite volume method was formulated to solve the shallow water equations and applied for evaluating irrigation and drainage characteristics at large-sized paddy fields. Manning roughness coefficient was calibrated using the observed inundating depths at drainage tests and used for validating the model with the results from irrigation and drainage test. The simulated results were in good agreement with the observed inundating depths.