• Kyungpook Mathematical Journal
• /
• 제31권1호
• /
• pp.83-87
• /
• 1991

• 호남수학학술지
• /
• 제14권1호
• /
• pp.123-126
• /
• 1992

• 대한수학회지
• /
• 제31권1호
• /
• pp.1-9
• /
• 1994

• 대한수학회보
• /
• 제16권1호
• /
• pp.25-30
• /
• 1979

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 D
• /
• pp.2576-2578
• /
• 2001

Elliptic curve cryptosystems based on discrete logarithm problem in the group of points of an elliptic curve defined over a finite field. The discrete logarithm in an elliptic curve group appears to be more difficult than discrete logarithm problem in other groups while using the relatively small key size. An implementation of elliptic curve cryptosystems needs finite field arithmetic computation. Hence finite field arithmetic modules must require less hardware resources to archive high performance computation. In this paper, a new architecture of finite field multiplier using conversion scheme of normal basis representation into polynomial basis representation is discussed. Proposed architecture provides less resources and lower complexity than conventional bit serial multiplier using normal basis representation. This architecture has synthesized using synopsys FPGA express successfully.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제5권
• /
• pp.523-523
• /
• 1997

Suppose that G is a group of permutations of a set ${\Omega}$. For a finite subset ${\gamma}$of${\Omega}$, the movement of ${\gamma}$ under the action of G is defined as move(${\gamma}$):=$max\limits_{g{\epsilon}G}|{\Gamma}^{g}{\backslash}{\Gamma}|$, and ${\gamma}$ will be said to have restricted movement if move(${\gamma}$)<|${\gamma}$|. Moreover if, for an infinite subset ${\gamma}$of${\Omega}$, the sets|{\Gamma}^{g}{\backslash}{\Gamma}| are finite and bounded as g runs over all elements of G, then we may define move(${\gamma}$)in the same way as for finite subsets. If move(${\gamma}$)${\leq}$m for all ${\gamma}$${\subseteq}$${\Omega}$, then G is said to have bounded movement and the movement of G move(G) is defined as the maximum of move(${\gamma}$) over all subsets ${\gamma}$ of ${\Omega}$. Having bounded movement is a very strong restriction on a group, but it is natural to ask just which permutation groups have bounded movement m. If move(G)=m then clearly we may assume that G has no fixed points is${\Omega}$, and with this assumption it was shown in [4, Theorem 1]that the number t of G=orbits is at most 2m-1, each G-orbit has length at most 3m, and moreover|${\Omega}$|${\leq}$3m+t-1${\leq}$5m-2. Moreover it has recently been shown by P. S. Kim, J. R. Cho and C. E. Praeger in [1] that essentially the only examples with as many as 2m-1 orbits are elementary abelian 2-groups, and by A. Gardiner, A. Mann and C. E. Praeger in [2,3]that essentially the only transitive examples in a set of maximal size, namely 3m, are groups of exponent 3. (The only exceptions to these general statements occur for small values of m and are known explicitly.) Motivated by these results, we would decide what role if any is played by primes other that 2 and 3 for describing the structure of groups of bounded movement.

• 대한수학회지
• /
• 제38권6호
• /
• pp.1167-1177
• /
• 2001

The groups generated by reflections in faces of Coxeter polyhedra in three-dimensional Thurstons spaces are considered. We develop a method for finding of finite index subgroups of Coxeter groups which uniformize three-dimensional manifolds obtained as two-fold branched coverings of manifolds of Heegaard genus one, that are lens spaces L(p, q) and the space S$^2$$\times$S$^1$.

• 대한수학회보
• /
• 제49권5호
• /
• pp.949-959
• /
• 2012

In general, a class-preserving automorphism of generalized free products of nilpotent groups, amalgamating a cyclic normal subgroup of order 8, need not be an inner automorphism. We prove that every class-preserving automorphism of generalized free products of nitely generated nilpotent groups, amalgamating a cyclic normal subgroup of order less than 8, is inner.

• 대한수학회지
• /
• 제34권1호
• /
• pp.227-235
• /
• 1997

In recent years there has been much interest in the study of groups satisfying various permutability conditions (see, for instance, [1], [2] and [3]). More recently, the following condition has been studied: for some , if S is any subset of m elements of a group G, then $$\mid$S^2$\mid$ < m^2$ (where, for subsets A, B of G, AB stands for ${ab; a \in A, b \in B}$).

• 대한수학회지
• /
• 제50권3호
• /
• pp.579-589
• /
• 2013

A finite group G is called an NSN-group if every proper subgroup of G is either normal in G or self-normalizing. In this paper, the non-NSN-groups whose proper subgroups are all NSN-groups are determined.