• Communications of the Korean Mathematical Society
• /
• v.12 no.3
• /
• pp.539-541
• /
• 1997

Let X be a smooth projective threefold. Let C be a smooth projective curve and let $f : X \to C$ be a fiber space with connected fiber S. Assume that $q_1(S) = 0$. Then we have $-X(O_C)X(O_S) \leq -X(O_X)$.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.1
• /
• pp.57-67
• /
• 2005

Fast scalar multiplication of points on elliptic curve is important for elliptic curve cryptography applications. In order to vary field sizes depending on security situations, the cryptography coprocessors should support variable length finite field arithmetic units. To determine the effective variable length finite field arithmetic architecture, two well-known curve scalar multiplication algorithms were implemented on FPGA. The affine coordinates algorithm must use a hardware division unit, but the projective coordinates algorithm only uses a fast multiplication unit. The former algorithm needs the division hardware. The latter only requires a multiplication hardware, but it need more space to store intermediate results. To make the division unit versatile, we need to add a feedback signal line at every bit position. We proposed a method to mitigate this problem. For multiplication in projective coordinates implementation, we use a widely used digit serial multiplication hardware, which is simpler to be made versatile. We experimented with our implemented ECC coprocessors using variable length finite field arithmetic unit which has the maximum field size 256. On the clock speed 40 MHz, the scalar multiplication time is 6.0 msec for affine implementation while it is 1.15 msec for projective implementation. As a result of the study, we found that the projective coordinates algorithm which does not use the division hardware was faster than the affine coordinate algorithm. In addition, the memory implementation effectiveness relative to logic implementation will have a large influence on the implementation space requirements of the two algorithms.

• ETRI Journal
• /
• v.30 no.3
• /
• pp.365-376
• /
• 2008

This paper presents the design and implementation of a hyperelliptic curve cryptography (HECC) coprocessor over affine and projective coordinates, along with measurements of its performance, hardware complexity, and power consumption. We applied several design techniques, including parallelism, pipelining, and loop unrolling, in designing field arithmetic units, group operation units, and scalar multiplication units to improve the performance and power consumption. Our affine and projective coordinate-based HECC processors execute in 0.436 ms and 0.531 ms, respectively, based on the underlying field GF($2^{89}$). These results are about five times faster than those for previous hardware implementations and at least 13 times better in terms of area-time products. Further results suggest that neither case is superior to the other when considering the hardware complexity and performance. The characteristics of our proposed HECC coprocessor show that it is applicable to high-speed network applications as well as resource-constrained environments, such as PDAs, smart cards, and so on.

• Journal of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.461-473
• /
• 2016

Let C be a projective plane curve of degree d whose singularities are all isolated. Suppose C is not concurrent lines. P loski proved that the Milnor number of an isolated singlar point of C is less than or equal to $(d-1)^2-{\lfloor}\frac{d}{2}{\rfloor}$. In this paper, we prove that the Milnor sum of C is also less than or equal to $(d-1)^2-{\lfloor}\frac{d}{2}{\rfloor}$ and the equality holds if and only if C is a P loski curve. Furthermore, we find a bound for the Milnor sum of projective plane curves in terms of GIT.

• Journal of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.359-369
• /
• 2000

Let X be an integral Gorenstein projective curve with g:=pa(X) $\geq$ 3. Call $G^r_d$ (X,**) the set of all pairs (L,V) with L$\epsilon$Pic(X), deg(L) = d, V $\subseteq$ H^0$(X,L), dim(V) =r+1 and V spanning L. Assume the existence of integers d, r with 1 $\leq$ r$\leq$ d $\leq$ g-1 such that there exists an irreducible component, , of $G^r_d$(X,**) with dim($\Gamma$) $\geq$ d - 2r and such that the general L$\geq$$\Gamma$ is spanned at every point of Sing(X). Here we prove that dim( ) = d-2r and X is hyperelliptic.

• International Journal of Advanced Culture Technology
• /
• v.6 no.4
• /
• pp.323-330
• /
• 2018

