DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hahn, Sang-Geun | - |
dc.contributor.advisor | 한상근 | - |
dc.contributor.author | Park, Jung-Youl | - |
dc.contributor.author | 박정열 | - |
dc.date.accessioned | 2011-12-14T04:54:04Z | - |
dc.date.available | 2011-12-14T04:54:04Z | - |
dc.date.issued | 2002 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=173579&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/42040 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 수학전공, 2002.2, [ vii, 64 p. ] | - |
dc.description.abstract | In this paper, we describe the implementation of the elliptic curve point counting algorithm of Kim et al.. We survey the algorithms including the SST-algorithm proposed by Satoh et al., We also described the modified SST-algorithm by Kim et al. using the Gaussian normal basis, which is of the lowest time complexity of $O(N^{2μ+\frac{1}{μ+1}})$ where $O(N^μ)$ is the complexity of multiplying two N-bit numbers. All algorithms which is required for its implementation is fully given. Every step is explained in detail, and the actual running time result is also included. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | normal | - |
dc.subject | order | - |
dc.subject | elliptic | - |
dc.subject | implementation | - |
dc.subject | 속도 | - |
dc.subject | 구현 | - |
dc.subject | 위수 | - |
dc.subject | 타원 | - |
dc.title | (An) efficient implementation of elliptic curve point counting algorithm based on SST-algorithm with a GNB | - |
dc.title.alternative | SST방법에 기반하는, GNB를 이용한 타원 곡선 위수 계산 알고리즘의 효율적인 구현 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 173579/325007 | - |
dc.description.department | 한국과학기술원 : 수학전공, | - |
dc.identifier.uid | 020003213 | - |
dc.contributor.localauthor | Hahn, Sang-Geun | - |
dc.contributor.localauthor | 한상근 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.