• 충청수학회지
• /
• 제19권4호
• /
• pp.319-324
• /
• 2006

Let K be a finite cyclic extension of $k=\mathbb{F}_q(T)$ of prime degree ${\ell}$. Let ${\tilde{\mathcal{C}}}l_{K,{\ell}}$ be the Sylow ${\ell}$-subgroup of the ideal class group ${\tilde{\mathcal{C}}}l_K$ of $\mathcal{O}_K$. The structure of ${\tilde{\mathcal{C}}}l_{K,{\ell}}$ as $\mathbb{Z}_{\ell}[G]$/<$N_G$>-module is determined the dimensions $${\lambda}_i\;:=dim_{\mathbb{F}_{\ell}}({\tilde{\mathcal{C}}}l_{K,{\ell}}^{({\sigma}-1)^{i-1}}/{\tilde{\mathcal{C}}}l_{K,{\ell}}^{({\sigma}-1)^i})$$ for $i{\geq}1$. In this paper we investigate the dimensions ${\lambda}_1$ and ${\lambda}_2$.

• 대한전자공학회논문지
• /
• 제25권5호
• /
• pp.528-535
• /
• 1988

This paper presents a constructing theory of variable arithmetic operation systems for computing multiplications and multiplicative inverse in GF(2**m) based on a modulo operation of degree on elements in Galois fields. The proposed multiplier is composed of a zero element control part, input element conversion part, inversion circuit, and output element conversion part. These systems can reduce reasonable circuit areas due to the common use of input/output element converison parts, and the PLA and module structure provice a variable property capable of convertible uses as arithmetic operation systems over different finite fields. This type of designs gives simple, regular, expandable, and concurrent properties suitable for VLSI implementation. Expecially, the multiplicative inverse circuit proposed here is expected to offer a characteristics of the high operation speed than conventional method.