The growth of the older population is expected to further increase social problems associated with population aging, such as isolation, poverty, and depression. The emerging issues associated with the older population are also expected to provide further momentum on studies about the dwelling environment as factors that ensure the health of older people as well as improve their quality of life. Therefore, approaches for explaining the issues of the older age group should be diversified using a variety of factors and appropriate analytic tools. Studies on measuring depression have principally focused on assessing an objective self-report questionnaire, usually in a highly structured, textual form which may not reflect the cognitive impairment of older adults. The aim of this study was to define and measure dwelling depression among older adults in Korea. There are two specific hypotheses in this study as follows: (a) there will be statistically significant relationships with dwelling dissatisfaction and depression, and (b) dwelling depression tools containing text and images will be, respectively, assessment tools that have a good construct with content validity and reliability. In the first experiment, to define and measure dwelling depression, 301 people over 65 years old living in single and two-person households were surveyed using a text-based dwelling depression questionnaires from September 1-30, 2017. In the second experiment, to examine whether the projective image questionnaire could serve as a suitable replacement for the text-based questionnaires, the same participants were surveyed from January 22 to February 2, 2018. The results show that depression has a close correlation with dwelling dissatisfaction. In addition, the geriatric dwelling depression index (GDDI) based on the projective image was refined. Additionally, the projective image questionnaire has a close correlation with the text-based questionnaire. Finally, through ROC curve analysis, it was found that the projective image questionnaire can accurately predict a depression group. To this end, this preliminary study examined the validity of the projective image questionnaire in older adults to make this instrument feasible for older populations and to contribute to a profound understanding of geriatric depression due to the living environment. We hope they will provide a basis for further research on psychological diagnoses using projective images.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1355-1370
• /
• 2019

A curve $X{\subset}\mathbb{P}^r$ has maximal rank if for each $t{\in}\mathbb{N}$ the restriction map $H^0(\mathcal{O}_{\mathbb{P}r}(t)){\rightarrow}H^0(\mathcal{O}_X(t))$ is either injective or surjective. We show that for all integers $d{\geq}r+1$ there are maximal rank, but not arithmetically Cohen-Macaulay, smooth curves $X{\subset}\mathbb{P}^r$ with degree d and genus roughly $d^2/2r$, contrary to the case r = 3, where it was proved that their genus growths at most like $d^{3/2}$ (A. Dolcetti). Nevertheless there is a sector of large genera g, roughly between $d^2/(2r+2)$ and $d^2/2r$, where we prove the existence of smooth curves (even aCM ones) with degree d and genus g, but the only integral and non-degenerate maximal rank curves with degree d and arithmetic genus g are the aCM ones. For some (d, g, r) with high g we prove the existence of reducible non-degenerate maximal rank and non aCM curves $X{\subset}\mathbb{P}^r$ with degree d and arithmetic genus g, while (d, g, r) is not realized by non-degenerate maximal rank and non aCM integral curves.

• Communications of the Korean Mathematical Society
• /
• v.10 no.1
• /
• pp.1-10
• /
• 1995

In this paper we show that for each divisor class c of degree zero on a projective curve C (not necessarily smooth), there exists a unique function $\hat{h}_c$ on C up to bounded functions. Section 1 contain basic definitions and a brief summary of classical results on Jacobians and heights. In section 2, we prove the existence of "canonical height" on a singular curves and in section 3 we prove the analogouse results on N$\acute{e}$ron functions for singular curves. This is a part of the author's doctorial thesis at Ewha Womens University under the guidence of professor Sung Sik Woo.g Sik Woo.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.4
• /
• pp.763-770
• /
• 2006

Let X be a four-dimensional projective variety defined over the field of complex numbers with only terminal singularities. We prove that if the intersection number of the canonical divisor K with every very general curve is positive (K is almost numerically positive) then every very general proper subvariety of X is of general type in ';he viewpoint of geometric Kodaira dimension. We note that the converse does not hold for simple abelian varieties.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.188-190
• /
• 2017

투영(projective) 좌표계를 이용한 스칼라 곱셈(scalar multiplication) 연산을 지원하는 224-비트 타원곡선 암호(Elliptic Curve Cryptography; ECC) 프로세서의 설계에 대해 기술한다. 소수체 GF(p)상의 덧셈, 뺄셈, 곱셈 등의 유한체 연산을 지원하며, 연산량과 하드웨어 자원소모가 큰 나눗셈 연산을 제거함으로써 하드웨어 복잡도를 감소시켰다. 수정된 Montgomery ladder 알고리듬을 이용하여 스칼라 곱셈 연산을 제어하였으며, 단순 전력분석에 보다 안전하다. 스칼라 곱셈 연산은 최대 2,615,201 클록 사이클이 소요된다. 설계된 ECC-P224 프로세서는 Xilinx ISim을 이용한 기능검증을 하였다. Xilinx Virtex5 FPGA 디바이스 합성결과 7,078 슬라이스로 구현되었으며, 최대 79 MHz에서 동작하였다.