DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hahn, Sang-Geun | - |
dc.contributor.advisor | 한상근 | - |
dc.contributor.author | Kim, Hwan-Joon | - |
dc.contributor.author | 김환준 | - |
dc.date.accessioned | 2011-12-14T04:39:01Z | - |
dc.date.available | 2011-12-14T04:39:01Z | - |
dc.date.issued | 2000 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=157756&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41821 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 수학전공, 2000.2, [ [ii], [33] p. ] | - |
dc.description.abstract | No subexponential time algorithm is known yet for the Elliptic Curve Discrete Logarithm Problem(ECDLP) except the cases of singular curves, supersingular curves and anomalous curves. In this paper, we introduce the lifting problem and show that it implies the ECDLP and integer factorization problem(IFP) and we note that finding a point in $E_1(Q)$, the kernel of the reduction map, also implies the ECDLP and the IFP since it solves the lifting problem. Moreover, we analyze the difficulty of the lifting problem by estimating the minimum of the canonical heights on the kernel of the reduction map. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Discrete logarithm | - |
dc.subject | Factorization | - |
dc.subject | 타원곡선 | - |
dc.subject | 이산로그 | - |
dc.subject | 소인수 분해 | - |
dc.subject | Elliptic curve | - |
dc.title | Elliptic curve discrete logarithm and lifting problem | - |
dc.title.alternative | 타원곡선 이산로그와 올림 문제 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 157756/325007 | - |
dc.description.department | 한국과학기술원 : 수학전공, | - |
dc.identifier.uid | 000955104 | - |
dc.contributor.localauthor | Hahn, Sang-Geun | - |
dc.contributor.localauthor | 한상근 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.